Total No. of Questions : 8] SEAT No.

8
23
P-7591 [Total No. of Pages : 2

ic-
[6180]-106

tat
1s
T.E. (E & TC)

3:5
02 91
DIGITAL COMMUNICATION

9:4
0
(2019 Pattern) (Semester - I) (304181)

30
9/1 13
0
Time : 2½ Hours] [Max. Marks : 70
1/2
.23 GP

Instructions to the candidates:

1) Answer any one Question out of Q. No. 1 or 2, Q. No. 3 or 4, Q5 or Q6 and Q7
E
82

8
Or Q8.
C

23
ic-
2) Neat diagrams must be drawn wherever necessary.
16

tat
3) Figures to the right indicate full marks.
8.2

1s
4) Assume suitable data, if necessary.
.24

3:5
91
49

9:4
Q1) a) With the help of neat block diagram and waveforms describe QAM
30
30

system in detail. Draw signal space diagram for 16-QAM. [8]

01
02

b) Explain the performance of MSK with suitable block schematic and

1/2
GP

detail waveforms. [9]

9/1

OR
CE
82

8
23
Q2) a) Draw and explain block diagram of generation and reception of M-ary
.23

FSK with waveforms. [8]

ic-
16

tat
b) Compare M-ary PSK and M-ary QAM, [9]
8.2

1s
.24

3:5
91
49

9:4

Q3) a) With neat block schematic and waveforms explain DSSS generation
30

and detection. [9]

30
01
02

b) What is PN sequence? Explain properties of PN sequence with 3-stage

1/2

shift register. [8]

GP
9/1

OR
CE
82

Q4) a) Write a short note on : [8]

.23

i) CDMA ii) FHSS

16

b) With the help of neat schematic describe Ranging using DSSS in detail.
8.2

[9]
.24
49

P.T.O.
Q5) a) Define entropy. Show that the entropy is maximum when binary

8
message has 50% probability of occurrence. [9]

23
ic-
b) Prove that [9]

tat
H(X, Y) = H(X/Y) + H(Y) and H(X, Y) = H(Y/X) + H(X).

1s
OR

3:5
02 91
Q6) a) Compare Shannon-Fano and Huffman coding techniques. [5]

9:4
b) A source puts out one of the six messages during each message interval

0
30
9/1 13
with probabilities 1/2, 1/4, 1/8, 1/8, 1/16, 1/32 and 1/32. Find the
entropy of the system. Also find the rate of information if there are 16
0
1/2
outcomes per second. [4]
.23 GP

c) Apply Huffman coding for the following message ensembles

E

[X] = [x1 x2 x3 x4 x5 x6 x7] [P] = [0.45 0.15 0.1 0.1 0.08 0.08 0.04]
82

8
C

23
and find coding efficiency with M = 2. [9]

ic-
16

tat
8.2

Q7) a) Define and Explain following terms, [10]

1s
.24

i) Hamming distance
3:5
91
49

ii) Hamming weight

9:4
30

iii) Code rate

30
01

iv) Constraint length

02
1/2

v) Generator polynomial
GP
9/1

b) The generator matrix for (7, 4) linear block code is given below. Find
CE

all code vector. Calculate syndrome for C4 without error. [8]

82

8
23
.23

ic-
é1 0 0 0 : 1 1 0ù
ê ú
16

tat
ê0 1 0 0 : 0 1 1ú
8.2

G=ê ú
1s

ê0 0 1 0 : 1 0 1úú
.24

ê
3:5

ê0 0 0 1 : 1 1 1úû
91

ë
49

9:4
30
30

OR
01
02

Q8) Write a short note on (Any Three) : [18]

1/2
GP

a) Turbo Codes
9/1

b) Cyclic Codes
CE
82

c) Convolution Codes
.23

d) LPDC Codes
16
8.2


.24
49

[6180]-106 2