Scribd
Upload
64 views2 pages

Answer ALL Questions. Missing Data May Be Suitably Assumed

This document contains instructions and questions for a Digital Communications end semester examination. It includes questions on: 1) Performing source encoding using Shannon-Fano and Huffman coding techniques on a discrete memoryless source and calculating the efficiencies. 2) Drawing the block diagram of a convolutional encoder and finding the encoder output for a given message sequence. 3) Obtaining the PN sequence from a PN sequence generator with three flip-flops. 4) Deriving expressions related to probability of error, orthogonal signals, impulse responses, aliasing error, PCM system design, output SNR, compander ratios, and encoding voice for transmission.

Uploaded by

Devender Dua
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
64 views2 pages

Answer ALL Questions. Missing Data May Be Suitably Assumed

This document contains instructions and questions for a Digital Communications end semester examination. It includes questions on: 1) Performing source encoding using Shannon-Fano and Huffman coding techniques on a discrete memoryless source and calculating the efficiencies. 2) Drawing the block diagram of a convolutional encoder and finding the encoder output for a given message sequence. 3) Obtaining the PN sequence from a PN sequence generator with three flip-flops. 4) Deriving expressions related to probability of error, orthogonal signals, impulse responses, aliasing error, PCM system design, output SNR, compander ratios, and encoding voice for transmission.

Uploaded by

Devender Dua
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

Reg. No.

SIXTH SEMESTER B.TECH. (E & C) DEGREE END SEMESTER EXAMINATION


APRIL/MAY 2019
SUBJECT: DIGITAL COMMUNICATIONS (ECE - 3201)

TIME: 3 HOURS MAX. MARKS: 50


Instructions to candidates
 Answer ALL questions.
 Missing data may be suitably assumed.

1A. A discrete memory-less source X has eight symbols x1, x2, x3, x4, x5, x6, x7 and x8 with
probabilities P( x1 )  0.01 , P( x2 )  0.01, P( x3 )  0.15 , P( x4 )  0.1 , P( x5 )  0.05 , P( x6 )  0.03
, P( x7 )  0.4 , P( x8 )  0.25 . Perform source encoding using Shannon-Fanon and Huffman
encoding techniques. Also, calculate and compare the efficiencies of both techniques.
1B. A convolutional encoder has a single stage (i.e., one flip-flop with constraint length K=2),
one modulo-2 adder and an output multiplexer. The generator sequences of the encoder are:
g(1) = (1, 1), g(2) = (1, 0). Draw the block diagram of the encoder. Find the encoder output
produced by the message sequence 10111.
1C. The PN sequence generator has 3 flip-flops with outputs x1, x2 and x3 respectively. The
feedback has a modulo-2 adder with x2 and x3 inputs and the feedback is given to the input
of first flip-flop. The initial state of flip-flop is 100. Obtain the PN sequence.
(4+3+3)
2A. Determine and plot the power spectral density of a Manchester data format. Assume
statistically independent and equally likely message bits.
2B. With a neat diagram explain Generalized correlative coding. Construct a correlative coder
which has tap weights 𝑤0 = +1, 𝑤1 = 0 and 𝑤2 = −1. Encode the binary sequence
001011010 using the same coder.
2C. With a neat diagram of transmitter and the receiver, derive the expression for the probability
of error of the coherent Binary Frequency Shift Keying.
(4+3+3)
3A. Derive the maximum likelihood detection rule for the detection of the known equiprobable
M-ary signals in noise. Also obtain the expression for the probability of error for the same.
3B. Consider the functions 𝑠1 (𝑡 ) = 𝑒 −|𝑡| 𝑎𝑛𝑑 𝑠2 (𝑡 ) = 1 − 𝐴𝑒 −2|𝑡| . Determine the constant, A,
such that 𝑠1 (𝑡 ) and 𝑠2 (𝑡 ) are orthogonal over the interval (−∞, ∞).
3C. Derive the impulse response of a matched filter that gives maximum value of output SNR.
(4+3+3)
4A. Prove that a wide sense stationary message process X(t) that contains ‘W’ Hertz as highest
frequency component can be reconstructed from its samples which are spaced at 1/2W secs
apart with zero error power.

ECE – 3201 Page 1 of 2


4B. Derive the expression for aliasing error while reconstructing the signal from its sampled
version. Also mention its maximum value.
4C. Design a TDM PCM system that will accommodate four 300 bps (synchronous) digital
inputs and one analog input that has a bandwidth of 500 Hz. Assume that the analog samples
will be encoded into 4-bit PCM words.
(4+3+3)
5A. Determine the output SNR in a DM system for a 1 kHz sinusoid, sampled at 32 kHz without
slope overload and followed by a 4 kHz post reconstruction filter.
5B. Determine the ratio of minimum to maximum step size in the case of A-law compander.
5C. A binary channel with a bit rate 𝑅𝑏 = 36𝑘𝑏𝑝𝑠 is available for PCM voice transmission. Find
appropriate values of the sampling rate, Number of quantization levels and the number of
bits per sample if the maximum frequency component is 𝑓𝑚 =3.2 kHz
(4+3+3)

ECE – 3201 Page 2 of 2

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