Introduction to Wireless and Cellular Communications

Assignment 10 Solutions

1) Consider an m-sequence generator using the fourth-degree primitive polynomial

4
1 + 𝑋 + 𝑋 . Which of the following is the correct feedforward shift register
representation of the given primitive polynomial?

a.

b.

c.

d. None of the above

Answer: (c)

2) For the above question, with the initialization of {X1, X2, X3, X4} = {1, 0, 0, 0}, what is
the output m-sequence?
 a. 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1
b. 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1
c. 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0
d. 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1

Answer: (b)

3) In DS-SS with a length of spreading sequence Q, which of the following is true regarding the
frequency response of the DS-SS pulse shaping signal?
a) Bandwidth gets scaled by Q
b) Magnitude gets scaled by 1/Q2
c) Both a) and b)
d) None of the above

Answer: (c)
Solution:
In DS-SS, bandwidth gets scaled by Q, and the frequency response’s magnitude is scaled by 1/Q2.
So both options a) and b) are correct.

4) What is the bandwidth of a DS-SS system with a spreading factor Q = 32 and Symbol time Ts =
8µs?
a) 2MHz
b) 3MHz
c) 4MHz
d) 5MHz

Answer: (c)
Solution:
𝐵𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ = 1
= 𝑄
= 32
−6
= 4 𝑀𝐻𝑧
𝑇 𝑇
𝑐 𝑠 8*10

5) What is the symbol duration for a DS-SS system with a spreading factor Q = 32 and Chip
Duration (Tc) = 16 µs?
a) 2 µs
b) 4 µs
c) 512 µs
d) 256 µs
 Answer: (c)
Solution:
Symbol Duration, 𝑇 = 𝑄 * 𝑇 = 32 * 16 µ𝑠 = 512 µ𝑠
𝑠 𝑐

6) Which of the following is an advantage of the DS-SS system?

a) It reduces the interference due to other users by using orthogonal codes
b) It is less likely to be intercepted
c) It overcomes the effect of frequency selective fading
d) All the above are advantages of the DS-SS system

Answer: (d)
Solution:
Spreading codes used in DS-SS are very close to uncorrelated. Thus, only the corresponding user’s
signal will have high energy when a multiuser DS-SS signal is correlated with a particular user’s
spreading code. Other user’s signals can be equivalently treated as noise.
Spread spectrum signals are less likely to be intercepted than other signals because their amplitude
is so low that they are comparable to noise amplitudes. Hence, unless the Eavesdropper knows the
spreading code, they cannot intercept the signal.
The frequency selective fading channel has a lot of multipath components. The RAKE receiver
takes advantage of these multipath components. Thus, frequency selective fading is helpful.

7) We are given a pulse 𝑔(𝑡) = 𝑟𝑒𝑐𝑡 ( 𝑡− 𝑇/2

𝑇 ). The Fourier Transform of 𝑔(𝑡) is?
−𝑗π𝑓𝑇
a) 𝑇𝑠𝑖𝑛𝑐(𝑓𝑇)𝑒
−𝑗π𝑓𝑇
b) 𝑠𝑖𝑛𝑐(𝑓𝑇)𝑒
−𝑗2π𝑓𝑇
c) 𝑇𝑠𝑖𝑛𝑐(𝑓𝑇)𝑒
−𝑗2π𝑓𝑇
d) 𝑠𝑖𝑛𝑐(𝑓𝑇)𝑒

Answer: (a)
Solution:
 −𝑗2π𝑓τ
𝑥(𝑡 − τ) ⇔ 𝑋(𝑓)𝑒

𝐴 𝑟𝑒𝑐𝑡( 𝑇𝑡 ) ⇔ 𝐴𝑇𝑠𝑖𝑛𝑐(𝑓𝑇)
𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝐴𝑟𝑒𝑐𝑡( 𝑡−τ −𝑗2π𝑓τ

𝑇
) ⇔ 𝐴𝑇𝑠𝑖𝑛𝑐(𝑓𝑇)𝑒

Plugging in values for 𝐴 = 1and τ = 𝑇/2, we get the Fourier Transform as

−𝑗π𝑓𝑇 −𝑗π𝑓𝑇
𝐺(𝑓) = 𝑇𝑠𝑖𝑛𝑐(𝑓𝑇)𝑒 = 𝑇𝑠𝑖𝑛𝑐(𝑓𝑇)𝑒

8) In the above question, the first zero crossing of |𝐺(𝑓)|occurs at a frequency of?
a) 1/T
b) 2/T
c) 1/2T
d) 0

Answer: (a)
Solution:

Zero crossings occur when 𝑇

𝑠𝑖𝑛𝑐(𝑓𝑇) = 0 ⇒ 𝑓 = 𝑛
, 𝑛 ∈ 𝑍. Therefore, the first zero
crossing occurs at 𝑓 = . 1
𝑇

9) Assume two random sequences, X and Y, each length Q. What would be the power of
interference between these sequences when there is a unit lag?
a) 0
b) 1
c) 1
𝑄
d) Q

Answer: (c)
Solution:
𝑄−1
𝑅 [1] = 1
∑ 𝑥[𝑙] . 𝑦 [𝑙 − 1]
𝑥𝑦 𝑄
𝑙=0

The power of interference is given by,

 𝖥| 2
|
2
|
𝐸𝖥 𝑅 [1] ⎤ = 𝐸⎢|
1
∑
𝑄−1
2
𝑥[𝑙] . 𝑦 [𝑙 − 1] ⎥⎤ 1 𝑄−1 ] [ 2
] 1 𝑄−1 1
| [
| = = ∑ 1 =
2
⎣⎢ 𝑥𝑦
⎥⎦ ⎢|| 𝑄 𝑙=0 | ⎥ ∑ 𝐸 |𝑥[𝑙]|
𝑙=0
* 𝐸 |𝑦[𝑙 − 1]| 𝑄
𝑙=0
𝑄
⎣ 2

| 𝑄
⎦

10) Consider m-sequences with m = 4. What will be the number of 0s and 1s, respectively, in the
sequences?
a) 8 and 7
b) 7 and 8
c) Cannot say
d) 8 ones and 7 zeros if the sequence begins with 1. Else 7 zeros and 8 ones, if the sequence
begins with 0.

Answer: (a)
Solution:
Number of 1s in a m-sequence = 2m-1 = 24-1 = 23 = 8
Number of 0s in a m-sequence = 2m-1 - 1 = 24-1 - 1 = 23 - 1 = 8-1 = 7

11) What will be the result of the autocorrelation of an m-sequence with itself with zero lag?
a) 1
𝑄2
b) 1
c) 1
𝑄
d) 0.25

Answer: (b)
Solution:
𝑄−1 *
𝑅 [𝑘] = 1

𝑥 𝑄 ∑ 𝑥[𝑙] . 𝑥 [𝑙 − 𝑘]𝑚𝑜𝑑 𝑞
𝑙=0

For zero lag, k=0

𝑄−1
𝑅 [0] = 1 * 1
. 𝑄 = 1
𝑥 ∑ 𝑥[𝑙] . 𝑥 [𝑙] = 𝑄
𝑄 𝑙=0
12) Consider m-sequences with m=4. Assume that all of the 15 different sequences are assigned to 15
other users. What can be a potential problem in doing so in a multipath environment?
a) There would be no way of distinguishing between signals which are multipath of the same
user from the signals of the other users.
b) The system cannot handle multiuser interference.
c) Both a) and b)
d) None of the above

Answer: (a)
Solution:
As explained in the lectures

13) Which of the following statement(s) is correct about scrambling and encryption in the
context of CDMA?
a) m-sequences are used in cdma2000 for scrambling
b) The reverse operation is easy for scrambling but hard for encryption.
c) Both a) and b)
d) Scrambling and encryption are different names for the same process.

Answer: (c)

Solution:

As explained in the lectures

14) Consider the following diagram in the context of cdma2000. The output data rate R3 should
be 1.2288 Mcps. If the input rate is 4.8 kbps, the rate of the convolutional coder is?

a) 1
b) 2
c) 0.5
d) 0.25

Answer: (d)
 Solution:
R3 should be 1.2288 Mcps. R2 = R3/Q = 1.2288 Mcps/64 = 19.2 kbps. If R1 = 4.8 kbps, then a
rate ¼ convolutional coder should give us R2 = 19.2 kbps

15) Which of the following equations denote the mutual orthogonality principle in DS-SS?
∞
a) ∫ 𝑔 (𝑡)𝑔* (𝑡 − τ) 𝑑𝑡 = 0 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑣𝑎𝑙𝑢𝑒𝑠 𝑜𝑓 τ
𝑗 𝑘
−∞
∞ *
b)
∫ 𝑔 𝑘
(𝑡 − τ) 𝑑𝑡 = 0 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑗 ≠ 𝑘
(𝑡)𝑔
𝑗
−∞
∞ *
c)
∫ 𝑔 (𝑡 − τ) 𝑑𝑡 = 0 𝑓𝑜𝑟 𝑎𝑙𝑙 τ ≠ 0
𝑗
(𝑡)𝑔
𝑗
−∞
d) Both a) and b)

Answer: (d)

Solution:
Refer Lecture notes 43-44

16) Which of the four logical channels is used for channel estimation in cdma2000?
a) Pilot Channel
b) Sync channel
c) Paging channel
d) Traffic channel

Answer: (a)

Solution:
Refer notes for lecture 45

17) Which of the following carries system information and information regarding PN sequences
in cdma2000?
a) Pilot channel
b) Sync channel
c) Paging channel
d) Traffic channel

Answer: (b)
Solution:
Refer notes for lecture 45

18) Which of the following is a difference between WCDMA and cdma2000?

 a) WCDMA can support spreading sequences of variable lengths, but cdma2000 cannot.
b) WCDMA can support multiple chip rates, but cdma2000 supports only one chip rate.
c) Both a) and b)
d) Neither a) or b)

Answer: (c)

Solution:
Refer to lecture 44

19) For cdma2000, Base station codes are separated by 64n codes where n is an integer. Consider n=2
and assume that 215 length shortcodes are used. The maximum number of supported base stations
are?
a) 512
b) 64
c) 256
d) 215 mod 128

Answer: (c)

Solution:

Number of BSs = 215/128 = 256

20) Consider the following statements for an Orthogonal Variable Spreading Factor code.
Statement 1: If a code is assigned, its successor cannot be assigned
Statement 2: If a code is assigned, its predecessor can be assigned
a) Statements 1 and 2 are both true.
b) Statement 2 is true, but Statement 1 is false.
c) Statement 1 is true, but Statement 2 is false.
d) Statements 1 and 2 are both false.

Answer: (c)
Refer to lecture 45

21) Consider the following statements for an Orthogonal Variable Spreading Factor code.
Statement 1: OVSF(L, 2i) = [OVSF(L/2, i) OVSF(L/2, i)]
Statement 2: OVSF(L, 2i+1) = [OVSF(L/2, i) -OVSF(L/2, i)]
a) Statements 1 and 2 are both true.
b) Statement 2 is true, but Statement 1 is false.
c) Statement 1 is true, but Statement 2 is false.
d) Statements 1 and 2 are both false.
 Answer: (a)
Refer to lecture 45

22) Which of the following are primitive polynomials in GF(2)?

4
a) 1 + 𝑋
3 4
b) 1 + 𝑋 + 𝑋
2 4
c) 1 + 𝑋 + 𝑋
d) All of the above Answer:

(b)

Solution:
𝐺𝐹(2) = {0, 1}. An irreducible polynomial in GF(2) is primitive if the roots of the polynomial
don't belong to GF(2).

2
𝑓(𝑋) = 1 + 𝑋 . It can be written as
2 2 2 2
𝑓(𝑋) = (1 + 𝑋) = 1 + 𝑋 + 𝑋 + 𝑋 = 1 + 0 + 𝑋 = 1 + 𝑋 . Thus, it is a reducible polynomial.
Moreover, 𝑓(1) = 1 + 1 = 0. There does exist a root in GF(2). Thus this is not a primitive
polynomial.

2 4 2 2 2 2
𝑓(𝑋) = 1 + 𝑋 + 𝑋 = (1 + 𝑋 + 𝑋 ) = (1 + 𝑋 + 𝑋 )(1 + 𝑋 + 𝑋 )
2 2 3 2 3 4 2 4
= 1 + 𝑋 +𝑋 + 𝑋 +𝑋 +𝑋 +𝑋 +𝑋 +𝑋 = 1 +𝑋 +𝑋
2 4
Thus, 𝑓(𝑋) = 1+ 𝑋 + 𝑋 is a reducible polynomial. We see that 𝑓(𝑋)doesn’t have a root in
GF(2) as 𝑓(1) = 1and 𝑓(0) = 1.

3 4
𝑓(𝑋) = 1 + 𝑋 + 𝑋 is irreducible as it cannot be split up as a product of polynomials. Moreover,
this doesn’t have a root in GF(2). Therefore, it is a primitive polynomial.