Digital Communication − November 2004

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory.

(2) Attempt any four questions out of remaining six questions.
(3) Assumptions made should be clearly stated.
(4) Assume any suitable data wherever required but justify the same.
(5) Figures to the right indicate full marks.
1. (a) Compare − [10]
i) Binary Phase Shift Keying and Binary Frequency Shift keying.
ii) Block codes and Convolutional codes.
(b) Give reasons : [10]
i) Correlative coding introduces controlled amount of ISI.
ii) Spread spectrum reduces effective power of the interference.
2. (a) Draw and explain the block diagram of OQPSK transmitter. A bit stream b(t) is to be transmitted using
OQPSK. If b(t) is 001011011010, sketch waveform at the output of each block of transmitter. [10]
(b) Derive expression to find distance for 16 QASK. Also, prove that it is greater than for 16 MPSK. Explain
how QASK signals area generated. [10]

3. (a) Derive relation to find probability of error for an optimum filter. Hence derive expression to find transfer
function for an optimum filter. [10]
(b) What is Intersymbol interference ? Show how transversal equalizer reduces it. [10]

4. (a) Parity check matrix for the (7, 3) code is given below : [10]
⎡0 1 1 1 0 0 0⎤
⎢1 0 1 0 1 0 0 ⎥
H = ⎢ ⎥
⎢1 1 0 0 0 1 0 ⎥
⎢ ⎥
⎣1 1 1 0 0 0 1 ⎦
Construct syndrome table for single bit error patterns. Using syndrome, find error pattern and code word
for each of the following received vectors
r1 = 0011101, r2 = 1101110, r3 = 0111011
If information vector is (011), determine its corresponding code word.
(b) Design a feedback shift register encoder for an (8, 5) cyclic code with a generator g(x) = 1 + x + x2 + x3.
Use this encoder to find code word for the message (10101) in systematic form.. [10]
5. (a) Generator vectors for a rate 1/3 convolutional encoder are
g (1) = 110, g (2) = 101, g (3) = 111
Draw block diagram of encoder, construct encoder matrix and determine code words if input vectors are
(111) and (1011). [10]
(b) i) An analog signal is bandlimited to BHz, sampled at Nyquist rate and quantized at 5 levels. Five
1 1 1 1 1
messages have probabilities , , , and . Calculate entropy and information rate.[10]
2 4 8 16 16
ii) Write in details about eye diagram.
1 0/000
6. (a) State diagram of a rate convolutional encoder is shown below : [10]
3
Draw trellis diagram to find code word if S0
input sequence is 101011. 0/111 1/111
0/111
S2 S1

1/001
0/001 1/000
S3

1/110
(b) Explain direct sequence spread spectrum transmitter and receiver. Explain it with input sequence (101) and
PN sequence (010100011010). [10]
7. (a) In relation to spread spectrum explain the terms : [10]
(i) slow frequency hopping (ii) fast frequency hopping
(b) Draw block diagram of a generator of Differential Phase−shift Keying. [10]
Also show how data is recovered from the DPSK signal.


− 12 −
 University Question Papers

Digital Communication − May 2005

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory.

(2) Attempt any four out of remaining six questions.
1. (a) Draw block diagrams of encoder and decoder of DEPSK. The bit stream d(t) is to be transmitted using
DEPSK. If d(t) is 001010011010, determine b(t) which is output of encoder, show that decoder recovers
d(t). Show that if the fourth bit in b(t) is in error, then fourth and fifth data bits of d(t) will also be in error.
[10]
(b) What is intersymbol interference ? Explain methods to reduce it. [10]
2. (a) Prove that distances for QPSK and for BPSK are same. [6]
(b) Draw block diagram of BFSK transmitter and receiver. The bit stream 001010011010 is to be transmitted
using BFSK. Sketch transmitted waveform. [10]
(c) Show that correlative coding introduces controlled amount of ISI. [4]
3. (a) Derive expression for the probability of error of the matched filter. Prove that an integrator is a matched
filter. [10]
(b) Draw and explain decision feedback equalizer. Show how it overcomes drawbacks of transversal
equalizer. [10]
4. (a) The generator matrix of a linear binary code is – [8]
⎡0 0 1 1 1 0 1 ⎤
G = ⎢⎢ 0 1 0 0 1 1 1 ⎥⎥
⎢⎣1 0 0 1 1 1 0 ⎥⎦
(i) Express G in systematic form.
(ii) Determine parity check matrix for the code.
(iii) Construct syndrome table.
(iv) Determine minimum distance of the code.
(b) Construct generator matrix and parity check matrix for a (7, 4) cyclic code with generator polynomial
g(x) = x3 + x +1. Draw its encoder using shift registers. Determine code word if message vector is (0110)
using (i) encoder and (ii) generator matrix. [12]
5. (a) Generator vectors for a rate 1/3 convolutional encoder are – [10]
g1 = (100), g2 = (101), g3 = (111)
(i) Draw encoder diagram
(ii) Draw trellis diagram
(iii) Using trellis find code vector if message vector is (101100)
(iv) Using trellis, find message vector if third bit of code vector in Q.5(iii) is in error.
(b) Find the average capacity in bits per second that would be required to transmit a TV signal at the rate of 32
pictures per second. Each picture is made up of 2 × 10 6 picture elements and 16 different brightness levels.
All picture elements are independent and all levels have equal probability of occurrence. [5]
(c) A given source alphabet consists of 300 words, of which 15 occur with probability 0.06 each and remaining
words occur with probability 0.00035 each. If 1000 words are transmitted each second, what is the average
rate of information transmission ? [5]
6. (a) Consider a systematic block code whose parity check questions are – [10]
P1 = m1 + m2 + m4
P2 = m1 + m3 + m4
P3 = m1 + m2 + m3
P4 = m2 + m3 + m4
where mi are message bits and Pi are check bits.
(i) Find generator matrix and parity check matrix for this code.
(ii) Find how many errors, the code can correct.
(iii)Is the vector 10101010 a code word ?
(iv) Is the vector 01011100 a code word ?
(b) Explain with waveforms, slow frequency hopping and fast frequency hoping. Compare their merits and
demerits [10]
7. (a) Draw and explain transmitter and receiver of 16 ary PSK. Derive expression for Band width and distance
for it. [10]
(b) Compare : [10]
(i) BPSK and QPSK
(ii) Systematic and non– systematic codes
(iii)Coherent and non– coherent codes detection.



− 13 −
Vidyalankar : B.E. − DC

Digital Communication − November 2005

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory.

(2) Attempt any four questions from Q.2 to Q.7.
(3) Draw neat sketches, wherever necessary.
(4) Assume suitable data wherever necessary and justify it.
(5) Figures to the right indicate full marks.

1. (a) Consider a binary symmetric channel for which the conditional probability of error is 10−4 and symbol “0”
and “1” occur with equal probability. Calculate the following probabilities.
(i) The probability of receiving symbol “0”. [2]
(ii) The probability of receiving symbol “1” [2]
(iii) The probability that symbol “0” was sent, when symbol “0” is received. [3]
(iv) The probability that symbol “1” was sent, when symbol “0” is received. [3]
(b) Prove that for the 16−ary QASK digital modulation technique, the Euclidean distance is given by− [6]
d = 2 0.4E b
where Eb is normalized Energy per bit. Also, draw signal constellation diagram for 16−ary QASK.
(c) Define the following :− [4]
(i) Sampling theorem for Bandpass signals
(ii) Sampling theorem in frequency domain.
2. (a) Derive the transfer function, H(f) for an optimum filter. When a optimum filter can be called as matched
filter? [10]
(b) A discrete memoryless channel has six symbols m1, m2, m3, m4, m5 and m6 with probabilities 0.3, 0.25, 0.2,
0.12, 0.08 and 0.05, respectively. Find the code words, average number of bits per message, code efficiency
and redundancy of the code in each of the following cases :
(i) Huffman coding [5]
(ii) Shannon−Fano coding [5]
3. (a) For a convolution encoder shown below, prepare the state transition table. Also, sketch the trellis diagram
and state diagram for the given convolution encoder. Determine the output sequence for the input data
sequence of 10110. [10]

Input m m1 m2
Data
X1
X2
+ Output
sequence
+
X3
(b) Explain with help of a neat block diagram, the transmitter and receiver of M−ary FSK. Also sketch the PSD
of M−ary FSK. What is the bandwidth requirement of M−ary FSK? [10]
4. (a) Compare systematic and non−systematic form of cyclic codes. Hence, find the generator matrix in
systematic and non−systematic form for the generator polynomial given by g(x) = x3 + x + 1. [10]
(b) Explain the principle and working of FHSS in details. Also, differentiate between slow frequency hopping
and fast frequency hopping. [10]
5. (a) State the properties of Hamming codes. An error control code has the following parity check matrix. [10]

⎡1 0 1 1 0 0 ⎤
H = ⎢⎢1 1 0 0 1 0 ⎥⎥
⎢⎣ 0 1 1 0 0 1 ⎥⎦
(i) Determine the generator matrix
(ii) Find the code word for message vector [1 0 1]
(iii) Decode the received codeword 110110. Comment on error detection and correction capability of this
code.
(b) Why MSK is called as shaped QPSK? For the input binary sequence [10]
{bk} = { 1, −1, 1, −1, −1, −1, 1, 1 },
find the transmitted phase sequence and sketch the transmitted waveform for QPSK.
6. (a) Prove that the error probability of BPSK digital modulation technique is given by− [10]
1 Eb
Pe = erfc
2 No
(b) The output of a sinusoidal generator is given by A cos wt. The output is sampled randomly. Let the
sampled output, be assigned a random variable ‘x’, which can take any value in the range of (−A, A).
Determine the mean and variance of the sampled output x. [10]

− 14 −
 University Question Papers

7. Write short notes on (any four):− [20]

(a) Intersymbol interference (d) Viterbi decoding
(b) Transfer function of convolution codes (e) Tapped Delay line Filter
(c) Signal to Noise ratio−Bandwidth tradeoff (f) Maximal length PN sequences.



Digital Communication − May 2006

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory and attempt any four questions from Q. 2 to Q. 7.

1. (a) Derive the transfer function H(f) for an optimum filter. Under which condition an optimum filter can be
called as a matched filter ? [10]
(b) Compare [10]
(i) BPSK and QPSK
(ii) Block codes and Convolution codes
2. (a) Draw and explain decision feedback equalizer. Show how it overcomes drawbacks of transversal
equalizer. [10]
(b) Draw block diagram of BFSK TX and RX. The bit stream 001010011010 is to be transmitted using BFSK.
Sketch transmitted waveform. [10]
3. (a) How duobinary signaling technique introduces controlled ISI in data stream ? [10]
(b) Define ‘amount of information’. Discuss the different properties of information. Also define Entropy ?
[10]
4. (a) For the binary bit stream 110110100010, draw the following waveforms [10]
(i) Unipolar NRZ (ii) Polar RZ (iii) Bipolar NRZ
(iv) Polar quaternary NRZ (Gray coding) (v) Many system (M = 8)
(b) Consider a (7, 4) code whose generator matrix is [10]
⎡1 1 1 1 0 0 0⎤
⎢1 0 1 0 1 0 0 ⎥⎥
G= ⎢
⎢0 1 1 0 0 1 0⎥
⎢ ⎥
⎣1 1 0 0 0 0 1⎦
(i) Find all the codewords of the code.
(ii) Find H, the parity − check matrix of the code.
(iii) Compute the syndrome for the received vector 1101101. Is this a valid code vector ?
(iv) What is the error correcting capability of the code ?
(v) What is the error detecting capability of the code ?
5. (a) Define the following : [10]
(i) Systematic and non-systematic code
(ii) Hamming weight (iii) Hamming distance
(iv) Rate of code (v) Properties of hamming code
(b) Encode the message 101 in systematic form using polynomial division and the generator
g(X) = 1 + X + X2 + X4. [10]
6. (a) In relation to spread spectrum explain the following terms : [10]
(i) slow frequency hopping (ii) fast frequency hopping.
(b) Draw block diagram of a generator of DPSK. Also show how data is recovered from DPSK signal. [10]
7. Write short note on any TWO. [20]
(a) Intersymbol interference and Interchannel interference
(b) Eye diagram
(c) Viterbi decoding.



Digital Communication − November 2006

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory.

(2) Attempt any four questions from the remaining six questions.
(3) Make suitable assumptions wherever necessary.

1. (a) Draw the block diagram of OPQSK transmitter and receiver and explain the functioning.
Also draw the signal space representation. [10]
(b) Draw the block diagrams of BPSK and DPSK and compare both. [10]

− 15 −
Vidyalankar : B.E. − DC

2. (a) Derive an expression from the probability of error of an integrate and dump receiver. [10]
(b) Explain M.ary FSk with the help of a neat block diagram of transmitter and receiver.
Also draw the PSD. [10]
3. (a) State and prove Sampling Theorem. [10]
(b) Explain slow frequency hopping and fast frequency hopping with the help of waveforms. Compare their
merits and demerits. [10]
4. (a) Define the following : [10]
(i) Hamming distance (ii) Hamming bound (iii) Code rate
(iv) Code efficiency (v) Systematic and non−systematic codes.
(b) An error control code has the following parity check matrix − [10]
⎡1 0 1 1 0 0 ⎤
H = ⎢⎢1 1 0 0 1 0 ⎥⎥
⎢⎣ 0 1 1 0 0 1 ⎥⎦
(i) Determine the generator matrix G.
(ii) Find the code word that begins with 101 …
(iii) Decode the received code word 110110. Comment on error detection and correction capability of this
code.
5. (a) Explain coder and decoder for cyclic codes. Also list the advantages and disadvantages of cyclic codes.[10]
(b) Determine the coded message for the following 8 bit data codes using the following CRC generating
polynomial P(x) = x4 + x3 + x0
(i) 11001100 (ii) 01011111.
6. (a) Draw the block diagram of MSK transmitter. Why MSK is called Shaped QPSK? [10]
(b) Explain the following in detail with respect to a Convolutional code : [10]
(i) Code tree (ii) Trelli’s diagram
(iii) State diagram (iv) Code rate Q constraint length.
7. Write short notes on any three : [20]
(a) ISI and ICI (b) Tamed FM
(c) Bit Synchronizer (d) Sample and Hold Circuit.



Digital Communication − May 2007

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory

(2) Attempt any four questions from Q.2 to Q.7.
1. Answer the following questions in brief : [20]
i) Baseband modulated signal is different than carrier modulated signal. Compare the two signals.
ii) Correlative coding is used for partial response signaling. Why ?
iii) Channel coding technique is different from source coding. How ?
iv) COMA transmission uses spread spectrum signal. Justify.
v) BPSK transmission is coherent transmission. Justify.
2. Explain the modulation scheme for the following carrier modulated signals : [20]
i) QPSK signal ii) MSK signal
iii) BFSK signal iv) Spread spectrum signal
3. Explain the following questions with proper illustration :
i) In DEPSK transmission, error always exist in pairs. [7]
ii) BFSK transmission can be orthogonal or non−orthogonal BFSK signal. [7]
iii) Phase continuity is maintained in MSK signal. [6]
4. Derive the following relationships :
i) PSD of QPSK signal. [7]
ii) Eucledian distance of non−orthogonal BFSK signal. [7]
iii) Nyquist rate for PCM signal. [6]
5. Consider the binary bit stream 110110100010, draw the following waveforms:
i) Baseband signal in NR2, Manchester and polar RZ format. [7]
ii) Carrier modulated signal in BPSK, QPSK and MSK signal format. [7]
iii) (7, 4) block coded BPSK signal. [6]
6. (a) Explain FHSS technique with the help of block diagram and signal frequency spectrum. [10]
(b) Define the following terms : [10]
i) Systematic and non−systematic code ii) Hamming weight and Hamming distance
iii) Entropy and redundancy iv) Code rate
7. Write short notes on any two : [20]
i) ISS and ICI ii) Eye diagram iii) Trellis diagram



− 16 −
 University Question Papers

Digital Communication − November 2007

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory.

(2) Attempt any four questions out of remaining six questions.
(3) Assume any suitable data wherever required but justify the same.

1. Attempt any four from the following : [20]

(a) Define Probability. Explain Conditional and Joint Probabilities.
(b) What is Intersymbol Interference ? Justify the correlative coding introduces controlled amount of ISI ?
(c) Explain the advantage of gray coding of the Input to 8−ary PSK system ? Also draw the phaser diagram of
8−ary PSK.
(d) Distinguish between Matched filter and corelator. How they are related to each other ?
(e) What is the necessity of spread spectrum modulation ? Differentiate between slow frequency hopping and
fast frequency hopping.

2. (a) Consider a binary input−output channels shown below : 0.7 [5]

X1 Y1

0.3

If the source symbols are equiprobable, find the receiver 0.4

probability distribution P[Y] and the Joint probability
distribution P[XY]. X2 Y2
0.6
(b) A discrete memoryless source has an alphabet of five symbol with there probabilities as shown :
Symbol S1 S2 S3 S4 S5
Probability 0.40 0.19 0.16 0.15 0.15
(i) Construct a Shannon−Fano code for the source and calculate code efficiency η and redundancy of the
code. [6]
(ii) Repeat the same for Huffman Code [6]
(iii) Compare the Huffman and Shannon−Fano Code. [4]

3. (a) For a systematic linear block code the three parity check digits C4, C5, C6 are given by [10]
C4 = d1 ⊕ d2 ⊕ d3
C5 = d1 ⊕ d2
C6 = d1 ⊕ d3
(i) Construct generator matrix (ii) Construct code generated by this matrix
(iii) Determine error correcting capability (iv) Prepare suitable decoding table
(v) Decode the received code word 101100 and 000110
(b) Explain the Viterbi algorithm of convolutional codes. [5]
(c) Compare linear Block codes, Cyclic codes and Convolutional codes. [5]

4. (a) State and explain the condition for orthogonally of the BFSK signal. Determine its spectrum and hence the
bandwidth requirement for transmission of signal. [10]
(b) Explain 4−ary PSK alongwith the following lines :
(i) Offset and Non−offset QPSK [2]
(ii) Modulation and demodulation block diagram of offset QPSK. [4]
(iii) Plot of power spectral density [2]
(iv) Signal space−representation and hence Eucledian distance. [2]

5. (a) Show that for an input signal which is an sequence of rectangular positive and negative pulses, the
integrator is the matched filter. [10]
(b) Explain the meaning of equalizer. How is equalization achieved ? With the help of neat block diagram.
Explain tapped−delay line equalizer. [10]

6. (a) What is duo−binary encoding ? Explain with neat block diagram. How the duo−binary encoding reduces
the Bandwidth requirement ? [10]
(b) Draw the block diagram of DS−SSS transmitter and receiver. Obtain the expression for the signal at the
output of each block and show that the original sequence can be recovered at the receiver output. [10]
7. Write short notes on any four : [20]
(a) Linear predictive vecoders (b) Line codes (c) P−N sequence generator
(d) Lempel−Ziv coding (e) Optimum filter



− 17 −
Vidyalankar : B.E. − DC

Digital Communication − May 2008

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory

(2) Attempt any four questions out of remaining six questions.
(3) Assume any suitable data wherever required but justify the same.

1. Attempt any four from the following: [20]

(a) Explain linearity and cyclic property of cyclic code.
(b) Determine the bandwidth required for M−ary PSK system. Draw the geometrical representation of M−ary
PSK and find out distance between signal point.
(c) Using duo−binary encoding, how is the bandwidth requirement reduced by half.
(d) What is matched filter? How it differs from optimum filter?
(e) Draw the model of spread spectrum digital communication system and explain correlation and Run
property of maximum length sequence.
2. (a) A (7, 4) cyclic code is generated using the polynomial x3 + x + 1. [10]
(i) What would be the generated codeward for the data sequence 1000 and 1100?
(ii) Draw the circuit diagram to generate this code and show how parity bits are generated for the data
sequence 1000.
(iii) Draw the circuit for syndrome calculator and obtain the syndrome for the received code word 1000100.
(iv) Draw the block diagram of cyclic code decoder.
(b) A convolutional encoder has single shift register with three modulo−2 adder and an output multiplexer. The
following generator sequences are combined by the multiplexer to produce the encoder output. [10]
g1 = 100; g2 = 111 and g3 = 101
(i) Draw block diagram of the encoder.
(ii) If input message sequence is 10110 determine the output sequence of the encoder.
(iii) Draw the codetree, state and trellier diagram for the same.

3. (a) The binary sequence 1011011110 is applied to the DPSK transmitter: [10]
(i) Draw the block diagram of DPSK transmitter and receiver and sketch the resulting waveform at the output.
(ii) Show that, in the absence of noise the original binary sequence is reconstructed at the receiver output.
Calculate the Bandwidth of DPSK signal.
(b) Differentiate between: [10]
(i) QASK and QPSK (ii) BPSK and BFSK
4. (a) Show that duobinary signalling suffers from error propogation while precoded duobinary signalling
doesnot. Explain with encoder and decoder block diagrams and decoding logic. [10]
(b) Derive the expression for error Probability of a matched filter and justify that Pe doesnot depend on the
shape of the input waveform. [10]

5. (a) What is Intersymbol Interference? Show how transversal equalizer reduces ISI. [10]
(b) Derive the expression for a signal to noise ratio of an integrater and dump circuit and hence explain how
the signal is emphasized relative to noise. What is the ideal sampling time? [10]

6. (a) What are Pseudo−noise sequences in spread spectrum technology? Why they are used in spread spectrum
modulation? Explain the method to generate a Pseudo−noise sequence. [10]
(b) Explain the basic principle of frequency Hop spread spectrum. Explain with waveforms slow frequency
hopping and fast frequency hopping. [10]

7. Write short notes on any four: [20]

(i) Huffman coding (ii) QASK (Quadarature Amplitude Shift Keying)
(iii) Viterbi decoding (iv) Direct sequence spread spectrum
(v) ISI and Eye Pattern.



Digital Communication − November 2008

Time : 3 Hrs.] [Marks : 100

N.B.: (1) Question No. 1 is compulsory.

(2) Attempt any four questions out of remaining six questions.
(3) Figures to the right indicate full marks.
(4) Assume suitable data wherever necessary.

1. (a) Define probability. Explain CDF and PDF. [20]

(b) Explain the Viterbi algorithm of convolution codes.
(c) Explain the functioning of a bit synchronizer.
(d) Distinguish between Matched Filter and Corelator.

− 18 −
 University Question Papers

2. (a) MSK is called ‘Shaped QPSK’. Justify with relevant expression or waveforms. Discuss the merits and
demerits of MSK as compared to QPSK. [10]
(b) Prove that the error probability of BPSK digital modulation technique is given by
1 Eb
Pe = erfc [10]
2 No

3. (a) State and prove Sampling Theorem. [5]

(b) Draw and explain decision feedback equalizer. Show how it overcomes drawbacks of traversal equalizer. [10]
(c) Show that duo−binary signalling suffers from error propagation while precoded duo−binary signaling does not. [5]

4. (a) Explain the following in detail with respect to a convolutional code : [10]
(i) Code tree (ii) Trelli’s diagram
(ii) State diagram (iv) Code rate
(b) A message 101101 is to be transmitted in cyclic code with a generator polynomial G(D) = D4 + D3 + 1.
Obtain the transmitted code word. How many check bits does the encoded message contain ? Draw the
encoding arrangement for the same. [10]

5. (a) Explain slow frequency hopping with the help of waveforms. Compare their merits and demerits. [10]
(b) State the properties of Hamming codes. [10]
The Generator matrix for a (6, 3) block code is given below.
Find all the code vectors of this code −
⎡1 0 0 0 1 1 ⎤
G = ⎢⎢ 0 1 0 1 0 1 ⎥⎥
⎢⎣ 0 0 1 1 1 0 ⎥⎦

6. (a) Draw the transmitter and receiver block diagrams of BFSK and explain the working. [10]
(b) Compare : [10]
(i) BPSK and QPSK
(ii) Systematic and non−systematic codes.

7. Write short notes on any four : [20]

(a) ISI and ICI (b) Bit synchronizer
(c) Signal to noise ratio−Bandwidth trade off (d) Viterbi decoding
(e) Huffman coding



Digital Communication − May 2009

Time : 3 Hrs.] [Marks : 100

N.B. : (1) Question No. 1 is compulsory.

(2) Attempt any four questions out of remaining six questions.
(3) Assume suitable data wherever necessary and justify it.

1. Attempt any four from the following : [20]

(a) Explain need for equalization in digital communication system.
(b) Tamed FM
(c) The error function
(d) ISI and ICI.

2. (a) Explain the central limit theorem for random variables. [10]
(b) Explain in brief : (i) Stationary and Non-stationary process.
(ii) Wide sence stationary process.
(iii) Ergodic process.

3. Explain in detail 16-QAM Transmitter and receiver system. Also draw signal constellation diagram for [20]
16 QAM in detail.

4. (a) Distinguish between ‘Matched Filter’ and ‘Correlator’. How are they related to each other. [10]
(b) Explain the principle and working of FHSS in detail. Differentiate between frequency hopping and [10]
fast frequency hopping.

5. (a) Explain the concept of “partial response signaling”. What is the advantage of this types of signaling? [10]
(b) Draw the block diagram of a duobinary partial response signaling system and explain its working. [10]

6. The generator polynomial for a (7, 4) cyclic code is g(x) = 1 + x + x3. [20]
(a) Draw the block diagrams of an encoder and syndromes calculator for this code.
(b) Find the code polynomial for message vector (0 1 0 1).
(c) Assume that the first bit of the code vector for the message vector in (b) suffers transmission error.
Find syndrome at the receiver.

− 19 −
Vidyalankar : B.E. − DC

7. (a) For the convolutional encoder shown below sketch the code tree. [10]
Data In S1 S2 S3

+ +

C1 C2
(b) Write short notes on : [10]
(i) Viterbi’s algorithm
(ii) Compare coded and uncoded system



− 20 −