P4. 2๊ฐ์ CDMA ์ก์ ์๊ฐ ๊ฐ๊ฐ (1, 1, 1, -1, 1, -1, -1, -1), (1, -1, 1, 1, 1, 1, 1, 1)์ ์ฝ๋๋ฅผ ๊ฐ๊ณ ์๋ค๋ฉด, ์๋๋ฐฉ ์์ ์๊ฐ ๋ฐ์ดํฐ๋ฅผ ์ ๋๋ก ํด์ํ ์ ์๊ฒ ๋๊ฐ? ์ค๋ช ํ๋ผ.
Added by Tara H.
Close
Step 1
$s_1 = (1, 1, 1, -1, 1, -1, -1, -1)$ $s_2 = (1, -1, 1, 1, 1, 1, 1, 1)$ Show moreโฆ
Show all steps
Your feedback will help us improve your experience
Adi S and 82 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Adi S.
The following picture is a copy of a Figure in the textbook. It shows a CDMA example that supports two senders. Suppose that the receiver wanted to receive the data being sent by sender 2. Show (by calculation) that the receiver is indeed able to recover sender 2's data from the aggregate channel signal by using sender 2's code.
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD