0% found this document useful (0 votes)
119 views

Paavai College of Engineering, Pachal, Namakkal. Department of Ece Internal Test-Ii

This document contains an internal test for a digital communications course. It has three parts - a multiple choice section worth 20 marks, longer answer questions worth 65 marks, and a single question worth 15 marks. The questions cover topics like entropy, error correcting codes, modulation techniques, channel capacity, and convolutional codes. Students are asked to define terms, derive equations, compare different methods, draw diagrams, and solve coding problems.

Uploaded by

VasanthLogarajL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
119 views

Paavai College of Engineering, Pachal, Namakkal. Department of Ece Internal Test-Ii

This document contains an internal test for a digital communications course. It has three parts - a multiple choice section worth 20 marks, longer answer questions worth 65 marks, and a single question worth 15 marks. The questions cover topics like entropy, error correcting codes, modulation techniques, channel capacity, and convolutional codes. Students are asked to define terms, derive equations, compare different methods, draw diagrams, and solve coding problems.

Uploaded by

VasanthLogarajL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

PAAVAI COLLEGE OF ENGINEERING, PACHAL, NAMAKKAL.

DEPARTMENT OF ECE
INTERNAL TEST- II
Date: 04.10.19 Department: ECE-A Marks : 100
Year/Sem: III/ V Sub: DIGITAL COMMUNICATION Duration: 3 Hrs
PART-A (10X2=20)

1. What is entropy and give its mathematical equation.


2. Evaluate the Hamming distance between the following code wordsC1={1,0,0,0,1,1,1} and
C2={0,0,0,1,0,1,1}
3. Why Delta Modulation is superior to Differential Pulse Code Modulation?
4. Construct unipolar and RZ code for the binary data 01101001.
5. What is meant by ISI in communication system? How it can be minimized?
6. Illustrate Eye pattern with diagram.
7. Evaluate the error probability of DPSK.
8. Distinguish the error probability for BPSK and QPSK.
9. Express the syndrome properties of linear block code.
10. What is convolutional code? How is it different from block codes?

PART-B (5X13=65)
11.(a)Interpret the following
(i) Mutual information and its properties.
(ii) Channel capacity and it’s equation.
OR
(b)Five symbols of the alphabet of discrete memory less source and their probabilities are
given below, S={S0, S1,S2,S3,S4) P(S)={0.4,0.2,0.2,0.1,0.1}. Construct the symbols using
Huffman coding and Shannon’s Fano coding .Calculate the average codeword length and
efficiency.
12 (a)(i) How would you explain delta modulation and its quantization error?
(ii) Explain how adaptive delta modulation performs better than gains more
OR
(b)Examine the power spectral density of NRZ bipolar and unipolar data format assume that 1s and 0s
of input binary data occur with equal probability.

13. (a)Discuss in detail about inter symbol interference (ISI) and the Nyquist criterion for minimizing ISI.
Elaborate the difficulties in implementing it in
OR
(b)Outline the modified Duo binary coding technique and its performance by illustrating its frequency
and impulse response.
14. (a)Explain the generation and detection of a coherent binary PSK signal and derive the power spectral
density of binary PSK signal and plot it.
OR
(b) (i) Identify the principle of DPSK? Explain the transmitter and receiver of DPSK scheme.
(ii) Point out the Probability of error for coherently detected BFSK.
PAAVAI COLLEGE OF ENGINEERING, PACHAL, NAMAKKAL.
DEPARTMENT OF ECE
INTERNAL TEST- II
Date: 04.10.19 Department: ECE-A Marks : 100
Year/Sem: III/ V Sub: DIGITAL COMMUNICATION Duration: 3 Hrs

PART-A (10X2=20)
11. What is entropy and give its mathematical equation.
12. Evaluate the Hamming distance between the following code wordsC1={1,0,0,0,1,1,1} and
C2={0,0,0,1,0,1,1}
13. Why Delta Modulation is superior to Differential Pulse Code Modulation?
14. Construct unipolar and RZ code for the binary data 01101001.
15. What is meant by ISI in communication system? How it can be minimized?
16. Illustrate Eye pattern with diagram.
17. Evaluate the error probability of DPSK.
18. Distinguish the error probability for BPSK and QPSK.
19. Express the syndrome properties of linear block code.
20. What is convolutional code? How is it different from block codes?

PART-B (5X13=65)
11.(a)Interpret the following
(i) Mutual information and its properties.
(ii) Channel capacity and it’s equation.
OR
(b)Five symbols of the alphabet of discrete memory less source and their probabilities are
given below, S={S0, S1,S2,S3,S4) P(S)={0.4,0.2,0.2,0.1,0.1}. Construct the symbols using
Huffman coding and Shannon’s Fano coding .Calculate the average codeword length and
efficiency.
12 (a)(i) How would you explain delta modulation and its quantization error?
(ii) Explain how adaptive delta modulation performs better than gains more
OR
(b)Examine the power spectral density of NRZ bipolar and unipolar data format assume that 1s and 0s
of input binary data occur with equal probability.

13. (a)Discuss in detail about inter symbol interference (ISI) and the Nyquist criterion for minimizing ISI.
Elaborate the difficulties in implementing it in
OR
(b)Outline the modified Duo binary coding technique and its performance by illustrating its frequency
and impulse response.
14. (a)Explain the generation and detection of a coherent binary PSK signal and derive the power spectral
density of binary PSK signal and plot it.
OR
(b) (i) Identify the principle of DPSK? Explain the transmitter and receiver of DPSK scheme.
(ii) Point out the Probability of error for coherently detected BFSK.
15. (a) Consider a linear block code with generator matrix

1 1 1 0 0 0
0
0 1 0 1 1 0
0
1 1 0 1 0 1 0
1 0 1 0 0 0 1
(i) Enumerate the parity check matrix.
(ii) Trace the error detecting and capability of the code.
(iii) Draw the encoder and syndrome calculation circuits.
(iv) Write the syndrome for the received vector r = [1 1 0 1 01 0].
OR
(b)Examine that the generator polynomial of a (7, 4) cyclic code is 1+X+𝑋3. Discover the correct code
word transmitted if the received code word is (i) 1011011 and (ii) 1101111

PART-C (1X15=15)

16.(a)Explain Viterbi algorithm with an appropriate coder and received input word of length 12. Assume
a coder of constraint length 6 and rate efficiency ½. (ii)Assess a (7,4) binary cyclic code with a
generator polynomial g(x) = 1 + x + x3 draw the syndrome circuit.
OR

(ii)A convolutional code is described by g1=[1 0 0], g2=[1 0 1], g3=[1 1 1]


(i) Build the encoder corresponding to the code.
(ii) Develop the state transition diagram for this code.
(iii) Draw the trellis diagram.
(iv) Estimate the transfer function.
15. (a) Consider a linear block code with generator matrix
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
(i) Enumerate the parity check matrix.
(ii) Trace the error detecting and capability of the code.
(iii) Draw the encoder and syndrome calculation circuits.
(iv) Write the syndrome for the received vector r = [1 1 0 1 01 0].
OR
(b)Examine that the generator polynomial of a (7, 4) cyclic code is 1+X+𝑋3. Discover the correct code
word transmitted if the received code word is (i) 1011011 and (ii) 1101111

PART-C (1X15=15)

16.(a)Explain Viterbi algorithm with an appropriate coder and received input word of length 12. Assume
a coder of constraint length 6 and rate efficiency ½. (ii)Assess a (7,4) binary cyclic code with a
generator polynomial g(x) = 1 + x + x3 draw the syndrome circuit.
OR
(ii)A convolutional code is described by g1=[1 0 0], g2=[1 0 1], g3=[1 1 1]
(i) Build the encoder corresponding to the code.
(ii) Develop the state transition diagram for this code.
(iii) Draw the trellis diagram.
(iv) Estimate the transfer function.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy