Digital Communication
Digital Communication
7
23
PD4294 [Total No. of Pages : 2
ic-
tat
[6403]-92
5s
T.E. (E & TC)
0:5
02 91
DIGITAL COMMUNICATION
9:3
(2019 Pattern) (Semester - V) (304181)
0
50
4/0 13
Time : 2½ Hours] [Max. Marks : 70
0
5/2
Instructions to the candidates:
.23 GP
1) Answers any one question out of Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
2) Neat diagrams must be drawn wherever necessary.
E
71
7
C
23
4) Assume suitable data, if necessary.
ic-
16
tat
8.2
5s
Q1) a) Explain the working of minimum shift keying (MSK), modulator and
.24
0:5
demodulator with the help of block diagram and waveform. [8]
91
49
9:3
b) What is Inter Symbol Interference (ISI)? Explain Causes of ISI. [9]
30
50
OR
01
02
7
23
.23
tat
b) The bit duration in DS SS BPSK communication system is 4 ms and
8.2
5s
0:5
Pe = 10–5 for detecting the message signal, calculate the processing gain
91
49
[9]
30
50
OR
01
02
5/2
i) Slow FHSS
CE
71
P.T.O.
49
Q5) a) What is Entropy and Mutual Information, and What are a properties of
7
23
Entropy and Mutual Information. [8]
ic-
b) A discrete source transmits messages x1 and x2 with probability ¾ and
tat
¼. The source connected to the binary symmetrical Channel with
5s
p(y1/x1) = 2/3. Calculate all entropies and mutual information. [9]
0:5
02 91
9:3
OR
0
50
Q6) a) 4/0 13
Compare Shannon-Fano and Huffman coding techniques [8]
0
b) Apply Huffman coding for the following message ensemble.
5/2
.23 GP
X = [x1 x2 x3 x4 x5 x6 x7]
E
71
7
P = [0.45 0.15 0.1 0.1 0.08 0.08 0.04] and find coding efficiency. [9]
C
23
ic-
16
Q7) a) For a systematic linear block code, (7,4) the parity matrix is given by
tat
[110;011;111;101] [9]
8.2
5s
.24
0:5
i) Construct Generator Matrix
91
49
9:3
ii) Find code vectors for messages 1100, 0011
30
50
i) Hamming distance
CE
71
7
ii) Hamming weight
23
.23
tat
8.2
0:5
v) Generator polynomial
91
49
9:3
OR
30
50
Q8) a) Draw the encoder and syndrome calculator for the generator polynomial
01
02
1 0 0 1 0 11 [9]
GP
4/0
b) Explain Properties of Linear Block code and Cyclic Code with example.[9]
CE
71
.23
16
8.2
… … …
.24
49
[6403]-92 2
Total No. of Questions : 8] SEAT No. :
8
23
PB3831 [6262]-93
[Total No. of Pages : 3
ic-
T.E.(E&TC )
tat
5s
DIGITAL COMMUNICATION
2:3
(2019 Pattern) (Semester -I) (304181)
02 91
9:3
Time : 2½ Hours] [Max. Marks :70
0
40
Instructions to the candidates:
6/0 13
1) Answer Q.1or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
0
2) Neat diagrams must be drawn wherever necessary.
5/2
.23 GP
8
C
23
ic-
Q1) a) What is OFDM? Draw and Explain block diagram of generation and
16
tat
8.2
5s
.24
2:3
b) Compare BPSK, QPSK and M-ary PSK [9]
91
49
9:3
30
OR
40
01
02
Q2) a) What is M-ary FSK? Draw and Explain Block diagram of generation
5/2
GP
8
b) Calculate bandwidth requirement and minimum separation of signal points
23
in signal space for [9]
.23
BPSK ic-
16
tat
QPSK
8.2
5s
16PSK
.24
2:3
Given that input bit rate is 8kbps and energy per bit duration is 1×10-4J.
91
49
9:3
30
40
OR
.24
[6262]-93 1 P.T.O.
49
Q4) a) Write a short note on following: [9]
8
i) Slow FHSS
23
ii) Fast FHSS
ic-
tat
b) What is PN sequence? Explain properties of PN sequence. [9]
5s
2:3
02 91
Q5) a) Explain difference type of discrete memoryless channel. [8]
9:3
b) Find coding efficiency of a source encoder generating messages with
0
40
probability 1/4,1/8,1/2,1/8 using Shannon-fano coding technique. [9]
6/0 13
0
5/2
OR
.23 GP
Q6) a) A 3 bit PCM system generates 1,000 samples per second, if the quantized
E
81
8
samples produced by the system have Probabilites
C
23
{1/4,1/4,1/8,1/8,1/16,1/16,1/16,1/16,}. Find the rate of information . If
ic-
16
the samples are equiprobable. What will be the rate of information? [8]
tat
8.2
5s
b) Apply Huffman coding for the following message ensemble. [9]
.24
2:3
91
X=[x1 x2 x3 x4 x5 x6 x7]
49
9:3
P=[0.45 0.15 0.1 0.1 0.08 0.08 0.04] and find coding efficiency
30
40
01
02
5/2
Q7) a) For a systematic linear block code, the three parity check digits, are
GP
given by [9]
6/0
CE
C4 d1 d 2 d3
81
8
23
C5 d1 d 2
.23
ic-
16
C6 d1 d 3
tat
8.2
5s
2:3
9:3
b) [9]
5/2
GP
6/0
CE
81
.23
16
8.2
OR
[6262]-93 2
49
Q8) a) Draw the encoder and syndrome calculator for the generator polynomial
8
23
g ( x) 1 x 2 x3 and obtain the syndrome for the received codeword
ic-
1001011 [9]
tat
5s
b) Explain properties of Linear block code and cyclic codes with suitable
2:3
example [9]
02 91
9:3
0
40
6/0 13
0
5/2
.23 GP
E
81
8
C
23
ic-
16
tat
8.2
5s
.24
2:3
91
49
9:3
30
40
01
02
5/2
GP
6/0
CE
81
8
23
.23
ic-
16
tat
8.2
5s
.24
2:3
91
49
9:3
30
40
01
02
5/2
GP
6/0
CE
81
.23
16
8.2
.24
[6262]-93 3
49
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
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
OR
CE
82
8
23
Q2) a) Draw and explain block diagram of generation and reception of M-ary
.23
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
OR
CE
82
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
[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
1s
.24
i) Hamming distance
3:5
91
49
v) Generator polynomial
GP
9/1
b) The generator matrix for (7, 4) linear block code is given below. Find
CE
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
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
Total No. of Questions : 8] SEAT No. :
8
23
P-312 [Total No. of Pages : 3
ic-
[6003]-392
tat
4s
T.E. (E & TC)
7:0
02 91
DIGITAL COMMUNICATION
0:2
0
(2019 Pattern) (Semester - I) (304181)
31
6/0 13
0
Time : 2½ Hours] [Max. Marks : 70
6/2
.23 GP
8
2) Neat diagrams must be drawn wherever necessary.
C
23
3) Figures to the right indicate full marks.
ic-
16
tat
4) Assume suitable data, if necessary.
8.2
4s
.24
7:0
91
Q1) a) What is Inter Symbol Interference? Explain the practical solution to
49
0:2
control ISI. Explain the concept of roll off factor along with its equation.
30
31
[8]
01
02
diagram. [6]
6/0
8
23
OR
.23
Q2) a) Sketch the waveforms of MSK for the given bit stream 11001001. [8] ic-
16
tat
8.2
receiver. [6]
.24
7:0
91
49
c) Draw signal space representation for 16-QAM i.e. 16-QASK and write
0:2
the equation for energy associated with signals in the first quadrant. [3]
30
31
01
02
6/2
P.T.O.
OR
8
23
Q4) a) Compare slow and fast frequency hopping. [8]
ic-
b) Explain in detail DSSS - BPSK transmitter and receiver along with
tat
waveforms. [10]
4s
7:0
02 91
Q5) a) Write a short note on : [9]
0:2
0
31
i) Source coding theorem
6/0 13
ii) Channel Coding theorem
0
6/2
.23 GP
8
with probabilities P(X1) = 0.4, P(X2) = 0.19, P(X3) = 0.16, P(X4) = 0.15,
C
23
P(X5) = 0.10. Construct the Shannon Fano code and calculate the
ic-
code efficiency and redundancy. [8]
16
tat
8.2
4s
OR
.24
7:0
Q6) a) Consider the five source symbols of discrete memory less source and
91
49
0:2
their probabilities as given in the table below. Follow the Huffman’s
30
algorithm to find the code words for each message. Also find the
31
entropy. [8]
6/2
GP
Message M1 M2 M3 M4 M5
6/0
CE
8
23
b) What is Mutual Information? Explain the properties of mutual
.23
tat
8.2
7:0
91
49
0:2
Q7) a) Generator matrix for (7, 4) linear block code is given below : [9]
30
31
1 0 0 0 1 1 0
01
02
0 1 0 0 0 1 1
6/2
GP
0 0 1 0 1 1 1
6/0
0 0 0 1 1 0 1
CE
80
Construct the syndrome table for single bit error patterns. Using
.23
syndromes, find error pattern and code word for each of the following
16
received vectors :
8.2
r1 = 0111101, r2 = 0001010.
.24
49
[6003]-392 2
b) Define and also write mathematical expression for the following terms,
8
[9]
23
ic-
i) Information rate
tat
ii) Mutual Information
4s
iii) Shannon Hartley theorem
7:0
02 91
0:2
0
31
Q8) a) Define and Explain following terms, [10]
6/0 13
i) Hamming distance
0
6/2
.23 GP
8
C
23
iv) Constraint length
ic-
v) Systematic & nonsystematic codes
16
tat
b) Write short note on : [8]
8.2
4s
.24
i) Turbo Codes
7:0
91
49
0:2
ii) LDPC Codes
30
31
01
02
6/2
GP
6/0
CE
80
8
23
.23
ic-
16
tat
8.2
4s
.24
7:0
91
49
0:2
30
31
01
02
6/2
GP
6/0
CE
80
.23
16
8.2
.24
49
[6003]-392 3
Total No. of Questions : 8] SEAT No. :
8
23
P757 [Total No. of Pages : 3
ic-
[5870]-1061
tat
T.E. (Electronics & Telecommunication)
8s
DIGITAL COMMUNICATION
9:5
02 91
(2019 Pattern) (Semester - I) (304181)
8:5
0
20
Time : 2½ Hours] 1/0 13 [Max. Marks : 70
0
Instructions to the candidates:
7/2
.23 GP
8
3) Assume suitable data, if necessary.
C
23
ic-
16
tat
8.2
8s
Q1) a) Explain how eye pattern can be used to study ISI. [4]
.24
9:5
91
49
8:5
b) Find the maximum value of error probability Pe for16-PSK, 16-FSK
30
(orthogonal) and 16-QAM if energy per bit duration is 5×10–5 J and double
20
Given :
1/0
8
23
.23
tat
erfc (7.0710678) = 1.5239709 ×10–23
8.2
8s
.24
9:5
c) Describe with the help of block diagram, MSK transmitter along with
91
49
OR
01
02
7/2
b) With the help neat block diagram explain OFDM transmitter and receiver
CE
81
system. [8]
.23
[5870]-1061 P.T.O.
49
1
Q3) a) A BPSK-DSSS system using coherent detection is used to transmit data
8
23
at 250bps & system has to work in a hostile jamming environment with
ic-
minimum error performance of one error in 20000 bits. Determine the
tat
minimum chipping rate if the jamming signal is 300 times stronger than
8s
the received signal. [9]
9:5
02 91
b) Write a short note on : [8]
8:5
0
20
i) PN sequence Generator
1/0 13
0
ii) Frequency hop Spread spectrum
7/2
.23 GP
OR
E
81
8
C
23
an average error probability of 10–5. Calculate jamming margin if
ic-
16
tat
8.2
8s
b) Explain DSSS based CDMA. [8]
.24
9:5
91
49
8:5
30
20
Q5) a) Given the messages X1, X2, X3, X4, X5 with respective probabilities of
01
02
0.4, 0.19, 0.16, 0.15 and 0.1. Construct codeword by minimum variance
7/2
GP
8
23
b) Calculate the capacity of an AWGN channel whose bandwidth is 1 MHz
.23
ic-
and S/N ratio of 40 dB. [4]
16
tat
8.2
9:5
OR
91
49
8:5
30
Q6) a) Compute Shannon Fano code for following message ensemble. [10]
20
01
02
Symbols X1 X2 X3 X4
7/2
GP
[5870]-1061
49
2
Q7) a) For a systematic (7, 4) LBC parity matrix is given as : [9]
8
23
ic-
1 1 0
tat
0 1 1
8s
P=
1 1 1
9:5
02 91
8:5
1 0 1
0
20
1/0 13
i) Construct a generator matrix.
0
7/2
.23 GP
8
iii) If the received code vector is R = [0 1 1 1 1 0 1], find the corrected
C
23
codeword
ic-
16
tat
b) Explain the generation of systematic and non systematic cyclic code.
8.2
8s
[8]
.24
9:5
91
49
OR
8:5
30
20
i) Code vector
GP
1/0
8
23
.23
tat
iv) Hamming weight
8.2
8s
.24
9:5
v) Systematic code
91
49
8:5
30
b) What are Turbo codes? Explain its bit error performance for uncoded
20
transmission. [8]
01
02
7/2
GP
1/0
CE
81
.23
16
8.2
.24
[5870]-1061
49