0% found this document useful (0 votes)
114 views2 pages

161001

This document appears to be an exam for a digital communications course, consisting of 5 questions covering various topics: Q1 asks about digital communication systems, error detection/correction, and properties of periodic waveforms. Q2 derives the channel capacity equation for a binary symmetric channel and asks about systematic linear block codes. Q3 covers Tchebycheff's inequality, cyclic code decoding, and error correcting conditions. Q4 asks about QPSK demodulation, Nyquist sampling, the central limit theorem, and BPSK modulation. Q5 compares PCM and delta modulation, ASK and FSK, and provides short notes on convolutional coding and optimal binary receivers. It also asks about companding

Uploaded by

mehul03ec
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)
114 views2 pages

161001

This document appears to be an exam for a digital communications course, consisting of 5 questions covering various topics: Q1 asks about digital communication systems, error detection/correction, and properties of periodic waveforms. Q2 derives the channel capacity equation for a binary symmetric channel and asks about systematic linear block codes. Q3 covers Tchebycheff's inequality, cyclic code decoding, and error correcting conditions. Q4 asks about QPSK demodulation, Nyquist sampling, the central limit theorem, and BPSK modulation. Q5 compares PCM and delta modulation, ASK and FSK, and provides short notes on convolutional coding and optimal binary receivers. It also asks about companding

Uploaded by

mehul03ec
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/ 2

Seat No.

: ________

Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY


BE - SEMESTERVI EXAMINATION WINTER 2013

Subject Code: 161001 Subject Name: Digital Communication Time: 02:30 pm to 05:00 pm
Instructions: 1. Attempt all questions. 2. Make suitable assumptions wherever necessary. 3. Figures to the right indicate full marks.

Date: 27-11-2013 Total Marks: 70

Q.1.

Q.2

Q.3

Q.3

Answer the Following (a) Draw the block diagram of digital communication system and explain the three major signal processing tasks. (b) How would you detect and correct burst errors in digital communication? ( c) The power spectral density and the correlation function of a periodic waveform are a Fourier transform pair Justify. (d) Briefly describe the concept of probability with suitable example. (a) Derive the equation for channel capacity of BSC channel. (b) For a (6,3) systematic LBC the three parity check digits c4, c5 and c6 are C4=d1+d3 C5=d1+d2+d3 C6=d1+d2 1. Construct the code generated by this matrix 2. Prepare a suitable decoding table 3. Decode 100101 and 101010. OR (b) A binary channel matrix is given by y1 y2 x1 2/3 1/3 x1,x2=input y1,y2=output x2 1/3 2/3 Px(x1)=1/2 and Px(x2)=1/2. Determine H(X), H(Y), H(X/Y), H(Y/X) and I (X;Y). (a) Describe the Tchebycheffs inequality. (b) Discuss decoding of cyclic codes with suitable example. (c ) Hamming bound is a necessary but not sufficient condition for higher error correcting codes whereas is a necessary and sufficient condition for single error correcting codes. Justify. OR (a) Derive the formula for signal to quantization noise ratio for PCM. (b) Discuss briefly power spectral density of NRZ and bi-phase code. ( c) A source emits one of four messages randomly every 1 microsecond. The
probabilities of these messages are 0.5, 0.3,0.1 and 0.1. Messages are independently generated (i) What is the source entropy?(ii) Obtain a compact binary code and determine the average length of the codeword, the efficiency and the redundancy of this code.(P.T.O.)

14 04 04 03 03 07 07

07

05 05 04

05 05 04

Q.4

Q.4

(a) Explain briefly QPSK Demodulation with neat sketch . Explain briefly the Nyquist sampling theorem. (b) State the central limit theorem. ( c) OR (a) Explain briefly BPSK modulation with neat sketch.

05 05 04 05
1

(b) ( c) (a) (b) (a) (b)

Q.5

Q.5

Compare PCM and Delta Modulation in terms of their figure of merits. Compare ASK and FSK in terms of their figure of merits. Write short note on Convolutional coding. Write shortnote on Optimum binary receiver. OR What is companding process in PCM? State laws for the same. . Describe the effect of slope overloading and hunting in delta modulation.
*************

05 04 07 07 07 07

You might also like