Answer -
(a) Given,
d(t) : 1101
x(t) : +1 +1 -1 +1
c(t) : 100110111000
g(t) : +1 -1 -1 +1 +1 -1 +1 +1 +1 -1 -1 -1
Spread Sequence, p(t) = x(t)g(t)
x(t) : +1 +1 +1 +1 +1 +1 -1 -1 -1 +1 +1 +1
g(t) : +1 -1 -1 +1 +1 -1 +1 +1 +1 -1 -1 -1
p(t) : +1 -1 -1 +1 +1 -1 -1 -1 -1 -1 -1 -1
The Binary sequence corresponding to p(t) : 100110000000
(b) Bandwidth of the transmitted spread signal (DSSS-BPSK) is same as clock rate of the pseudorandom binary sequence = 300 Hz.
(c) The processing gain is,
Processing gain = (Pseudorandom chip rate) / (data rate)
Processing gain = 300 / 100
Processing gain = 3
Processing gain in dB = 10 log103 = 4.77 dB.
(d) Despread sequence, ((p(t)) (delayed g(t)) =
p(t) : +1 -1 -1 +1 +1 -1 -1 -1 -1 -1 -1 -1
g'(t) : -1 +1 -1 -1 +1 +1 -1 +1 +1 +1 -1 -1
r(t) : -1 -1 +1 -1 +1 -1 +1 -1 -1 -1 +1 +1
Majority logic decoding ( taking 3 bits at a time ) yields : 0001
(e) In comparison with d(t), we see that the decoded bit sequence differs in bit positions 1 and 2. Thus, the number of bit errors in the decoded sequence is 2 .
Consider a DS-BPSK spread spectrum transmitter in Figure 2. Let d(t) be a binary sequence 1101...