USHA RAMA COLLEGE OF ENGINEERING AND TECHNOLOGY

DEPT. OF ELECTRONICS AND COMMUNICATION

Question Bank (2016-17)

JNTUK-R13

SUBJECT: DIGITAL COMMUNICATIONS (RT32043)

III/II

UNIT-I: PULSE DIGITAL MODULATION

Short Answer Questions
1. Discuss about the different noise effects in Delta Modulation.
2. Give the block diagram representation of DPCM.
3. Discuss about the different noise effects in Pulse Code Modulation.
4. Explain the importance of prediction in DPCM.
Essay Questions
1. a) Explain quantization error and derive an expression for maximum SNR in PCM
system that uses linear quantization.
b) In a binary PCM system, the output signal to quantizing noise ratio is to be
held
to a minimum value of 40dB. Determine the number of levels and find
the
corresponding signal to quantizing noise ratio.
2. a) Explain delta modulation in detail with suitable diagram.
b) Given a sine wave of frequency fm and amplitude Am applied to a delta
modulator having step size. Find the condition on Am for which slope overload
distortion will occur.
3. a) What is slope overload distortion and granular noise in Delta Modulation? How
is it removed in ADM?
b) A speech signal of maximum frequency 3.4 KHz is applied to a delta modulator
whose bit rate is 20Kbps. Determine minimum step size for the delta modulation
so that there is no slope overload.
4. a) What is the necessity of non-uniform quantization and explain companding.
b) If mp = 20V and 256 quantizing levels are employed, what is the voltage
between levels when there is no compression? For = 255, what is the
smallest
and what is the largest effective separation between levels?
5. a) Explain the techniques: Quantization and encoding in PCM system
b) Draw the block diagram of DPCM systems and explain its operation.
6. a) Describe the -Law and A-Law in PCM.
b) Discuss the uniform and non uniform quantization and compare them.
7. a) Explain the PCM technique and evaluate the expression for SNR in PCM.
b) 24 Telephone channels, each band limited to 3.4 KHz, are to be time division
multiplexed by using PCM. Calculate the bandwidth of the PCM system for 128
quantization level and an 8 KHz sampling frequency.
UNIT-II: DIGITAL MODULATION TECHNIQUES
Short Answer Questions
1. Explain the non-coherent detection of binary FSK signals.
2. What is the ambiguity in the decoded output in the case of PSK systems? Explain.
3. What are the types of digital modulation techniques? Explain briefly.

4. Explain how carrier synchronization is done in QPSK.

5. What are the drawbacks of BPSK? How can they be overcome?
6. What type of synchronization is used in QPSK system? Explain.
Essay Questions
1. a) Determine the bandwidth required for M-ary FSK system. Draw the
geometrical representation of M-ary FSK signals and find out the distance
between the signals.
b) Sketch the QPSK waveform for the sequence 1101010010, assuming the
carrier
frequency equal to bit rate.
2. a) Explain with neat block diagram the generation and recovery of BPSK.
b) What are power spectra? Explain power spectra of BPSK and BFSK signals
along with graphs.
3. a) Explain the generation of M-ary ASK with a neat block diagram.
b) Explain the principle of QPSK system. Compare binary PSK and QPSK schemes.
4. a) Draw the block diagram of DPSK modulator and explain how synchronization
problem is avoided for its detection.
b) Write the power spectral density of BPSK and QPSK signals and draw the
power spectrum of each.
5. a) Derive an expression for the spectrum of BPSK and sketch.
b) Draw and explain the signal space representation of the QPSK. List the
advantages of it.
6. a) Explain the operation of the DEPSK. Discuss why errors occur in pairs in this
system.
b) Draw the block diagram of M-arry PSK system and explain its operations.
7. a) Discuss the ASK system in detail.
b) Draw the block diagram of the DPSK modulator. Explain how the
synchronization problem is avoided in this.
UNIT-III: DATA TRANSMISSION
Short Answer Questions
1. Compare a correlator and matched filter.
2. Explain the condition of orthogonality of two BFSK systems.
Essay Questions
1. a) Draw and explain the coherent system of signal reception.
b) Binary data is transmitted over a telephone line with usable bandwidth of 2400
Hz using the FSK signalling scheme. The transmit frequencies are 2025 and 2225
Hz, and the data rate is 300 bits/Sec. The average signal to noise power ratio at the
output of the channel is 6dB. Calculate Pe for the coherent and non
coherent
demodulation schemes.
2. a) Explain about ASK system and derive the relation for error probability of binary
ASK.
b) A binary receiver system receives a bit rate of 1Mbps. The waveform amplitude
is 5mV and the noise power spectral density is 0.5x10-11 W/Hz. Calculate the
average bit error probability if the modulation schemes are ASK, FSK and PSK.
3. a) Explain about coherent binary PSK transmitter and receiver. Assuming channel
noise to be additive white Gaussian obtain expression for probability of error.
b) Calculate the transfer function of the Optimum filter.

4. a) What is matched filter? How it differs from optimum filter? Derive an

expression for impulse response of matched filter
b) In a binary PCM system on/off signalling is used. The matched filter receiver is
used for detection of signal. Calculate the probability of error if signalling rate
is doubled.
5. a) Derive the probability error of QPSK system and explain its operation.
b) What is correlator? Explain the optimum filter reception using correlator.
6. a) What is a matched filter? How it differs from a optimum filter. Derive an
expression for impulse response of the matched filter.
b) Derive the probability of error for FSK.
7. a) Explain how integrator is used to detect the baseband signal. Obtain an
expression for S/N of integrator and dump receiver.
b) Obtain the probability of error for Matched filter.
UNIT-IV: INFORMATION THEORY
Short Answer Questions
1. Calculate the amount of information if binary digits occur with equal likelihood in
binary PCM systems.
2. What is average information? What does it mean?
3. If I(x1) is the information carried by message x1 and I(x2) is the information carried
by message x2, then prove that the amount of information carried compositely due to
x1 and x2 is I(x1,x2) = I(x1)+I(x2).
4. What is entropy? What does it mean?
Essay Questions
1. a) Explain the mutual information and its properties.
b) 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 10 ms and that this same time interval
is allowed between symbols. Calculate the average rate of information
transmission.
2. a) Explain the concept of entropy and its properties.
b) An analog signal band limited to 10kHz is quantized in 8 levels of a PCM
system with probabilities of 1/4, 1/5, 1/5, 1/10, 1/10, 1/20, 1/20 and 1/20
respectively. Calculate the entropy and the rate of information.
3. a) Explain the concept of amount of information and its properties.
b) A discrete source emits one of five symbols once every millisecond. The
symbol
probabilities are 1/2, 1/4, 1/8, 1/16 and 1/16 respectively. Find the
source entropy
and information rate.
4. a) Explain the concept of amount of information.
b) An analog signal is band limited to B Hz, sampled at the nyquist rate, and the
samples are quantized into 4 levels. The quantization levels Q1, Q2, Q3 and Q4
(messages) are assumed independent and occur with probabilities p1= p4=1/8 and
p2= p3=3/8. Find the information rate of the source.
5. a) State and prove the properties of entropy.

b) Consider a telegraph source having two symbols, dot and dash. The dot
duration is 0.2. The dash duration is 3 times the dot duration. The probability
of the dots occurring is twice that of the dash and the time between symbols
is 0.2 sec. Calculate the information rate of the telegraph source.
6. a) An analog signal band limited to 10HKz quantize is 8-lavels of PCM System
with probability of 1/4, 1/5, 1/4, 1/10, 1/20, 1/10, 1/20 and 1/10
respectively.
Find the entropy and rate of information.
b) The source X generates M message, then prove the following inequality for
source entropy H(x):0_H(X) _log M.
7. a) Explain the concept of information. Calculate the amount of information if
binary digits occur with equal likelihood in a binary PCM system.
b) Define information rate and mutual information.
UNIT-V: SOURCE CODING
Short Answer Questions
1. What are discrete memory less channels?
2. Verify that I(X; Y) =I(Y; X).
3. Explain about binary symmetric channel.
4. For a noiseless channel with m input symbols and m output symbols, prove that
H(X) =H(Y).
Essay Questions
1. a) Explain the trade-off between bandwidth and signal to noise ratio.
b) A DMS X has five symbols x1, x2, x3, x4 and x5 with respective probabilities
0.2, 0.15, 0.05, 0.1 and 0.5. Construct Huffman code and calculate the code
efficiency.
2. a) Explain about Huffman coding.
b) 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.
3. a) Discuss in brief about continuous channel capacity.
b) Calculate the capacity of the discrete channel shown in Fig.1. Assume
rs=1symbol/sec

4. a) Consider five messages given by the probabilities 1/2, 1/4, 1/8, 1/16, 1/16.
i. Calculate H

ii. Use Shannon-Fano algorithm to develop an efficient code and for that
code, calculate the average number of bits/message. Compare with H.
b) Explain the trade-off between bandwidth and signal to noise ratio.
5. a) Discuss the channel capacity for discrete and analog channels.
b) Explain the Shannon Fano coding with example.
6. a) What is Shannon theorem? Obtain the channel capacity for Gaussian channel.
b) A discrete memory less source has an alphabet of seven symbols with
probability for its output, as described here:
Symbol
prob.
S1
0.25
S2
0.25
S3
0.125
S4
0.125
S5
0.125
S6
0.0625
S7
0.0625
(i)
Compute the Huffman code for this source and explain why the compute
source code has an efficiency of 100 percent.
(ii)
Calculate H.
7. a) Apply Shannon Fano coding for the 5 messages with probabilities 0.4, 0.15,
0.15, 0.15, 0.15 and find the coding efficiency.
b) What is binary symmetric channel and derive expression for its capacity.
UNIT-VI: LINEAR BLOCK CODES
Short Answer Questions
1. Explain about BCH codes
2. Compare linear block codes and cyclic codes.
3. What is the use of syndromes?
4. What is constraint length for convolution encoders? Explain.
Essay Questions
1. a) Explain sequential decoding for convolutional codes.
b) 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.
2. a) Briefly describe about the Code tree, Trellis and State Diagram for a
Convolution Encoder.
b) The generator polynomial for a (15, 7) cyclic code is g(x) =1+x4 +x6 +x7+x8.
Find the code vector (in systematic form) for the message polynomial D(x) =
x2+x3 +x4. Assume that the first and last bits of the code vector V(x) for
D(x) =
x2+x3 +x4 suffer transmission errors. Find the syndrome of V(x).
3. a) Explain the viterbi algorithm for the decoding of convolutional codes.
b) The parity check bits of a (8, 4) block code are generated by
c5= d1+d2+d4
c6=d1+d2+d3
c7=d1+d3+d4
c8=d2+d3+d4
Where d1, d2, d3 and d4 are the message digits.
(i)
Find the generator matrix and parity check matrix for this
code

(ii)
Find the minimum weight of this code
(iii)
Find the error detecting capabilities of this code.
4. a) Explain matrix description of linear block codes.
b) Design an encoder for the (7,4) binary cyclic code generated by g(x) = 1 + x + x3
and verify its operation using the message vector (0 1 0 1).
5. a) What are hamming codes? Discuss the error correction and detection capability
of hamming code.
b) What are cyclic codes? List the advantages and disadvantages of it.
6. a) Consider (7, 4) linear code whose generator matrix is
1 0 0 0 : 1 0 1
0 1 0 0 : 1 1 1
G= 0 0 1 0 : 1 1 0
0 0 0 1 : 0 1 1
(i) Find all code vectors of this code.
(ii) Find the parity check matrix for this code.
(iii)
Find the minimum weight of this code.
(iv)Prove equation CHT=0
b) Describe the algebraic structure of the binary cyclic codes.
7. a) Give the matrix description of the linear block codes.
b) Compare linear block codes and cyclic codes with one example
CONVOLUTION CODES
Essay Questions
1. a) Explain the differences between the block codes and convolution codes.
b) Explain tree diagram, trellis diagram and state transition diagram of convolution
codes with an example.
2. a) What are the different methods of describing the structure of a convolution
encoder? Explain.
b) Assume a (2, 1) convolution coder with constraint length 6. Draw the tree
diagram and trellis diagram for the assumed coder.
3. a) What is meant by free distance of a convolution code? How does it affect the
number of errors that can be corrected and coding gain
b) Draw the block diagram of a half rate convolution encoder with constraint
length 3. Determine the generator polynomial of the encoder.
4. a) A particular convolution code is described as an (n, k, L) code. What do these
letters n, k and L represent? Explain.
b) The generators of a 1/3 rate convolution code are: g1= [1 0 0]; g2= [1 0 1]
and
g3= [111]. Draw the encoder circuit and Trellis diagram corresponding to
this
code.

ALL THE BEST