Scribd
Upload
11 views3 pages

Important Questions

The document outlines a comprehensive curriculum on Digital Communication Systems, divided into six units covering topics such as block diagrams, coding theorems, error correction codes, convolution codes, and synchronization techniques. It includes theoretical concepts, practical applications, and exercises for encoding and decoding using various methods like Huffman coding and Viterbi algorithm. Additionally, it addresses performance evaluation through metrics like probability of error and eye patterns.

Uploaded by

Dharun
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
11 views3 pages

Important Questions

The document outlines a comprehensive curriculum on Digital Communication Systems, divided into six units covering topics such as block diagrams, coding theorems, error correction codes, convolution codes, and synchronization techniques. It includes theoretical concepts, practical applications, and exercises for encoding and decoding using various methods like Huffman coding and Viterbi algorithm. Additionally, it addresses performance evaluation through metrics like probability of error and eye patterns.

Uploaded by

Dharun
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/ 3

UNIT I:

1. Block diagram of Digital Communication System.


2. Advantages and disadvantages of Digital communication system
3. MAP and ML decision rule.
4. Derive the optimum receiver over AWGN channel. (Correlation receiver).
5. Derive the impulse response of the matched filter. Properties of Matched Filter.
6. Gram Schmidt Orthogonalization procedure:
1. Find the orthonormal basis for the given signal set.

2. Determine the orthonormal basis functions for signals given and draw the signal space
diagram.

UNIT II

1. State Source coding Theorem


2. State Channel Coding Theorem
3. State Channel capacity Theorem.
4. Define Mutual information and its properties.
5. BSC and BEC models.
6. Huffman and Shannon-Fano encoding, entropy of the source, efficiency, redundancy and variance
of the code word.
Channel capacity -derivation.

Encode the following source using Huffman coding procedures and the Shannon-Fano procedure.
calculate the average code length, efficiency, and redundancy of the codewords derived. Compare
the results.
X x1 x2 x3 x4 x5 x6 x7
p(X) 0.3 0.25 0.17 0.08 0.08 0.08 0.04
UNIT III:
1. A (6,3) parity check code has the following parity check matrix.

a. Determine the generator matrix G.


b. Construct all the code words.
c. Find the error correction and detection capability of this code.
d. Suppose that the received word is 110110.Decode this received word.

2. For a (7,4) systematic linear block code three parity check bits C4,C5,C6 are given by:
C4= d1 d2 d3
C5= d2 d3 d4
C6= d1 d2 d4
a. Construct the Generator matrix and parity check matrix.
b. Construct the encoding table and find all possible codewords.
c. Comment on the error detection and correction capability of the code.
2. Consider the G matric given below for a (7,4) Block code.
1 1 0 1 0 0 0
0 1 1 0 1 0 0
𝐺= [ ]
1 1 1 0 0 1 0
1 0 1 0 0 0 1

a) Find all the codewords generated using the generator matrix.


b) Determine the error correction and detection capability of the code.
c) Construct the syndrome versus error pattern table.
3. Construct the (7,4) linear code word for the generator polynomial g(D) =1+D2+D3 for the
message bits 1011,1000,1101 and 1111 using systematic encoding rule.

4. Sketch the encoder and find the code word for the message words 1011 and 1101 and
syndrome calculator for the polynomial g(D) =1+D2+D3 and Obtain the syndrome for the
received word 1001011.

5. Construct the (7,4) linear code word for the generator polynomial g(D) =1+D+D3 . Decode
the sequence 1001011 and verify the answer by applying decoding algorithm.

6. A 1/3 rate convolution code has the following generators: g1 = [100], g2= [101], g3= [111].
a) Draw the encoder circuit corresponding to this code.
b) Draw State diagram and Trellis diagram.
c) Draw code tree and find the encoded sequence for message 101.
d) Decode the sequence using Viterbi algorithm.
7. Draw ½ rate convolution encoder with generator polynomials g(1)(D) =1+D and
g(2)(D)=1+D+D2. Compute the encoder output for the input sequence {101101} using Trellis
diagram and State transition diagram. Apply Viterbi decoding algorithm to decode the
received data 11,01,10, 10,10.

UNIT IV
1. Deduce an expression for Nyquist criteria for distortion less base-band transmission for zero
ISI.
2. Elaborate on the ideal and practical solutions to achieve zero ISI.
3. The binary data 10110001 is applied to the input of a duo binary system.
a. Construct the duo binary coder output and corresponding receiver output, without
a precoder.
b. Suppose that due to an error during transmission, the level at the receiver input
produced by the third digit is reversed. Construct the new receiver output.
c. Repeat the above two cases using the precoder.

4. The binary data 10000101 is applied to the input of a modified duo binary system.
d. Construct the duo binary coder output and corresponding receiver output, without
a precoder.
e. Suppose that due to an error during transmission, the level at the receiver input
produced by the third digit is reversed. Construct the new receiver output.
f. Repeat the above two cases using the precoder.
5. Analyze an eye pattern and represent the ways in which it could be used to evaluate the
performance of a baseband pulse transmission system with a neat schematic.
6. Explain the operation of an Adaptive Equalizer with a neat diagram.
UNIT V
1. Signals, signal space diagram and transmitter and receiver logical diagram of
BFK,BPSK,QPSK, MSK and DPSK.
2. Comparison of Modulation schemes.
3. Derive the probability of error for the BPSK scheme over AWGN channel.
4. Derive the probability of error for the BFSK scheme over AWGN channel.
5. Draw MSK transmitter and receiver block diagram.
6. Define MSK and draw the Phase trellis diagram.
7. Determine the DPSK signal phase for the following data sequence 1 0 0 1 1 1. Draw the
DPSK transmitter and receiver and explain.
UNIT VI
1. What is the need for carrier and symbol synchronization.
2. Explain Mth power Loop/Squaring Loop carrier synchronization techniques.
3. Costas Loop.
4. Early late gate symbol synchronization techniques.

You might also like