Scribd
Upload
18 views52 pages

Chapter 1

Chapter 1

Uploaded by

leprofesseurgeorges2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views52 pages

Chapter 1

Chapter 1

Uploaded by

leprofesseurgeorges2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 52

1. Construct the code in an 8x8 Walsh matrix.

Then show that the first and last codes are orthogonal to each other.
2. Show if the two codes (-1 1 -1 1 -1 1 -1 1) and (-1 -1 1 1 -1 -1 1 1) are orthogonal to each other or not.
3 Consider a CDMA system in which users A and B have the Walsh codes (-1 1 -
1 1 -1 1 -1 1) and (-1 -1 1 1 -1 -1 1 1) respectively. Show the CDMA signal
(received by the receiver) in the following cases:

a. A transmits a data bit 1 and B does not transmit.


b. A transmits a data bit 1 and B transmits a data bit 1. Assume the received
power from both A and B is the same.
c. A transmits a data bit 0 and B transmits a data bit 1. Assume the received
power from both A and B is the same.
d. A transmits a data bit 0 and B transmits a data bit 0. Assume the received
power from both A and B is the same.
e. A transmits a data bit 1 and B transmits a data bit 1. Assume the received
power from B is twice that received from A.
f. A transmits a data bit 0 and B transmits a data bit 1. Assume the received
power from B is twice that received from A. The noise to the transmitted signal
is (-1 0 1 0 -1 0 1 -1).
4. Consider a CDMA system in which users A, B and C have the codes
(1 -1 -1 1 -1 1), (1 1 -1 -1 1 1) and (1 1 -1 1 1 -1) respectively. Show the
modulated and demodulated CDMA signals in the following cases:

a. A transmits a data bit 1, B and C do not transmit. Receiver attempts


to recover A’s transmission. (Comment on the result)
b. B transmits a data bit 1, A and C do not transmit. Receiver attempts
to recover A’s transmission. (Comment on the result)
c. C transmits a data bit 1, A and B do not transmit. Receiver attempts
to recover B’s transmission. (Comment on the result)
d. B and C transmit a data bit 1, A does not transmit. Receiver
attempts to recover B’s transmission. (Comment on the result)
Consider a CDMA system using binary spreading codes, with three
users in the system. Each user is assigned a unique binary code of
fixed length L=5, following the table below:
User 1 1 1 1 1 -1
User 2 1 -1 -1 1 -1
User 3 1 -1 -1 -1 -1

a. How would the sequence 1, 0, 1 be encoded for User 2? And for


User 3?
b. Assuming that the sequence 1, 0, 1 was encoded for User 2, How will
User 2 decode the encoded bits? And how will User 1 decode the
encoded bits.
Consider the uplink of a CDMA system with two synchronous users 1 and 2. User 1 spreads its
data signal with the sequence C1 = (-1 -1 -1 1 -
1 1 1 1). User 2 spreads its data signal with the sequence C2 = (1 1 -1 1 1 -1 -1 -
1). The received values for the chips of the first bit are (0 0 -2 2 0 0 0 0)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy