Consider three sender-receiver pairs (S1, R1), (S2, R2), and (S3, R3) that share a channel using CDMA. Suppose the chipping sequences are as follows:

Sender Chipping Sequence

S1 (-1 -1 -1 +1 +1 -1 +1 +1)

S2 (-1 -1 +1 -1 +1 +1 +1 -1)

S3 (-1 +1 -1 +1 +1 +1 -1 -1)

Suppose that S1 wishes to transmit a 1, S2 wishes to transmit a -1 (i.e., the logical symbol 0), and S3 wishes to transmit a 1.

1. Show how the senders encode their messages.

2. Show what is actually transmitted through the channel.

3. Show how the receivers recover the messages of their respective senders.

Answer rating: 100% (QA)

Above problem is solved by using principle of Code Division M... View the full answer