Question

In a CDMA system, four stations use the following chip sequences: station A: (-1 -1 -1...

In a CDMA system, four stations use the following chip sequences:

station A: (-1 -1 -1 +1 +1 -1 +1 +1)

station B: (-1 -1 +1 -1 +1 +1 +1 -1)

station C: (-1 +1 -1 +1 +1 +1 -1 -1)

station D: (-1 +1 -1 -1 -1 -1 +1 -1)

a station receives sequence (-1 +1 -3 +1 -1 -3 +1 +1). Which of the four stations have transmitted? For the each of the stations that have transmitted, what binary value did they transmit?

Homework Answers

Answer #1

Given

station A: (-1 -1 -1 +1 +1 -1 +1 +1)

station B: (-1 -1 +1 -1 +1 +1 +1 -1)

station C: (-1 +1 -1 +1 +1 +1 -1 -1)

station D: (-1 +1 -1 -1 -1 -1 +1 -1)

a station receives sequence (-1 +1 -3 +1 -1 -3 +1 +1).

As we know CDMA system works on concept of orthogonal codes

For station A

((-1 -1 -1 +1 +1 -1 +1 +1) . (-1 +1 -3 +1 -1 -3 +1 +1) ) /8 = 8/8 = 1

For Station B

((-1 -1 +1 -1 +1 +1 +1 -1).(-1 +1 -3 +1 -1 -3 +1 +1))/8 = -8/8 = -1

For Station C

((-1 +1 -1 +1 +1 +1 -1 -1).(-1 +1 -3 +1 -1 -3 +1 +1))/8 =0/8= 0

For Station D

((-1 +1 -1 -1 -1 -1 +1 -1).(-1 +1 -3 +1 -1 -3 +1 +1))/8 = 8/8 =1

Note : Here were performed one to one product.

From this we can conclude

Station A : Transmitted 1

Station B : Transmitted 0

Station C : Silent

Station D: Transmitted 1

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider four wireless stations, A, B, C, D. Station A can communicate with all other stations....
Consider four wireless stations, A, B, C, D. Station A can communicate with all other stations. B can communicate with A, C. C can communicate with A, B, D. D can communicate with A and C. (a)When B is sending to A, what other communications are possible? (b)When A is sending to C, what other communications are possible? Explain your responses.
(1) Consider a noisy wireless channel which flips each bit ( 0 becomes 1 or 1...
(1) Consider a noisy wireless channel which flips each bit ( 0 becomes 1 or 1 becomes 0 ) with probability p. To guarantee the information is received reliably, each bit is transmitted m times (called repetition coding). For example, if m = 3 and “0” needs to be sent, you transmit “000” instead of “0”. (1) Consideranoisywirelesschannelwhichflipseachbit(0becomes1or1becomes0)withprobabilityp. To guarantee the information is received reliably, each bit is transmitted m times (called repetition coding). For example, if m = 3...
Use L’Hopital’s Rule to determine if the following sequences converge or diverge. If the sequence converges,...
Use L’Hopital’s Rule to determine if the following sequences converge or diverge. If the sequence converges, what does it converge to? (a) an = (n^2+3n+5)/(n^2+e^n) (b) bn = (sin(n −1 ))/( n−1) (c) cn = ln(n)/ √n
Which of the following are degree sequences of graphs? In each case, either draw a graph...
Which of the following are degree sequences of graphs? In each case, either draw a graph with the given degree sequence or explain why no such graph exists. a- (2,0,6,4,0,0,0,...) b- (0,10,0,1,2,1,0,...) c- (3,1,0,2,1,0,0,...) d- (0,0,2,2,1,0,0,..)
Consider the following three sequences of one hundred heads and tails each: Sequence #1: HTTHHHTTHTTHHTTHTTHTTTTHHHTTTHHTHTTHHTTTTHTTTTTHHT HTHTHHHTTTHTHHTHHTHHTHTTHTTHTTHHHHHHHTHHTTTTTHHHHH...
Consider the following three sequences of one hundred heads and tails each: Sequence #1: HTTHHHTTHTTHHTTHTTHTTTTHHHTTTHHTHTTHHTTTTHTTTTTHHT HTHTHHHTTTHTHHTHHTHHTHTTHTTHTTHHHHHHHTHHTTTTTHHHHH Sequence #2: HHTHTTTHTTHTHHHTTTHTTHHHTHTTTHTHHHTHTHTTTHTTTTHHHT THTTTHTTHHHTHTHHTTTHHHTTTHTHTTHTHTHTTTHTTHHTHHTTTH Sequence #3: THTHTHHTHHHTTTHHHTTTTTTTTTHHHTTTHHHTHTHHHTHTTTHTHH THTTHHHTTTTTTTHHTHHHHHTHHHHHHHHTHHHHHTTHHHHTTHTTHT At least one of these sequences was generated by actually tossing a quarter one hundred times, and at least one was generated by a human sitting at a computer and hitting the “H” and “T” keys one hundred times between them and trying (possibly not very hard) to make it seem random. 1. Try to figure...
Solve each problems using Polya's four-step problem-solving strategy: 1. In the complex number system, i^1 =...
Solve each problems using Polya's four-step problem-solving strategy: 1. In the complex number system, i^1 = i; i^2 = -1; i^3 = -i; i^4 = 1; i^5 = i... Find i^173. 2. A coffee shop is giving away a signature annual planner. In the mechanics, each customer has to collect 24 stickers to avail of the said planner, and customers can share stickers. At the end of the promo period, John had a the most number of stickers, more than...
Examine if the following student definitions clearly capture all sequences that have limits and clearly exclude...
Examine if the following student definitions clearly capture all sequences that have limits and clearly exclude all sequences that don’t have limits. Explain how you can tell. (a) Amy’s definition L is a limit of a sequence {an}∞ n=1 if and only if an approaches L as n approaches ∞. (b) Brittany’s definition L is a limit of a sequence {an}∞ n=1 if and only if an gets closer to but never reaches L as n approaches ∞. (c) Cindy’s...
1. Find the first five terms in sequences with the following nth terms. a. n2+6 b....
1. Find the first five terms in sequences with the following nth terms. a. n2+6 b. 5n+3 c. 10n-6 d. 3n-1 2. A sheet of paper is cut into 6 same-size parts. Each of the parts is then cut into 6 same-size parts and so on. a. After the 8th cut, how many of the smallest pieces of paper are​ there? b. After the nth​ cut, how many of the smallest pieces of paper are​ there? 3. Find the sum...
1.a Let X = the number of nonzero digits in a randomly selected 4-digit PIN that...
1.a Let X = the number of nonzero digits in a randomly selected 4-digit PIN that has no restriction on the digits. What are the possible values of X? 1, 2, 3, 4 0, 1, 2, 3, 4, ... 0, 1, 2, 3, 4 0, 1, 2, 3 1, 2, 3, 4, ... For the following possible outcomes, give their associated X values. PIN associated value 1107 2070 7177 1b. The number of pumps in use at both a six-pump...
   Marathon petroleum distribution company manages 600 gas stations in Michigan. Each gas station typically has four...
   Marathon petroleum distribution company manages 600 gas stations in Michigan. Each gas station typically has four underground storage tanks (UGST), three for gasoline and one for diesel. The UGST some times develop leaks due to corrosion or changes in soil conditions. Based on historical data, Marathon estimates that the probability that a given UGST develops a leak during a given year is 0.002 for gasoline storage tanks and higher at 0.003 for diesel storage tanks potentially due to higher density...