0% found this document useful (0 votes)
15 views5 pages

Communications Test 5: Number of Questions: 25 Time: 60 Min. 6

The document is a communications test consisting of 25 multiple-choice questions covering various topics in digital and analog communication systems. Each question presents a scenario or concept, followed by four answer options. Additionally, the document includes answer keys and hints for solving the questions.

Uploaded by

ravi.alwar200
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
0% found this document useful (0 votes)
15 views5 pages

Communications Test 5: Number of Questions: 25 Time: 60 Min. 6

The document is a communications test consisting of 25 multiple-choice questions covering various topics in digital and analog communication systems. Each question presents a scenario or concept, followed by four answer options. Additionally, the document includes answer keys and hints for solving the questions.

Uploaded by

ravi.alwar200
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/ 5

Communications Test 5

Number of Questions: 25 Time: 60 min.

Directions for questions 1 to 25: Select the correct alterna- 6. Optimum filter is matched filter when
tive from the given choices. (A) Input noise is white
1. An analog voltage in the 0 to 16V is divided in 32 equal (B) Impulse response of the filter is real
intervals for conversion to 4-bit digital output. The (C) Impulse response of the filter is imaginary
maximum quantization error (in V) is (D) None of these
(A) 0.75 (B) 0.5 7. The technique that is applicable to digital signals only
(C) 0.25 (D) 0.2 is
2. For the binary sequence 01100101. The AMI Rz signal- (A) FDMA (B) TDMA
ing format is (C) CDMA (D) SDMA
Tb 8. When the entire frequency band is filled, then the tech-
1 1 nique use is _____
(A) TDMA (B) CDMA
(A) 0 0 0 0
t (C) SDMA (D) None
1 9. Frequency re-use is associated with
1 (A) FDMA (B) TDMA
Tb (C) CDMA (D) SDMA
v
10. Precise time synchronization is important in
(A) FDMA (B) TDMA
(B) t (C) CDMA (D) B and C
11. A binary symmetric channel (BSC) has a transition
Tb 1
probability of of the binary transmit symbol X is
10
4
(C) t such that P(X = 0) = 5 . Then the probability of error

for an optimum receiver will be


(D) None of these 1 1
(A) (B)
3. For an independent input and output, The mutual infor- 10 8
mation is equal to 1 4
(C) (D) 5
(A) sum of entropies of transmitter and receiver 5
(B) self information of transmitter and receiver
12. A source generates four symbols with probabilities,
(C) sum of receiver entropy and noise entropy
0.125, 0.125, 0.25, 0.5 assuming independent gen-
(D) zero
eration of symbols, the most efficient source encoder
4. Binary data is transmitted using PSK signaling scheme would have average bit rate is
with S1(t) = A Cos ωct, S2(t) = –A Cos ωct 0 ≤ t ≤ Tb (A) 5000 bits/sec (B) 6000 bits/sec
where Tb (bit duration) is equal to 0.2 ms. The carrier (C) 7000 bits/sec (D) 8000 bits/sec
frequency fc = 5 fb. The carrier amplitude at the receiver
13. An AWGN communication channel having signal to
input is 2 mv and the PSD of AWGN at the input is 10-11
noise ratio SNR >> 2 and bandwidth B has capacity C1
W/Hz.
of the SNR is becomes the 4 times keeping B constant,
The probability of error of the optimum filter is ______
1 1 the resulting capacity C2 is given by-
(A) e rfc 2 (B) e rfc 20 (A) C2 ≈ 3C1 (B) C2 ≈ C1 + 0.3B
2 2 (C) C2 = C1 + B (D) C2 = C1 + 2B
(C) εrfc 20 (D) εrfc 10 14. A fair coin is tossed repeatedly until a ‘tail’ appears for
5. Probability of error in DPSK is the first time. Let L be the number of tosses to get this
1 Eb Eb first ‘tail’. The entropy H(L) in bits is _________
(A) εrfc (B) εrfc (A) 1 (B) 2
2 h h
(C) 4 (D) 6
Eb Eb
1 − 2h 1 −h 15. A source produces 3 symbols with probability 0.25, 0.25
(C) e (D) e
2 2 and 0.5. For this source a practical coding scheme has
Communications Test 5 | 3.229

an average code word length of 4 bits/symbols. The effi- Where a = 2 mv


ciency of code is ______
In AWGN channel with PSD
o N
= 0.4 × 10–12 W/Hz.
(A) 3/2 (B) 3/4 2
(C) 5/8 (D) 3/8
Using an optimal receiver and relation and relation
16. The signal power received for a desired signal of 100 kb/s 42
1 −
bit rate signal is 10 mW. The chip frequency used is 100
MHz. the processing gain is, if received power is 1W.
Q(v) =
2p u
∫ e 2 du. The bit error probability for a

(A) 10 (B) 100 data rate of 4000 kpbs is


(C) 1000 (D) 10000 (A) Q(2) (B) Q(1)
17. An analog signal is bandlimited to B Hz, sampled at the  1   2 
(C) Q  (D) Q 
Nyquist rate and the samples are quantized into 4 levels.  2   2 
The quantization levels Q1, Q2, Q3 and Q4 are assumed
1
independent and occur with probabilities P1 = P4 = 4 and 22. In Q ( a ) is the BER of a BFSK system over an
AWGN channel with two sided noise power spectral
3
P2 = P3 = 4 . The information rate of the source is ______ density No/2. The parameter a is function of bit energy
and noise power spectral density.
(A) 2 bits/message (B) 1.8 bits/message
(C) 1.71 bits/message (D) 1.31 bits/message AWGN
Channel-1
18. Given an AWGN channel with 8 kHz bandwidth and
0/1 + 0/1
the noise power spectral density n/2 = 10–12 W/Hz. The BFSK + BFSK
signal power is required at the receiver is 0.1 mW. the modulator demodulator

capacity of the channel is AWGN
(A) 54.44 b/s (B) 108.88 b/s Channel-2
(C) 50 b/s (D) 40 b/s
Then the BER rate of this system is
19. A pulse wave form is given as
e −2t , 0 ≤ + ≤ T (A) zero (B) Q 2 a ( )
S(t) = 
 0, otherwise (C) Q 2a (D) None of these
The matched filter output over (O, T) is ________ 23. The mutual information for the channel shown in figure
e −2t is
(A) sin h (2t ) (B) e-2t sin h(4t)
2 x1 0.25
e −2T
(C) cos (2t ) (D) None 0.25 y1
2 0.2
20. If a signal S(t) = e–2tu(t) is applied to the input of a low x2 0.2
2b
pass filter having H (w ) = 0.05
y2
w + 4b 2
2

x3 0.05
Then the value of b is 50%, if the input energy is trans-
formed to the output. (A) 1.36 bits/message (B) 1 bits/message
1 (C) zero (D) None
(A) 1 – 2 2 (B) 1 −
2 24. If probability p is 0.4 then the channel capacity for the
1 BSC (Binary Symmetric Channel) is
(C) 1 + (D) B and C (A) 0.029 bits/message (B) 3.97 bits/message
2
(C) 0.28 bits/message (D) 3.72 bits/message
21. Coherent QPSK modulation is used to transmit 4 equi-
25. An M-level FSK modulation scheme is used to trans-
probable symbol waveforms
mit independent binary digits over a band-pass channel
S1(t) = a Cos 2πft
with bandwidth 200 kHz. The bit rate is 300 kbps and
 p the system characteristic is a raised cosine spectrum
S2(t) = aCos  2p ft + 
 2 with 100% excess bandwidth. The minimum value of
S3(t) = a Cos(2πft +π) M is _____.
3p  (A) 3 (B) 8

S4(t) = aCos  2p ft +  (C) 16 (D) 4
 2
3.230 | Communications Test 5

Answer Keys
1. C 2. B 3. D 4. B 5. D 6. A 7. C 8. C 9. D 10. B
11. A 12. C 13. D 14. B 15. D 16. C 17. C 18. B 19. A 20. D
21. B 22. C 23. C 24. A 25. B

Hints and Explanations


Solutions for questions 1 to 25: 8. When entire frequency band is filled with TDMA,
∆ CDMA and FDMA and additional capacity is to be
1. The maximum quantization error is Qe = achieved then SDMA (Space Division Multiple Access)
2
Dynamic range is used with FDMA, TDMA or CDMA. Choice (C)
Where ∆ = 9. Choice (D)
2n or L
16 16 10. FDMA: Each earth station is assigned a specific uplink
∆ = 5 = = 0.5 and downlink carrier frequency. So no need of timing
2 32
synchronization.
0.5 TDMA: In this method uplink station is assigned a
∴ Qe = = 0.25  Choice (C)
2 non-overlapping time slot. So timing synchronization
2. Since R2 format so pulse will return to zero axis in is needed.
between the bit time period so CDMA: In CDMA, entire bandwidth is used by all the
Tb time by every user. So no need of timing synchroniza-
tion. Choice (B)
4
11. P[X = 0] = 5

1
 Choice (B) P[X = 1] = 1 – P[X = 0] =
5
3. For an independent input and output the mutual infor-
1
mation is zero. Choice (D) Transition probability = P(1/0) = P(0/1) =
10
No
4. = 10–11 W/Hz So probability of error for optimum receiver will be
2
____________
No = 2 × 10–11 W/Hz Pe = P(0) P(1/0) + P(1).P(0/1)
A2 4 1 1 1 4 1
Eb = × Tb = × + × = +
2 5 10 5 10 50 50
2 × 10 −3 × 2 × 10 −3 5 1
= × 0.2 × 10 −3 = 0.4 × 10-9 = =  Choice (A)
2 50 10
1 Eb
Pe = εrfc 12. Bit rate = H.Rb
2 No 1 1
H = 0.125log 2 + 0.125log 2 +
1 0.4 × 10 −9 0.125 0.125
= εrfc 1 1
2 2 × 10 −11 0.25log 2 + 0.5log 2
0.25 0.5
1 4 = 0.125 log2 23 + 0.12 log2 23 + 0.25 log2 24 + 0.5 log2 2
= εrfc × 10
2 2 = 0.375 + 0.375 + 0.5 + 0.5 = 1.750
1 Bit rate = 1.75 × 4000 = 7000 bits/sec Choice (C)
= εrfc 20  Choice (B) 13. As we know that
2
 S
5. Choice (D) C1 = B log 2 1 + 
 N
6. Choice (A)
S
7. FDMA is applicable for analog signals. ∵ 2
TDMA is applicable for analog and digital signals. N
CDMA is applicable for digital signals only. S
 Choice (C) So C1 = B log 2  
N
Communications Test 5 | 3.231

 4S  17. The average information H is


and C2 = B log 2   1 1 1 1
N H = P1 log2 P + P2 log2 P + P3 log2 + P4 log2 P
1 2 P3 4
S
= B log 2   + 2B log2 2 = C1 + 2B Choice (D) 1 3 4 3 4 1
N = log 2 4 + log 2 + log 2 + log 2 4
4 4 3 4 3 4
14. If P = 1, i.e., if 1 toss is required to get first tail, then
2 2 3 3 3 3
1 = + + × 2 + × 2 − × 1.54 − × 1.54
probability to get first tail is P1 = 4 4 4 4 4 4
2
1 1 3 3
If P = 2, i.e., two tosses are required to get first tail. = + + + − 1.15 − 1.15
2 2 2 2
1 1 1
The probability to get the first tail is P2 = × = = 1.7 bits/message Choice (C)
2 2 4
18. B = 8 kHz
If P = 3, i.e., if 3 tosses are required to get first tail.
S = 0.1 × 10–3 W
1 1 1 1
P3 = × × = N = ηB = 2 (10–12) 8000
2 2 2 8 N = 8(10–9)
S 0.1(10 )
H −3
1
Entropy H = ∑ P;log = P = = 1.25(104)
i =1 i N 8 (10 −9 )
1 1 1 1 1 1 1 1
= log 2 + log 2 + log 2 + log 2 ....  S
2 12 4 14 8 1 8 16 1 16 C = B log2 1 + 
 N
1 1 1 1 = 8000 log2[1 + 1.25(104)] = 108.88 b/s Choice (B)
= × 1 + × 2 + × 3 + × 4...
2 4 8 16
19. For the given S(t), the impulse response of the matched
1 2 3 4 filter is
= + 2 + 3 + 4 .....
2 2 2 2 h(t) = S(T – t); h(t) = e-2(T – t)
It is the A.G.P and of the A.G.P is like this Now output Z(t) = S(t) × h(t)
+∞ −2t (Tan) −2(T − t + t (Tan) )
ab + (a + d) br + (a + 2d)br2…. or Z(t) = ∫ e .e dz
−∞
a.b dbr
Then sum = + +∞ −4 t (Tan) 2t
1 − r (1 − r )2 = e–2T ∫ e .e dz
−∞
here a = 1 d=1 −2T t
−2T +∞ 2t − 4 t (Tan) e e 2t − 4 t (Tan) 
1 =e ∫ e dz =
b= r=½ −∞ −4   0
2
−2T −2T  e 2t − e −2t 
1 1 1 −e e
1. 1. . = e −2t − e +2t  =  
H= 2 + 2 22 =1+ 1= 2  Choice (B)
4 2  2 
 1   1 −2T −2T
1 −  1 −  e e
2  2 = Sinh(2(t)) = Sinh(2t) Choice (A)
2 2
n
20. Input signal S(t) = e-2t u(t)
15. Entropy H = − ∑ Pi log 2 ( Pi )
i =1 1
Input PSD; Sxx(ω) = 2
w +4
1  1 1  1 1  1 
H = −  log 2   + log 2   + log 2   
 2  2  4  4  4  4  1 1
+∞
 1 +∞
Given  ∫ xx
S ( w ) d w = ∫ S yy (w ) d w
1 1 1  3 2  2p −∞  2p −∞
=+ =+
 2 + 4 × 2 + 4 × 2 2 Output PSD Syy(ω) = Sxx(ω) × |H(ω)|2
H 32 3 4b 2 1
Code efficiency η = × 100% = =  Choice (D) Syy(ω) = × 2
L 4 8 w + 4b w + 4
2 2

16. chip frequency fc = 108 Hz +∞


1  1  4b 2 1
+∞

Signal frequency fb = 105 Hz ⇒ ∫  2


2 −∞ w + 4
 d w = ∫ 2
−∞
w + 4 b 2
× 2
w +4
dw
f e 108
Processing gain G = = = 1000 1 1  −1 w  4b 2 1
+∞
1
+∞
f b 105 ×  tan
2 2  = ∫ − 2
2  −∞ 4b − 2 −∞ w + 4 w + 4b 2
2 2
dw
 Choice (C)
3.232 | Communications Test 5

23. The joint probability matrix for the channel is


4b 2   1 −1  w   
+∞ +∞
1  1 −1  w   
= (p ) = 2   tan    −  tan       y1 y2 
4 4b − 2   2  2   −∞  2b  2b     x1 
−∞ 
0.25 0.25
P[X, Y] = x2  
p 4b 2  1 1   0.2 0.2 
⇒ = 2  p − p x3  
4 4b − 2  2 2b  0.05 0.05
p 4b 2 1 1  P(x1) = 0.25 + 0.25 = 0.5
⇒ = 2 p −
4 4b − 2  2 2b  P(x2) = 0.2 + 0.2 = 0.4
P(x3) = 0.05 + 0.05 = 0.1
4b 2  b − 1  4b
1=
2b 2 − 1  b 
;1=
2b 2 − 1
(b −1) P(y1) = P(y2) = 0.25 + 0.2 + 0.05 = 0.5

( x ) log p ( x )
3
So H(x) = − ∑ p j j
2b2 – 1 = 4b2 – 4b j =1

2b2 – 4b + 1 = 0 = –[0.5 log20.5 + 0.4log20.4 + 0.1 log2 0.1]


1 = 0.5 + 0.528 + 0.332
b = 1±  Choice (D) = 1.36 bits/message
2
( y ) log p ( y )
2

1 E  H(Y) = − ∑ p
21. Pe = εrfc  b  for QPSK k =1
k k
2  No  = –[0.5 log2 0.5 + 0.5 log2 0.5]
Rb = 4000 × 103 bps = 1 bit/messge
3 2
No
0.5 × 10–12 W/Hz H(X, Y) = ∑ ∑ – p(xj, yk)log p(xj, yk)
2 j =1 k =1

a = 2 × 10–3 V = –[0.25 log2 0.25 + 0.25 log2 0.25 + 0.2 log2 0.2 + 0.2
1 log2 0.2 + 0.05 log 0.05 + 0.05 log2 0.05]
Tb = = 0.25 × 10-6
Rb = 0.5 + 0.5 + 0.464 + 0.464 + 0.216 + 0.216
= 2.36 bits/message
a2 So mutual information
Bit energy Eb = .Tb
2 I(X; Y) = H(X) + H(Y) – H(X, Y)
2 × 2 × 10 −6 = 1.36 + 1 – 2.36 = 0 Choice (C)
= × 0.25 × 10 −6 = 0.5 × 10–12
2 24. A BSC can be shown as
 0.5 × 10 −12  P (0.4)
1 x1 (0) y1
So Pe = εrfc  
2 1.0 × 10 −12 
  1-p(0.6)

1  1
= εrfc  
2  2 0.6
1  1  x2 (1) y2
= εrfc   0.4
2  2
Channel capacity C = logn – A
 1 X 
Pe = Q(1) ∵ e rfc  = Q ( X ) = 2 – H(Y/xj) (n = 2)
 2  2  = 2 – [(plogp + (1 – p)log(1 – p))]
 Choice (B) = 2 + p log p + (1 – p)log (1 – p)]
= 2 + 0.4 log 0.4 + 0.6 log 0.6
22. Let the output of channel 1 is V Cos ωt and the output
= 0.029 bit/message Choice (A)
of channel 2 is –V Cos ωt
V2 Rb
Energy of channel 1 is .T = Eb 25. B =
log 2 M
(1 + a)
2 b
V2 300 × 2
Energy of channel 2 is T = Eb 200 =
2 b log 2 M
So energies are additive 2E 300 × 2
BER at output of demodulator is Q ( 2a ) log2 M =
200
=3

 Choice (C) M = 8 Choice (B)

You might also like