Scribd
Upload
2 views

DC QB

The document outlines various topics in digital communication, including matched filters, coherent reception, and different modulation techniques such as Binary Phase Shift Keying and Differential Phase Shift Keying. It also covers mutual information, entropy properties, Huffman coding, and convolutional codes, along with their error probabilities and decoding methods. Additionally, it includes practical problems related to error probability calculations and code design.

Uploaded by

anandjayakumarmanda
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
2 views

DC QB

The document outlines various topics in digital communication, including matched filters, coherent reception, and different modulation techniques such as Binary Phase Shift Keying and Differential Phase Shift Keying. It also covers mutual information, entropy properties, Huffman coding, and convolutional codes, along with their error probabilities and decoding methods. Additionally, it includes practical problems related to error probability calculations and code design.

Uploaded by

anandjayakumarmanda
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

UNIT-3

1 List out the properties of a matched filter.


2 Explain the optimal of coherent Reception.
3 Explain the principle of Binary Phase Shift Keying.
4 Explain the principle of differential phase shift keying.
5 Compare different digital modulation techniques with respect to their error probabilities.

6 Binary data is transmitted over an RF bandpass channel having a bandwidth of 10MHz at a


rate of 4.8 Mbps, with 1mV carrier amplitude using ASK technique. The channel has a noise
psd of 10-15 watts/Hz. Find the error probability of the system.
7 Derive an expression for Probability of error in QPSK systems.
8 Derive an expression for error probability in BPSK systems.
9 Derive an expression for error probability in ASK systems.
10 Derive an expression for probability of error of matched filter.
UNIT-4
1 What is mutual information and explain the properties associated to it.

2 Prove that the mutual information of the channel is symmetric i.e., I (X; Y) = I (Y; X)
3 Explain the code redundancy and the code variance.

4 Calculate the amount of information if binary digits occur with equal likelihood in binary PCM.

5 Explain the properties of entropy.


6 Briefly describe about the Code tree, Trellis and State Diagram for a Convolution Encoder.
7 Draw the state diagram, tree diagram, and trellis diagram for k=3, rate 1/3 code generated by
g1(x) = 1+x2, g2(x) = 1+x and g3(x) = 1+x+x2.
8 A memory less source emits six messages with probabilities 0.3, 0.25, 0.15, 0.12, 0.1 and 0.08.
Find the Huffman code. Determine its average word length, the efficiency and the redundancy.
9 A code is composed of dots and dashes. Assume that the dash is three times as long as the dot and has
one-third the probability of occurrence.
(i) Calculate the information in a dot and that in a dash
(ii) Calculate the average information in the dot-dash code.
(iii) Assume that a dot lasts for 10ms and that this same time interval is allowed between symbols.
Calculate the average rate of information transmission.
10 A discrete memory less source has five symbols x1, x2, x3, x4 and x5 with probabilities 0.4,
0.19, 0.16, 0.15 and 0.15 respectively attached to every symbol. Construct a Shannon – Fano
code for the source and calculate code efficiency
UNIT-5
1 Distinguish between linear block codes and convolutional codes.
2 Write the advantages and disadvantages of cyclic codes.
3 Define the code rate of convolutional encoder.
4 Draw the encoder for a (7,4) cyclic hamming code generated by the generator polynomial,
G(p) = 1+p+p3.
5 Explain about the BCH codes.
6
A generator matrix generates a (4,2) code. What is the parity check matrix
of this code?
7 Briefly describe the Viterbi algorithm for maximum likelihood decoding of convolutional
codes.
8 Design an encoder for the (7,4) binary cyclic code generated by g(x) = 1 + x +x 3 and verify
its operation using the message vector (0 1 0 1).
9 What are the different methods of decoding of convolutional codes? Explain.
10 Explain about the Error detection and error correction capabilities of linear block codes.

You might also like