Mumbai University Previous year question papers Digital Communication Dec 2008
Mumbai University Previous year question papers
VI Sem Electronics Examination Dec 2008
N.B. : (1) Question NO.1is compulsory.
(2) Attemptany 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.
(b) Explain the Viterbi algorithm of convolutional codes.
(c) Explain the functioning of a bit synchronizer.
(d) Distinguish between Matphed Filter and Corelator.
2. (a) MSKis called ‘Shaped QPSK’. Justify withrelevant expression or waveforms. Discuss the merits and demerits of MSK as compared to QPSK.
(b) Prove that the error probability of BPSK digital modulation technique is
given by e = –2 e c –No
3.(a) State and prove Sampling Theorem. 5
(b) Draw and explain decision feedback equalizer. Show how it overcomes drawbacks of transversal equalizer.
(c) Show thatduo-binarysignallingsuffersfromerrorpropagationwhileprecoded duo-binary signalling doesnot.
4. (a) Explain the following in detail with respect to a convolutional code :-
(i) Code tree (ii) Trelli’s diagram
(iii) 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.
5. (a) Explain slow frequency hopping and fast frequency hopping with the help of waveforms. Compare their merits and demerits.
(b) State the properties of Hamming codes. 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
6. (a) Draw the transmitter and receiver block diagrams of BFSK and explain the working.
(i) BPSK and QPSK
(ii) Systematic and non-systematic codes.
7. Write short notes on any four :-
(a) ISI and ICI
(b) Bit synchronizer
(c) Signal to noise ratio-Bandwidth trade off
(d) Viterbi decoding
(e) Huffman coding.