DIGITAL COMMUNICATION

DIGITAL COMMUNICATIONS
B.Tech. III Year I Sem.
Course Code: EC503PC
UNIT - I
Elements of Digital Communication Systems: Model of Digital Communication Systems, Digital
Representation of Analog Signal, Certain Issues in Digital Transmission, Advantages of Digital
Communication Systems, Sampling Theorem, Types of Sampling – Impulse Sampling , Natural
Sampling , Flat – Top Sampling. Introduction to Baseband Sampling.
Waveform Coding Techniques: PCM Generation and Reconstruction, Quantization Noise, Non Uniform
Quantization and Companding, DPCM, Adaptive DPCM, DM and Adaptive DM, Noise in PCM and DM.
UNIT - II
Information theory: Information and Entropy, Conditional Entropy and Redundancy, Shannon-Fano
Coding Mutual information, Information Loss due to Noise, Source coding- Huffman Code, Variable
Length Coding, Lempel-ziv coding, Source coding to increase average information per bit, Lossy Source
coding, Bandwidth-S/N Trade off, Hartley Shannon Law.
Error Control Codes
Linear Block Codes: Matrix Description of Linear Block Codes, Error Detection and Error Correction
Capabilities of Linear Block Codes. Cyclic Codes: Algebraic Structure, Encoding,
Syndrome Calculation, Decoding. Convolution Codes: Encoding, Decoding,
UNIT - III
Baseband Pulse Transmission: Introduction, Matched Filter, Error Rate Due to Noise, intersymbol
interference Nyquist's criterion for Distortionless Baseband Binary Transmission, Correlative -Level
Coding Baseband M-Array PAM Transmission PAM Transmission, Digital subscriber Lines, Optimal Liner
Receiver, Adaptive Equalization, Eye patterns.
Digital pass band transmission: pass band transmission model, Gram-Schmidt orthogonalization
procedure, Geometric interpretation of signals Coherent detection of signals in noise, probability of
error, Correlation receiver.
UNIT - IV
Digital Modulation Techniques: Introduction, ASK, ASK Modulator, Coherent ASK Detector, Non-
Coherent ASK Detector, FSK, Bandwidth and Frequency Spectrum of FSK, Non Coherent FSK Detector,
Coherent FSK Detector, FSK Detection using PLL, BPSK, Coherent PSK Detection, QPSK, 8-PSK, 16-
PSK Differential PSK, QAM .
UNIT - V
Spread Spectrum Modulation: Use of Spread Spectrum, Direct Sequence Spread (DSSS), and Code
Division Multiple Access, Ranging using DSSS, Frequency Hopping Spread Spectrum, PN - Sequence:
Generation and characteristics, Synchronization in Spread Spectrum Systems.
TEXT BOOKS:
1. Communications system, S. Haykin, Wiley, 4 edition 2009.
2. Digital and Analog Communication Systems – Sam Shanmugam, John Wiley, 2005.
REFERENCES:
1. Principles of Communication Systems - Herbert Taub, Donald L Schiling, Goutam Saha, 3rd
Edition, McGraw-Hill, 2008
2. Electronic communication systems, Wayne Tomasi, 5 edition, Pearson
3. Communication Systems: Analog and Digital, R. P. Singh , S. Sapre, McGraw-Hill Education, 2012
4. Digital Communications – John G. Proakis , Masoud Salehi – 5th Edition, McGraw- Hill, 2008.
 DIGITAL COMMUNICATION

COURSE DESCRIPTION:

The course is intended for senior level undergraduate students to the basic principles of digital
communication systems.The course presents the fundamental techniques of generation,
transmission, and reception of digital communication system related signals applicable for a
wide range of communication applications. The concept of different Digital Modulation
Techniques has been included and related error probability analysis for optimum system
performance has been thoroughly covered in this course. The mathematical foundation of
decomposing the systems into separately designed source codes and channel codes.Itgives a
comprehensive introduction to the basics of information theory, a rather thorough treatment of
Fourier transforms and the sampling theorem.
This course gives students deep knowledge in modern digital communication systems at the
theoretical & practical level. Introduces the most advanced standards & outlines the future of
digital wireless communication systems and networking.
Prerequisites
Students are expected to have a good undergraduate background in probability theory and
Stochastic Processes, Analog Communications

COURSE OBJECTIVES
1. To learn the various pulse modulation techniques such as Delta Modulation, Adaptive Delta
Modulation, PCM and comparison.
2. To learn and analyze various digital modulation techniques such as ASK, PSK, FSK, BPSK,
DPSK, QPSK and M-ary signaling.
3. To analyze the probability of error for various modulation techniques.
4. To learn concepts of information theory and coding concepts like Huffman coding Shannon
Fano coding etc.
5. To learn the error detection and correction codes.
6. To understand the Digital communication System.
7. To understand the functional block diagram of Digital communication system.
8. To understand the need for source and channel coding.
9. To study various source and channel coding techniques.
10. To understand a mathematical model of digital communication system for bit error rate
analysis of different digital communication systems.

COURSE OUTCOMES
 DIGITAL COMMUNICATION

The Students will be able to

1. Understand various pulse modulation schemes
2. Understand various digital modulation techniques.
3. Understand various coding schemes, error correction and error detection.
4. Understand the overall digital communication system.
5. Understand basic components of Digital Communication Systems.
6. Design optimum receiver for Digital Modulation techniques.
7. Analyze the error performance of Digital Modulation Techniques.
8. Understand the redundancy present in Digital Communication by using various source coding
techniques.
9. Know about different error detecting and error correction codes like block codes, cyclic codes and
convolution codes.
 DIGITAL COMMUNICATION

LECTURE PLAN

Sl. No Topic L.No. Date

UNIT – I Elements of Digital Communication Systems & Waveform Coding Techniques(15)
1 Model of Digital Communication Systems 1
2 Digital Representation of Analog Signal, 1
3 Issues in Digital Transmission 1
4 Advantages of Digital Communication Systems 1
5 Sampling Theorem 1
6 Impulse Sampling , Natural Sampling , 1
7 Flat – Top Sampling. Introduction to Baseband Sampling. 1
8 Elements of Pulse Code Modulation(PCM) 1
9 Non uniform quantization, Coding 1
10 DPCM, 1
11 Delta Modulation,Drawbacks in DM 1
12 Adaptive DM. 1
13 Noise in PCM and DM 1
14 Problems,comparisons between PCM , DM and ADM 1
UNIT – II Information Theory, Linear Block & Convolution codes(15)
15 Discrete messages Information and entropy 1
16 Information rate, Conditional entropy and redundancy 1
17 Mutual information +Problems 1
18 Communication Channel – Channel Capacity 1
19 Shannon’s theorem 1
20 Shannon Fano coding + Problems 1
21 Huffman code + Problems 1
22 bandwidth – S/N trade off 1
23 Problems 1
24 Error control coding: Matrix description of linear block codes 1
25 Hamming Codes 1
26 Error detection and error correction capabilities of LBC + Problems 2
27 Cyclic codes: Algebraic structure 1
28 encoding, syndrome calculation decoding 1
29 Decoding using viterbi algorithm 1
UNIT – III Baseband and Pasband Pulse Transmission(12)
30 Matched Filter 1
31 Matched Filter, Error Rate Due to Noise 1
intersymbol interference Nyquist's criterion for Distortionless Baseband 1
32
Binary Transmission
Correlative -Level Coding Baseband M-Array PAM Transmission PAM 1
33
Transmission
34 Digital subscriber Lines 1
35 Optimal Liner Receiver 1
36 Adaptive Equalization, Eye patterns 1
37 pass band transmission model 1
38 Gram-Schmidt orthogonalization procedure 1
39 Geometric interpretation of signals Coherent detection of signals in noise 1
40 probability of error 1
41 Correlation receiver. 1
 DIGITAL COMMUNICATION

UNIT – IV Digital Modulation Schemes(11)

42 ASK Modulator, coherent & non-coherent ASK detector 2
43 FSK Bandwidth and frequency spectrum of FSK, 1
44 Non coherent FSK detector and coherent FSK Detector, 2
45 BPSK, coherent PSK detection, 2
46 DPSK System 1
47 Q PSK system 1
48 DEPSK, QAM, 2
UNIT – VSpeared Spectrum Modulation(7)
49 Speared spectrum modulation: use of spread spectrum 1
50 DSSS, C DMA 1
51 ranging using DSSS 1
52 Frequency Hopping Spread Spectrum 1
53 Synchronization in DS Spread Spectrum system 1
54 Synchronization in FH Spread Spectrum system 1
55 PN sequences: Generation and characteristics 1
56 Problems

57 Revision in IV & V Units 2

58 Revision in III Units 2
59 Revision in II Units 3
60 Revision in I Units 3
61 Problems from previous question papers 2
62 Problems from previous question papers 2
 DIGITAL COMMUNICATION

UNIT-I
SAMPLING & QUANTIZATION
1. Define Dirac comb or ideal sampling function. What is its Fourier Transform?
Dirac comb is nothing but a periodic impulse train in which the impulses are spaced by a time interval
of Ts seconds. The equation for the function is given

2. Give the interpolation formula for the reconstruction of the original signal.
The interpolation formula for the reconstruction of the original signal g(t) from the sequence of sample
values {g(n/2W)}.
3. State sampling theorem.

 If a finite –energy signal g(t) contains no frequencies higher than W hertz ,it is completely
determined by specifying its co=ordinates at a sequence of points spaced 1/2W seconds apart.
 If a finite energy signal g(t) contains no frequencies higher than W hertz, it may be completely
recovered from its co=ordinates at a sequence of points spaced 1/2W seconds apart.
 A band limited signal of finite energy, which has no frequency components higher than W Hz,
may be completely recovered from the knowledge of its samples taken at the rate of 2W samples per
second.
4. Define quadrature sampling.
Quadrature sampling is used for uniform sampling of band pass signals.
5. Define Nyquist rate.
Let the signal be band limited to W Hz. Then Nyquist rate is given as,Nyquist rate = 2W samples/sec
Aliasing will not take place if sampling rate is greater than Nyquist rate.
6. What is meant by aliasing effect?
Aliasing effect takes place when sampling frequency is less than Nyquist rate. Under such
condition,the spectrum of the sampled signal overlaps with itself. Hence higher frequencies take the
form of lower frequencies. This interference of the frequency components is called as aliasing effect. A
band limited signal of finite energy, which has no frequency components higher than W Hz, may be
completely recovered from the knowledge of its samples taken at the rate of 2W samples per second.
6. What is meant by PCM?
 DIGITAL COMMUNICATION

Pulse code modulation (PCM) is a method of signal coding in which the message signal is sampled,
the amplitude of each sample is rounded off to the nearest one of a finite set of iscrete levels and
encoded so that both time and amplitude are represented in discrete form.. This allows the message to
be transmitted by means of a digital waveform.
8. What are the two fold effects of quantizing process?
1. The peak-to-peak range of input sample values subdivided into a finite set of decision levels or
decision thresholds
2. The output is assigned a discrete value selected from a finite set of representation levels are
reconstruction values that are aligned with the treads of the staircase.
9. What is meant by idle channel noise?
Idle channel noise is the coding noise measured at the receiver output with zero transmitter input.
10. What is meant by prediction error?
The difference between the actual sample of the process at the time of interest and the predictor output
is called a prediction error.
11. Define delta modulation.
Delta modulation is the one-bit version of differential pulse code modulation.
12. Define adaptive delta modulation.
The performance of a delta modulator can be improved significantly by making the step size of the
modulator assume a time- varying form. In particular, during a steep segment of the input signal the
step size is increased. Conversely, when the input signal is varying slowly, the step is reduced, In this
way, the step size is adapting to the level of the signal. The resulting method is called adaptive delta
modulation (ADM).
13. Name the types of uniform quantizer?
1. Mid tread type quantizer.
2. mid riser type quantizer.
14. Define mid tread quantizer?
Origin of the signal lies in the middle of a tread of the staircase.
15. Define mid-riser quantizer?
Origin of the signal lies in the middle of a rise of the staircase
 DIGITAL COMMUNICATION

16. What is meant by quantization?

While converting the signal value from analog to digital, quantization is performed. The analog value
is assigned to nearest digital value. This is called quantization. The quantized value is then converted
into equivalent binary value. The quantization levels are fixed depending upon the number of bits.
Quantization is performed in every Analog to Digital Conversion.
17. The signal to quantization noise ratio in a PCM system depends on what criteria?
The signal to quantization noise ratio in PCM is given as,
(S/N) db≤(4.8+6v)dB
Here v is the number of bits used to represent samples in PCM. Hence signal to quantization noise
ratio in PCM depends upon the number of bits or quantization levels.
18. Define quantization error?
Quantization error is the difference between the output and input values of quantizer.
19. What you mean by non-uniform quantization?
Step size is not uniform. Non-uniform quantizer is characterized by a step size that increases as the
separation from the origin of the transfer characteristics is increased. Non-uniform quantization is
otherwise called as robust quantization. .
20. Draw the quantization error for the mid tread and mid-rise type of quantizer?
 DIGITAL COMMUNICATION

21. What is the disadvantage of uniform quantization over the non-uniform quantization?
SNR decreases with decrease in input power level at the uniform quantizer but non-uniform
quantization maintains a constant SNR for wide range of input power levels. This type of quantization
is called as robust quantization.
22. What do you mean by companding?
The signal is compressed at the transmitter and expanded at the receiver. This is called as companding.
The combination of a compressor and expander is called a compander.
23. Draw the block diagram of compander? Mention the types of companding? Block diagram:

Types of companding:
1. A-law companding.
2. µ-law companding.
24. Define ADPCM
It means adaptive differential pulse code modulation, a combination of adaptive quantization and
adaptive prediction. Adaptive quantization refers to a quantizer that operates with a time varying step
size. The autocorrelation function and power spectral density of speech signals are time varying
functions of the respective variables. Predictors for such input should be time varying. So adaptive
predictors are used.

UNIT-II
 DIGITAL COMMUNICATION

INFORMATION THEORY & ERROR CONTROL CODING

1. What is linear code?
A code is linear if the sum of any two code vectors produces another code vector. A code is linear if modulo-2
sum of any two code vectors produces another code vector. This means any code vector can be expressed as
linear combination of other code vectors.
2. What is code rate?
Code rate is the ratio of message bits (k) and the encoder output bits (n).It is defined by r (i.e)
r= k/N
3. Define code efficiency.
It is the ratio of message bits in a block to the transmitted bits for that block by the encoder i.e
Code efficiency= Message bits in a block/ Transmitted bits for the block
4. What is hamming distance?
The hamming distance between two code vectors is equal to the number of elements in which they differ. For
example, let the two code words be, X = (101) and Y= (110) these two code words differ in second and third
bits. Therefore the hamming distance between X and Y is two.
5. What is meant by systematic and non-systematic codes?
In a Systematic block code, message bits appear first and then check bits. In the non-systematic code message
and check bits cannot be identified in the code vector.
6. How syndrome is calculated in Hamming codes and cyclic codes?
In Hamming codes the syndrome is calculated as ,
S = YH T
Here Y is the received and HT is the transpose of parity check matrix. In cyclic code, the syndrome vector
polynomial is given as,
S (P) = remainder ( y (p)/ G (P) )
Y(P) is received vector polynomial and G (p) is generator polynomial.
7.What are the conditions to satisfy the hamming code?
No. of Check bits q ³ 3
Block length n = 2q –1
No of message bits K = n-q
Minimum distance dmin =3.
8.What are the error detection and correction capabilities of hamming codes?
The minimum distance (dmin) of hamming codes is 3, Hence it can be used to detect double errors or correct
single errors. Hamming codes are basically linear block codes with dmin =3.
9. Define code word & block length.
The encoded block of ‘n’ bits is called code word. The no. of bits ‘n’ after coding is called block length.

10.What is difference between block codes and convolutional codes?

 DIGITAL COMMUNICATION

Block codes takes k .number of bits simultaneously form n-bit .code vector. This code vector is also called
block. Convolutional code takes one message bits at a time and generates two or more encoded bits. Thus
convolutional codes generate a string of encoded bits for input message string.
11. What is convolutional code?
Fixed number of input bits is stored in the shift register & they are combined with the help of mod 2 adders.
This operation is equivalent to binary convolution coding.
12. What is meant by syndrome of linear block code?
The non zero output of the produce YH.is called syndrome & it is used to detect the errors in y. Syndrome is
denoted by S & given as, S=YHT
13. What are the advantages of convolutional codes
Advantages:
1 .The decoding delay is small in convolutional codes since they operate of smaller blocks of data. 2. .The
storage hardware required by convolutional decoder is less since the block sizes are smaller.
Disadvantages:
1. Convolutional codes are difficult to analyze since their analysis is complex.
2. Convolutional codes are not developed much as compared to block codes.
14. Define sates of encoder?
The constraint length of the given convolutional encoder is K=2. Its rate is ½ means for single message bit
.input, two bits .x1 and x2 .are encoded at the output.S1 represents the input message bit and S.stores the
previous message 2 bit. .Since only one previous message bit is stored, .this encoder can have states depending
upon this stored message bit.Let s represent,

12. Compare between code tree and trellis diagram.

Code tree Trellis diagram
Code tree indicates flow of the coded signal along Trellis diagram indicates transitions from
the nodes of the tree current to next state
Code tree is lengthy way of representing coding Code trellis diagram is shorter or compact
process way of representing coding process

15. Define constraint length in convolutional codes?

Constraint length is the number of shifts over which the single message bit can influence the encoder output.
.This expressed in terms of message bits.
16. Define minimum distance.
It is the smallest hamming distance between the valid code vectors. The error detecting correcting capabilities
of the codes depend upon the minimum distance.
17. Define hamming weight.
The number of 1’s in the code word of the hamming code is called as hamming distance.
18. What are the classifications if line codes?
Line code is classified as 1.Polar 2. Unipolar. 3.Bipolar
19. What is Manchester code?
 DIGITAL COMMUNICATION

In the Manchester code binary ’1’is encoded by positive half pulse followed by negative pulse. And binary ‘0’
is encoded by negative half pulse followed by positive pulse.
20. State any desirable properties of a line code.
1. The PAM signal should have adequate timing content, so that clock information can be executed from the
waveform.
2.The PAM signal should be immune to channel noise and interference.
3. The PAM signal should allow error detection and correction.
21. What are the advantages of cyclic codes?
1. Encoders and decoders for cyclic codes are simple
2. Cyclic codes also detect error burst that span many successive bits.
22. What is meant by cyclic codes?
Cyclic codes are the subclasses of linear block codes. They have the property that a cyclic shift of one
codeword produces another code word.
23. Define free distance and coding gain.
Free distance is the minimum distance between code vectors. It is also equal to minimum weight of the code
vectors. Coding gain is used as a basis of comparison for different coding methods. To achieve the same bit
error rate the coding gain is defined as,
A= (Eb/No) encoded
(Eb/No) coded
For Convolutional coding, the coding gain is given as,
A = rdf /2
Here „r‟ is the code rate
And „df is the free distance.
24. What are the advantages and disadvantages of cyclic codes? Advantages:
 The error detection and decoding methods of cyclic codes are simpler and easy to implement.
 The encoders and decoders are simpler than non cyclic codes.
 Cyclic codes have well defined mathematical structure. Hence, it is an efficient and powerful code to
detect burst errors.
Disadvantages:
 The error detection is simple but error correction is little complicated
 The decoders used are complex circuit.
24. What is Vitterbi decoding scheme?
It performs maximum likelihood decoding and it reduces the computational load by taking advantages in code
trellis. Decoding is done with algorithm.
26. What are the limitations of Vitterbi decoding?
It can correct up to 2 errors. A triple error pattern is un correctable by the Vitterbi algorithm. Constraint length
increases complexity also increases exponentially. The error probability decreases easily
UNIT-III
 DIGITAL COMMUNICATION

BASEBAND TRANSMISSION

1. What is inter symbol interference in baseband binary PAM systems?

In baseband binary PAM, symbols are transmitted one after another. These symbols are separated by sufficient
time durations. The transmitter, channel and receiver acts as a filter to this baseband data. Because of the
filtering characteristics, transmitted PAM pulses are spread in time.
2. What are eye pattern?
Eye pattern is used to study the effect of ISI in baseband transmission.
1. Width of eye opening defines the interval over which the received wave can be sampled without error from
ISI.
2. The sensitivity of the system to timing error is determined by the rate of closure of the eye as the sampling
time is varied.
3. Height of the eye opening at sampling time is called margin over noise.
3. How is eye pattern obtained on the CRO?
Eye pattern can be obtained on CRO by applying the signal to one of the input channels and given an external
trigger of 1/Tb Hz. This makes one sweep of beam equal to Tb seconds.
4. What is correlative coding?
Correlative level coding is used to transmit a baseband signal with the signaling rate of 2Bo over the channel
of bandwidth Bo. This is made physically possible by allowing ISI in the transmitted in controlled manner.
This ISI is known to receiver. The correlative coding is implemented by duo binary signaling and modified duo
binary signaling.
5. Define Duo binary baseband PAM system.
Duo binary encoding reduces the maximum frequency of the baseband signal. The word duo means to double
the transmission capacity of the binary system. Let the PAM signal ak represents k th bit. Then the encoder the
new waveform as
Ck =ak + ak-1
Thus two successive bits are added to get encoded value of the kth bit. Hence Ck becomes a correlated signal
even though ak is not correlated. This introduces intersymbol interference in the controlled manner to reduce
the bandwidth.
6. What are the three broad types of synchronization?
1. Carrier synchronization
2. Symbol & Bit synchronization
3. Frame synchronization.
7. What is carrier synchronization?
The carrier synchronization is required in coherent detection methods to generate a coherent reference at the
receiver. In this method the data bearing signal is modulated on the carrier in such a way that the power
spectrum of the modulated carrier signal contains a discrete component at the carrier frequency.
8. What are the two methods for carrier synchronization?
 DIGITAL COMMUNICATION

1. Carrier synchronization using Mth Power loop

2. Costas loop for carrier synchronization
9. What it is called symbol or bit synchronization?
In a matched filter or correlation receiver, the incoming signal is sampled at the end of one bit or symbol
duration. Therefore the receiver has to know the instants of time at which a symbol or bit is transmitted. That is
the instants at which a particular bit or symbol status and when it is ended. The estimation of these times of bit
or symbol is called symbol or bit synchronization.
10. What are the two methods used in bit and symbol synchronization?
1) Closed loop bit synchronization
2) Early late gate synchronizer
11. What are the disadvantages of closed loop bit synchronization?
1) If there is a long string of 1’s and 0’s then y (t) has no zero crossings and synchronization may be lost.
2) If zero crossing of y(t) are not placed at integer multiples of Tb, the synchronization suffers from timing
Jitter.
12. What it is called frame synchronization?
Depending on bits used for encoding, the word length is defined. Thus each word container some fixed number
of bits. The receiver has to know when a particular frame status and when its individual message bits status.
This type of synchronization is called frame synchronization.
13. Why synchronization is required?
The signals from various sources are transmitted on the single channel by multiplexing. This requires
synchronization between transmitter and receiver. Special synchronization bits are added in the transmitted
signal for the purpose. Synchronization is also required for detectors to recover the digital data properly from
the modulated signal.
14. Why do you need adaptive equalization in a switched telephone network?
In switched telephone network the distortion depends upon
1. Transmission characteristics of individual links.
2. Number of links in connection.
Hence fixed pair of transmit and receive filters will not serve the equalization problem. The transmission
characteristics keep on changing. Therefore adaptive equalization is used.
15. Define the principle of adaptive equalization.
The filters adapt themselves to the dispersive effects of the channel that is .the coefficients of the filters are
changed continuously according to the received data. The filter coefficients are changed in such a way that the
distortion in the data is reduced
16. Define duo binary encoding.
Duo binary encoding reduces the maximum frequency of the base band signal the “word duo” means to the
double transmission capacity of the binary system

17. Write a note on correlative level coding.

 DIGITAL COMMUNICATION

Correlative level coding allows the signal scaling rate of 2Bo in the channel of bandwidth Bo. This is made
physically possible by allowing ISI in the transmitted signal in controlled manner this ISI is known to the
receiver.
18. Define the term ISI.
The presence of outputs due to other bits interference with the output of required bit .This effect is called inter
symbol interference (ISI)
19. Write the performance of data transmission system using eye pattern technique.
The width of the eye opening defines the interval over which the received wave can be sampled without error
from inter symbol interference. The sensitivity of the system to timing error is determined by the rate of
closure of the eye as the sampling time is varied
20. What is the necessity of equalization?
When the signal is passed through the channel distortion is introduced in terms of
1) Amplitude
2) Delay this distortion creates problem of ISI. The detection of the signal also becomes difficult this
distraction can be compensated with the help of equalizer.
21. What is matched filter?
The matched filter is a baseband signal receiver, which works in presence of white Gaussian noise. The
impulse response of the matched filter is matched to the shape of the input signal.
22. Why do we need equalization in base band transmission?
When the signal is passed through the channel, distortion is introduced in terms of i) Amplitude. Ii) Delay.
This distortion creates of ISI. The detection of the signal also becomes difficult. This distortion can be
compensated with the help of equalizers. Equalizers are basically filters which connect the channel distortion.
23. List the primary causes for the noise in communication system.
i) Band limited nature of the channel.
ii) Environmental effects such as lighting, humidity, temperature etc.
iii) EMI and RFI
iv) Thermal noise due to electronic components.
24. Define modulation rate.
It is defined as the rate at which signal level is changed depending On the nature of the format used to
represent the digital data. It is measured in Bauds or symbols per second.
25. State NRZ Unipolar format.
In this format binary 0 is represent by no pulse and binary 1 is represented by the positive pulse.
26. State NRZ polar format.
Binary 1 is represented by a positive pulse and binary 0 is represented by a Negative pulse.
27. State NRZ bipolar format.
Binary 0 is represented by no pulse and binary one is repre ented by the alternative p sitive and negative pulse.

28. State Manchester format.

 DIGITAL COMMUNICATION

Binary 0 Æ The first half bit duration negative pulse and the second half Bit duration positive pulse.
Binary 1Æ first half bit duration positive pulse and the second half Bit duration negative pulse.
29. What is PAM?
PAM is the pulse amplitude modulation. In pulse amplitude modulation, the amplitude of a carrier consisting
of a periodic train of rectangular pulses is varied in proportion to sample values of a message signal.
30. What is the need for speech coding at low bit rates?
The use of PCM at the standard rate of 64 Kbps demands a high channel bandwidth for its transmission ,so for
certain applications, bandwidth is at premium, in which case there is a definite need for speech coding at low
bit rates, while maintaining acceptable fidelity or quality of reproduction.
31. What is meant by forward and backward estimation?
AQF:Adaptive quantization with forward estimation. Unquantized samples of the input signal are used
to derive the forward estimates.
AQB:Adaptive quantization with backward estimation. Samples of the quantizer output are used to
derive the backward estimates.
APF:Adaptive prediction with forward estimation, in which Unquantized samples of the input signal
are used to derive the forward estimates of the predictor coefficients.
APB: Adaptive prediction with backward estimation, in which Samples of the quantizer output and the
prediction error are used to derive estimates of the predictor coefficients.
32. What are the limitations of forward estimation with backward estimation?
 Side information
 Buffering
 Delay
33. What are formant frequencies?
In the context of speech production the formant frequencies are the resonant frequencies of the vocal tract tube.
The formants depend on the shape and dimensions of the vocal tract.
34. Define data signaling Rate.
Data signaling rate is defined as the rate measured in terms bits per second (b/s) at which data are transmitted.
Data signaling rate Rb=I/Tb Where Tb=bit duration.
35. Mention the merits of DPCM.
 Bandwidth requirement of DPCM is less compared to PCM.
 Quantization error is reduced because of prediction filter
 Numbers of bits used to represent one sample value are also reduced compared to PCM.
36. What is the main difference in DPCM and DM?
DM encodes the input sample by one bit. It sends the information about + δ or -δ,ie step rise or fall. DPCM can
have more than one bit of encoding the sample. It sends the information about difference between actual
sample value and the predicted sample value.

37. How the message can be recovered from PAM?

 DIGITAL COMMUNICATION

The message can be recovered from PAM by passing the PAM signal through reconstruction filter integrates
amplitude of PAM pulses. Amplitude reconstruction signal is done to remove amplitude discontinuities due to
pulses.
38.Write an expression for bandwidth of binary PCM with N messages each with a maximum frequency
of fm Hz.
If „v‟ number of bits are used to code each input sample, then bandwidth of PCM is given as, BT ≥
N.v.fm .Here v. fm is the bandwidth required by one message.
39. How is PDM wave converted into PPM message?
The PDM is signal is clock signal to monostable multivibraor. The multivibraor triggers on falling edge. Hence
a PPM pulse of fixed width is produced after falling edge of PDM pulse. PDM represents the input signal
amplitude in the form of width of the pulse. A PPM pulse is produced after the width of PDM pulse. In other
words,the position of the PPM pulse depends upon input signal amplitude.
40. Mention the use of adaptive quantizer in adaptive digital waveform coding schemes.
Adaptive quantizers change its step size according variance of the input signal. Hence quantization error is
significantly reduced due to the adaptive quantization.ADPCM uses adaptive quantization. The bit rate of such
schemes is reduced due to adaptive quantization.
41. What do you understand from adaptive coding?
In adaptive coding, the quantization step size and prediction filter coefficients are changed as per properties of
input signal. This reduces the quantization error and number of bits to represent the sample value. Adaptive
coding is used for speech coding at low bits rates.
42. What is meant by adaptive delta modulation?
In adaptive delta modulation, the step size is adjusted as per the slope of the input signal. Step size is made
high if slope of the input signal is high. This avoids slope overload distortion.
43. What is the advantage of delta modulation over pulse modulation schemes? Delta modulation encodes
one bit per samples. Hence signaling rate is reduced in DM.
44. What is the advantage of delta modulation over PCM?
Delta modulation uses one bit to encode on sample. Hence bit rate of delta modulation is low compared to
PCM.
45. What are the two limitations of delta modulation?
Slope of overload distortion.
Granular noise.
46. How does Granular noise occurs?
It occurs due to large step size and very small amplitude variation in the input signal.
47. What are the advantages of the Delta modulation?
Delta modulation transmits only one bit for one sample. Thus the signaling rate and transmission channel
bandwidth is quite small for delta modulation. The transmitter and receiver implementation is very much
simple for delta modulation. There is no analog to digital converter involved in delta modulation.
UNIT –IV
 DIGITAL COMMUNICATION

DIGITAL MODULATION TECHNIQUES

1. Mention the need of optimum transmitting and receiving filter in baseband data transmission.
When binary data is transmitted over the baseband channel, noise interfaces with it. Because of this noise
interference, errors are introduced in signal detection. Optimum filter performs two functions while receiving
the noisy signal:
1) Optimum filter integrates the signal during the bit interval and checks the output at the time instant where
signal to noise ratio is maximum
2) Transfer function of the optimum filter is selected so as to maximize signal to noise ratio.
3) Optimum filter minimizes the probability of error.
2. Define ASK.
In ASK, carrier is switched on when binary 1 is to be transmitted and it is switched off when binary D is to be
transmitted ASK is also called on-off keying.
3. What is meant by DPSK?
In DPSK, the input sequence is modified. Let input sequence be d(t) and output sequence be b(t). Sequence
b(t) changes level at the beginning of each interval in which d(t)=1 and it does not changes level when d(t)=0.
When b(t) changes level, phase of the carrier is changed. And as stated above, b(t) changes t=its level only
when d(t) =1. This means phase of the carrier is changed only if d(t)=1. Hence the technique is called
Differential PSK.
4. Explain coherent detection?
In coherent detection, the local carrier generated at the receiver is phase locked with the carrier at the
transmitter. The detection is done by correlating received noisy signal and locally generated carrier. The
coherent detection is a synchronous detection.
5. What is the difference between PSK and FSK?
In PSK, phase of the carrier is switched according to input bit sequence. In FSK frequency of the carrier is
switched according to input bit sequence. FSK needs double of the bandwidth of PSK.
6. What is meant by coherent ASK?
In coherent ASK, correlation receiver is used to detect the signal. Locally generated carrier is correlated with
incoming ASK signal. The locally generated carrier is in exact phase with the transmitted carrier. Coherent
ASK is also called as synchronous ASK.
7. What is the advantage of coherent PSK over coherent ASK?
ASK is on-off signalling, where as the modulated carrier is continuously transmitted in PSK. Hence peak
power requirement is more ASK, whereas it is reduced in case of PSK.
8. Explain the model of band pass digital data transmission system?
The band pass digital data transmission system consists of source, encoder and modulator in the transmitter.
Similarly receiver, decoder and destination form the transmitter.
9. What is baseband signal receiver?
 DIGITAL COMMUNICATION

A baseband signal receiver increases the signal to noise ratio at the instant of sampling. This reduces the
probability of error. The baseband signal receiver is also called optimum receiver.
10. What is matched filter?
The matched filter is a baseband signal receiver, which works in presence of white Gaussian noise. The
impulse response of the matched response of the matched filter is matched to the shape pf the input signal.
11. What is the value of maximum signal to noise ratio of the matched filter? When it becomes
maximum?
Maximum signal to noise ratio is the ratio of energy to PSD of white noise. i.e., ρmax = E/ (N0/2)
This maximum value occurs at the end of bit duration i.e. Tb.
12. What is correlator?
Correlator is the coherent receiver. It correlates the received noisy signal f(t) with the locally generated replica
of the unknown signal x(t). Its output is denoted as r(t).
13. On what factor, the error probability of matched filter depends.
Error probability is given as
Pe = 1/2erfc√E/No
This equation shows that error probability depends only on energy but not on shape of the signal.
14. Bring out the difference between coherent & non coherent binary modulation scheme.
a. Coherent detection:
In this method the local carrier generated at the receiver is phase locked with the carrier at the transmitter.
Hence it is called synchronous detection
b. Non coherent detection:
In this method, the receiver carrier need not be phase locked with transmitter carrier. Hence it is called
envelope detection.
15. Write the expression for bit error rate for coherent binary FSK.
Bit error rate for coherent binary FSK is given as,
Pe = 1/2erfc√0.6E/No
16. Highlight the major difference between a QPSK & MSK signal.
MSK signal have continuous phase in all the cases, where as QPSK has phase shift of π/2 or π.
17. What is the error probability of MSK & DPSK?
Error probability of MSK: Pe = 1/2erfc√E/No
Error probability of DPSK: Pe = 1/2e-Eb/No
18. In minimum shift keying what is the relation between the signal frequencies & bit rate.
Let the bit rate be fb and the frequency of carrier be f0. The higher and lower MSK signal frequencies are
given as,
fH = f0 + fb/4
fL = f0 - fb/4
19. List the advantages of Pass band transmission.a. Long distance.
b. Analog channels can be used for transmission.
 DIGITAL COMMUNICATION

c. Multiplexing techniques can be used for bandwidth conservation. d. Transmission can be done by using
wireless channel also.
20. List the requirements of Pass band transmission.
a. Maximum data transmission rate.
b. Minimum probability of symbol error.
c. Minimum transmitted power.
21. What is signal constellation diagram?
The signal constellation diagram is similar to the phasor diagram but the entire phasor is not drawn. The signal
constellation diagram shows only relative positions of the peaks of the phasors.The signal constellation
diagram is also called state space diagram.
22. Define QPSK.
 QPSK is Quadriphase –shift keying. In QPSK the phase of the carrier takes on one of the four equally
spaced values Such as –/4 , 3–/4, 5–/4 and 7–/4.
 In QPSK two successive bits in the data sequence are grouped together. This combination of two bits
forms four distinct symbols. When symbols are changed to next symbol the phase of the carrier is
changed by 450.
23.What is meant by memory less modulation?
When the digital symbol modulates amplitude, Phase or frequency of the carrier without any reference to
provide symbol, it is called memory less modulation.ASK, FSK, PSK, QPSK etc.are memory less modulation
techniques.
 DIGITAL COMMUNICATION

UNIT-V
SPREAD SPECTRUM MODULATION
1. Explain the features of DSSS?
Ans. Some of the important features of DSSS are as follows:
(i) It provides good security againt potential jamming or interception.
(ii) The DSSS is extremely effective against narrowband jamming signals
(iii) The narrowband communication signals can co-exist with the DSSS signals
(iv) The DSSS signal is not very effective against broadband interference.
2. Give the Applications of DS-SS System.
Ans. Some of the important applications of the DS-SS system are as follows:
(i) To combat the intentional interference Gamming)
(ii) To reject the unintentional interference
(iii) To minimize the self interference due to multipath propagation
(iv) In the low probability of intercept (LPI) signal
(v) In obtaining the message privacy
(vi) Code division multiple access with DS-SS.
3. Define CDMA Services.
Following are some of the important CDMA services:
1. Voice services
3. Circuit switched data
5. Message services
7. Location based services
2. Data services
4. Packet switched data
6. CDMA radio
8. CDMA radio channel
4. Direct Sequence Merits Demerits
merits
i) Simpler to implement
ii) Low probability of interception
iii) Can withstand multi-access interference reasonably well
demerits
i) Code acquisition may be difficult
ii) Susceptible to Near-Far problem
iii) Affected by jamming
5. Frequency Hopping Merits Demerits
merits
Less affected by Near-Far problem
 DIGITAL COMMUNICATION

Better for avoiding jamming

Less affected by multi-access interference
demerits
i) Needs FEC ii) Frequency acquisition may be difficult
6. Time Hopping Merits Demerits
merits
i) Bandwidth efficient ii) Simpler than FH system
demerits
i) Elaborate code acquisition is needed. ii) Needs FEC
7.Applications of Spread Spectrum
A specific example of the use of spread spectrum technology is the North American Code Division Multiple
Access (CDMA) Digital Cellular (IS-95) standard. The CDMA employed in this standard uses a spread
spectrum signal with 1.23-MHz spreading bandwidth. Since in a CDMA system every user is a source of
interference to other users, control of the transmitted power has to be employed (due to near-far problem).
8. What are the Types of SS
Based on the kind of spreading modulation, spread spectrum systems are broadly classified as- (i) Direct
sequence spread spectrum (DS-SS) systems (ii) Frequency hopping spread spectrum (FH-SS) systems (iii)
Time hopping spread spectrum (TH-SS) systems. (iv) Hybrid systems.
9. what are the Advantages of Spread Spectrum (SS) Techniques
a) Reduced interference: In SS systems, interference from undesired sources is considerably reduced due to the
processing gain of the system.
b) Low susceptibility to multi-path fading: Because of its inherent frequency diversity properties, a spread
spectrum system offers resistance to degradation in signal quality due to multi-path fading. This is particularly
beneficial for designing mobile communication systems.
c) Co-existence of multiple systems: With proper design of pseudo-random sequences, multiple spread
spectrum systems can co-exist.
d) Immunity to jamming: An important feature of spread spectrum is its ability to withstand strong
interference, sometimes generated by an enemy to block the communication link. This is one reason for
extensive use of the concepts of spectrum spreading in military communications.
 DIGITAL COMMUNICATION

1) In uniform quantization process

a. The step size remains same
b. Step size varies according to the values of the input signal
c. The quantizer has linear characteristics
d. Both a and c are correct
ANSWER: (d) Both a and c are correct
2) The process of converting the analog sample into discrete form is called
a. Modulation
b. Multiplexing
c. Quantization
d. Sampling
ANSWER:(c) Quantization
3) The characteristics of compressor in μ-law companding are
a. Continuous in nature
b. Logarithmic in nature
c. Linear in nature
d. Discrete in nature
ANSWER: (a) Continuous in nature
4) The modulation techniques used to convert analog signal into digital signal are
a. Pulse code modulation
b. Delta modulation
c. Adaptive delta modulation
d. All of the above
ANSWER: (d) All of the above
5) The sequence of operations in which PCM is done is
a. Sampling, quantizing, encoding
b. Quantizing, encoding, sampling
c. Quantizing, sampling, encoding
d. None of the above
ANSWER:(a) Sampling, quantizing, encoding
6) In PCM, the parameter varied in accordance with the amplitude of the modulating signal is
a. Amplitude
b. Frequency
c. Phase
d. None of the above
ANSWER: (d) None of the above
7) One of the disadvantages of PCM is
a. It requires large bandwidth
b. Very high noise
 DIGITAL COMMUNICATION

c. Cannot be decoded easily

d. All of the above
ANSWER: (a) It requires large bandwidth
8) The expression for bandwidth BW of a PCM system, where v is the number of bits per sample and fm is the
modulating frequency, is given by
a. BW ≥ vfm
b. BW ≤ vfm
c. BW ≥ 2 vfm
d. BW ≥ 1/2 vfm
ANSWER: (a) BW ≥ vfm
9) The error probability of a PCM is
a. Calculated using noise and inter symbol interference
b. Gaussian noise + error component due to inter symbol interference
c. Calculated using power spectral density
d. All of the above
ANSWER: (d) All of the above
10) In Delta modulation,
a. One bit per sample is transmitted
b. All the coded bits used for sampling are transmitted
c. The step size is fixed
d. Both a and c are correct
ANSWER: (d) Both a and c are correct
11) In digital transmission, the modulation technique that requires minimum bandwidth is
a. Delta modulation
b. PCM
c. DPCM
d. PAM
ANSWER: (a) Delta modulation
12) In Delta Modulation, the bit rate is
a. N times the sampling frequency
b. N times the modulating frequency
c. N times the nyquist criteria
d. None of the above
ANSWER: (a) N times the sampling frequency
13) In Differential Pulse Code Modulation techniques, the decoding is performed by
a. Accumulator
b. Sampler
c. PLL
d. Quantizer
ANSWER: (a) Accumulator
14) DPCM is a technique
 DIGITAL COMMUNICATION

a. To convert analog signal into digital signal

b. Where difference between successive samples of the analog signals are encoded into n-bit data streams
c. Where digital codes are the quantized values of the predicted value
d. All of the above
ANSWER: (d) All of the above
15) DPCM suffers from
a. Slope over load distortion
b. Quantization noise
c. Both a & b
d. None of the above
ANSWER:(c) Both a & b
16) The noise that affects PCM
a. Transmission noise
b. Quantizing noise
c. Transit noise
d. Both a and b are correct
ANSWER: (d) Both a and b are correct
17) The factors that cause quantizing error in delta modulation are
a. Slope overload distortion
b. Granular noise
c. White noise
d. Both a and b are correct
ANSWER:(d) Both a and b are correct
18) Granular noise occurs when
a. Step size is too small
b. Step size is too large
c. There is interference from the adjacent channel
d. Bandwidth is too large
ANSWER: (b) Step size is too large
19) The crest factor of a waveform is given as –
a. 2Peak value/ rms value
b. rms value / Peak value
c. Peak value/ rms value
d. Peak value/ 2rms value
ANSWER: (c) Peak value/ rms value
20) The digital modulation technique in which the step size is varied according to the variation in the slope of the
input is called
a. Delta modulation
b. PCM
c. Adaptive delta modulation
d. PAM
ANSWER: (c) Adaptive delta modulation
 DIGITAL COMMUNICATION

21) The digital modulation scheme in which the step size is not fixed is
a. Delta modulation
b. Adaptive delta modulation
c. DPCM
d. PCM
ANSWER:(b) Adaptive delta modulation
22) In Adaptive Delta Modulation, the slope error reduces and
a. Quantization error decreases
b. Quantization error increases
c. Quantization error remains same
d. None of the above
ANSWER: (b) Quantization error increases
23) The number of voice channels that can be accommodated for transmission in T1 carrier system is
a. 24
b. 32
c. 56
d. 64
ANSWER: (a) 24
24) The maximum data transmission rate in T1 carrier system is
a. 2.6 megabits per second
b. 1000 megabits per second
c. 1.544 megabits per second
d. 5.6 megabits per second
ANSWER: (c) 1.544 megabits per second
25) T1 carrier system is used
a. For PCM voice transmission
b. For delta modulation
c. For frequency modulated signals
d. None of the above
ANSWER: (a) For PCM voice transmission
26) Matched filter may be optimally used only for
a. Gaussian noise
b. Transit time noise
c. Flicker
d. All of the above
ANSWER:(a) Gaussian noise
27) Characteristics of Matched filter are
a. Matched filter is used to maximize Signal to noise ratio even for non Gaussian noise
b. It gives the output as signal energy in the absence of noise
c. They are used for signal detection
d. All of the above
ANSWER: (d) All of the above
 DIGITAL COMMUNICATION

28) Matched filters may be used

a. To estimate the frequency of the received signal
b. In parameter estimation problems
c. To estimate the distance of the object
d. All of the above
ANSWER: (d) All of the above
29) The process of coding multiplexer output into electrical pulses or waveforms for transmission is called
a. Line coding
b. Amplitude modulation
c. FSK
d. Filtering
ANSWER:(a) Line coding
30) For a line code, the transmission bandwidth must be
a. Maximum possible
b. As small as possible
c. Depends on the signal
d. None of the above
ANSWER: (b) As small as possible
31) Regenerative repeaters are used for
a. Eliminating noise
b. Reconstruction of signals
c. Transmission over long distances
d. All of the above
ANSWER:(d) All of the above
32) Scrambling of data is
a. Removing long strings of 1’s and 0’s
b. Exchanging of data
c. Transmission of digital data
d. All of the above
ANSWER: (a) Removing long strings of 1’s and 0’s
33) In polar RZ format for coding, symbol ‘0’ is represented by
a. Zero voltage
b. Negative voltage
c. Pulse is transmitted for half the duration
d. Both b and c are correct
ANSWER: (d) Both b and c are correct
34) In a uni-polar RZ format,
a. The waveform has zero value for symbol ‘0’
b. The waveform has A volts for symbol ‘1’
c. The waveform has positive and negative values for ‘1’ and ‘0’ symbol respectively
d. Both a and b are correct
ANSWER: (d) Both a and b are correct
 DIGITAL COMMUNICATION

35) Polar coding is a technique in which

a. 1 is transmitted by a positive pulse and 0 is transmitted by negative pulse
b. 1 is transmitted by a positive pulse and 0 is transmitted by zero volts
c. Both a & b
d. None of the above
ANSWER: (a) 1 is transmitted by a positive pulse and 0 is transmitted by negative pulse
36) The polarities in NRZ format use
a. Complete pulse duration
b. Half duration
c. Both positive as well as negative value
d. Each pulse is used for twice the duration
ANSWER: (a) Complete pulse duration
37) The format in which the positive half interval pulse is followed by a negative half interval pulse for
transmission of ‘1’ is
a. Polar NRZ format
b. Bipolar NRZ format
c. Manchester format
d. None of the above
ANSWER: (c) Manchester format
38) The maximum synchronizing capability in coding techniques is present in
a. Manchester format
b. Polar NRZ
c. Polar RZ
d. Polar quaternary NRZ
ANSWER: (a) Manchester format
39) The advantage of using Manchester format of coding is
a. Power saving
b. Polarity sense at the receiver
c. Noise immunity
d. None of the above
ANSWER: (a) Power saving
40) Alternate Mark Inversion (AMI) is also known as
a. Pseudo ternary coding
b. Manchester coding
c. Polar NRZ format
d. None of the above
ANSWER:(a) Pseudo ternary coding
41) In DPSK technique, the technique used to encode bits is
a. AMI
b. Differential code
c. Uni polar RZ format
d. Manchester format
 DIGITAL COMMUNICATION

ANSWER: (b)Differential code

42) The channel capacity according to Shannon’s equation is
a. Maximum error free communication
b. Defined for optimum system
c. Information transmitted
d. All of the above
ANSWER: (d) All of the above
43) For a binary symmetric channel, the random bits are given as
a. Logic 1 given by probability P and logic 0 by (1-P)
b. Logic 1 given by probability 1-P and logic 0 by P
c. Logic 1 given by probability P2 and logic 0 by 1-P
d. Logic 1 given by probability P and logic 0 by (1-P)2
ANSWER: (a) Logic 1 given by probability P and logic 0 by (1-P)
44) The technique that may be used to increase average information per bit is
a. Shannon-Fano algorithm
b. ASK
c. FSK
d. Digital modulation techniques
ANSWER: (a) Shannon-Fano algorithm
45) Code rate r, k information bits and n as total bits, is defined as
a. r = k/n
b. k = n/r
c. r = k * n
d. n = r * k
ANSWER: (a) r = k/n
46) The information rate R for given average information H= 2.0 for analog signal band limited to B Hz is
a. 8 B bits/sec
b. 4 B bits/sec
c. 2 B bits/sec
d. 16 B bits/sec
ANSWER:(b) 4 B bits/sec
47) Information rate is defined as
a. Information per unit time
b. Average number of bits of information per second
c. rH
d. All of the above
ANSWER: (d) All of the above
48) The mutual information
a. Is symmetric
b. Always non negative
c. Both a and b are correct
d. None of the above
 DIGITAL COMMUNICATION

ANSWER: (c) Both a and b are correct

49) The relation between entropy and mutual information is
a. I(X;Y) = H(X) – H(X/Y)
b. I(X;Y) = H(X/Y) – H(Y/X)
c. I(X;Y) = H(X) – H(Y)
d. I(X;Y) = H(Y) – H(X)
ANSWER:(a) I(X;Y) = H(X) – H(X/Y)
50) Entropy is
a. Average information per message
b. Information in a signal
c. Amplitude of signal
d. All of the above
ANSWER: (a) Average information per message
51) The memory less source refers to
a. No previous information
b. No message storage
c. Emitted message is independent of previous message
d. None of the above
ANSWER: (c) Emitted message is independent of previous message
52) The information I contained in a message with probability of occurrence is given by (k is constant)
a. I = k log21/P
b. I = k log2P
c. I = k log21/2P
d. I = k log21/P2
ANSWER:(a) I = k log21/P
53) The expected information contained in a message is called
a. Entropy
b. Efficiency
c. Coded signal
d. None of the above
ANSWER: (a) Entropy
54) Overhead bits are
a. Framing and synchronizing bits
b. Data due to noise
c. Encoded bits
d. None of the above
ANSWER: (a) Framing and synchronizing bits
55) ISI may be removed by using
a. Differential coding
b. Manchester coding
c. Polar NRZ
d. None of the above
 DIGITAL COMMUNICATION

ANSWER: (a) Differential coding

56) Timing jitter is
a. Change in amplitude
b. Change in frequency
c. Deviation in location of the pulses
d. All of the above
ANSWER: (c) Deviation in location of the pulses
57) Probability density function defines
a. Amplitudes of random noise
b. Density of signal
c. Probability of error
d. All of the above
ANSWER: (a) Amplitudes of random noise
58) Impulse noise is caused due to
a. Switching transients
b. Lightening strikes
c. Power line load switching
d. All of the above
ANSWER: (d) All of the above
59) In coherent detection of signals,
a. Local carrier is generated
b. Carrier of frequency and phase as same as transmitted carrier is generated
c. The carrier is in synchronization with modulated carrier
d. All of the above
ANSWER: (d) All of the above
60) Synchronization of signals is done using
a. Pilot clock
b. Extracting timing information from the received signal
c. Transmitter and receiver connected to master timing source
d. All of the above
ANSWER:(d) All of the above
61) Graphical representation of linear block code is known as
a. Pi graph
b. Matrix
c. Tanner graph
d. None of the above
ANSWER: (c) Tanner graph
62) A linear code
a. Sum of code words is also a code word
b. All-zero code word is a code word
c. Minimum hamming distance between two code words is equal to weight of any non zero code word
d. All of the above
 DIGITAL COMMUNICATION

ANSWER: (d) All of the above

63) For decoding in convolution coding, in a code tree,
a. Diverge upward when a bit is 0 and diverge downward when the bit is 1
b. Diverge downward when a bit is 0 and diverge upward when the bit is 1
c. Diverge left when a bit is 0 and diverge right when the bit is 1
d. Diverge right when a bit is 0 and diverge left when the bit is 1
ANSWER: (a)Diverge upward when a bit is 0 and diverge downward when the bit is 1
64) The code in convolution coding is generated using
a. EX-OR logic
b. AND logic
c. OR logic
d. None of the above
ANSWER: (a) EX-OR logic
65) Interleaving process permits a burst of B bits, with l as consecutive code bits and t errors when
a. B ≤ 2tl
b. B ≥ tl
c. B ≤ tl/2
d. B ≤ tl
ANSWER: (d) B ≤ tl
66) For a (7, 4) block code, 7 is the total number of bits and 4 is the number of
a. Information bits
b. Redundant bits
c. Total bits- information bits
d. None of the above
ANSWER: (a) Information bits
67) Parity bit coding may not be used for
a. Error in more than single bit
b. Which bit is in error
c. Both a & b
d. None of the above
ANSWER: (c) Both a & b
68) Parity check bit coding is used for
a. Error correction
b. Error detection
c. Error correction and detection
d. None of the above
ANSWER: (b) Error detection
69) For hamming distance dmin and t errors in the received word, the condition to be able to correct the errors is
a. 2t + 1 ≤ dmin
b. 2t + 2 ≤ dmin
c. 2t + 1 ≤ 2dmin
d. Both a and b
 DIGITAL COMMUNICATION

ANSWER: (d) Both a and b

70) For hamming distance dmin and number of errors D, the condition for receiving invalid codeword is
a. D ≤ dmin + 1
b. D ≤ dmin – 1
c. D ≤ 1 – dmin
d. D ≤ dmin
ANSWER:(b) D ≤ dmin – 1
71) Run Length Encoding is used for
a. Reducing the repeated string of characters
b. Bit error correction
c. Correction of error in multiple bits
d. All of the above
ANSWER: (a) Reducing the repeated string of characters
72) The prefix code is also known as
a. Instantaneous code
b. Block code
c. Convolutional code
d. Parity bit
ANSWER: (a) Instantaneous code
73) The minimum distance for unextended Golay code is
a. 8
b. 9
c. 7
d. 6
ANSWER: (c) 7
74) The Golay code (23,12) is a codeword of length 23 which may correct
a. 2 errors
b. 3 errors
c. 5 errors
d. 8 errors
ANSWER: (b) 3 errors
75) Orthogonality of two codes means
a. The integrated product of two different code words is zero
b. The integrated product of two different code words is one
c. The integrated product of two same code words is zero
d. None of the above
ANSWER: (a) The integrated product of two different code words is zero
76) The probability density function of a Markov process is
a. p(x1,x2,x3…….xn) = p(x1)p(x2/x1)p(x3/x2)…….p(xn/xn-1)
b. p(x1,x2,x3…….xn) = p(x1)p(x1/x2)p(x2/x3)…….p(xn-1/xn)
c. p(x1,x2,x3……xn) = p(x1)p(x2)p(x3)…….p(xn)
d. p(x1,x2,x3……xn) = p(x1)p(x2 * x1)p(x3 * x2)……..p(xn * xn-1)
 DIGITAL COMMUNICATION

ANSWER:(a) p(x1,x2,x3…….xn) = p(x1)p(x2/x1)p(x3/x2)…….p(xn/xn-1)

77) The capacity of Gaussian channel is
a. C = 2B(1+S/N) bits/s
b. C = B2(1+S/N) bits/s
c. C = B(1+S/N) bits/s
d. C = B(1+S/N)2 bits/s
ANSWER: (c) C = B(1+S/N) bits/s
78) For M equally likely messages, the average amount of information H is
a. H = log10M
b. H = log2M
c. H = log10M2
d. H = 2log10M
ANSWER:(b) H = log2M
79) The channel capacity is
a. The maximum information transmitted by one symbol over the channel
b. Information contained in a signal
c. The amplitude of the modulated signal
d. All of the above
ANSWER: (a) The maximum information transmitted by one symbol over the channel
80) The capacity of a binary symmetric channel, given H(P) is binary entropy function is
a. 1 – H(P)
b. H(P) – 1
c. 1 – H(P)2
d. H(P)2 – 1
ANSWER:(a) 1 – H(P)
81) According to Shannon Hartley theorem,
a. The channel capacity becomes infinite with infinite bandwidth
b. The channel capacity does not become infinite with infinite bandwidth
c. Has a tradeoff between bandwidth and Signal to noise ratio
d. Both b and c are correct
ANSWER: (d) Both b and c are correct
82) The negative statement for Shannon’s theorem states that
a. If R > C, the error probability increases towards Unity
b. If R < C, the error probability is very small
c. Both a & b
d. None of the above
ANSWER: (a) If R > C, the error probability increases towards Unity
83) For M equally likely messages, M>>1, if the rate of information R ≤ C, the probability of error is
a. Arbitrarily small
b. Close to unity
c. Not predictable
d. Unknown
 DIGITAL COMMUNICATION

ANSWER: (a) Arbitrarily small

84) For M equally likely messages, M>>1, if the rate of information R > C, the probability of error is
a. Arbitrarily small
b. Close to unity
c. Not predictable
d. Unknown
ANSWER: (b) Close to unity
85) In Alternate Mark Inversion (AMI) is
a. 0 is encoded as positive pulse and 1 is encoded as negative pulse
b. 0 is encoded as no pulse and 1 is encoded as negative pulse
c. 0 is encoded as negative pulse and 1 is encoded as positive pulse
d. 0 is encoded as no pulse and 1 is encoded as positive or negative pulse
ANSWER: (b) 0 is encoded as no pulse and 1 is encoded as positive or negative pulse
86) Advantages of using AMI
a. Needs least power as due to opposite polarity
b. Prevents build-up of DC
c. May be used for longer distance
d. All of the above
ANSWER: (d)All of the above
87) The interference caused by the adjacent pulses in digital transmission is called
a. Inter symbol interference
b. White noise
c. Image frequency interference
d. Transit time noise
ANSWER: (a) Inter symbol interference
88) Eye pattern is
a. Is used to study ISI
b. May be seen on CRO
c. Resembles the shape of human eye
d. All of the above
ANSWER: (d) All of the above
89) The time interval over which the received signal may be sampled without error may be explained by
a. Width of eye opening of eye pattern
b. Rate of closure of eye of eye pattern
c. Height of the eye opening of eye pattern
d. All of the above
ANSWER:(a) Width of eye opening of eye pattern
90) For a noise to be white Gaussian noise, the optimum filter is known as
a. Low pass filter
b. Base band filter
c. Matched filter
d. Bessel filter
 DIGITAL COMMUNICATION

ANSWER:(c) Matched filter

91) Matched filters are used
a. For maximizing signal to noise ratio
b. For signal detection
c. In radar
d. All of the above
ANSWER: (d) All of the above
92) The number of bits of data transmitted per second is called
a. Data signaling rate
b. Modulation rate
c. Coding
d. None of the above
ANSWER: (a) Data signaling rate
93) Pulse shaping is done
a. to control Inter Symbol Interference
b. by limiting the bandwidth of transmission
c. after line coding and modulation of signal
d. All of the above
ANSWER: (d) All of the above
94) The criterion used for pulse shaping to avoid ISI is
a. Nyquist criterion
b. Quantization
c. Sample and hold
d. PLL
ANSWER: (a) Nyquist criterion
95) The filter used for pulse shaping is
a. Raised – cosine filter
b. Sinc shaped filter
c. Gaussian filter
d. All of the above
ANSWER: (d) All of the above
96) Roll – off factor is defined as
a. The bandwidth occupied beyond the Nyquist Bandwidth of the filter
b. The performance of the filter or device
c. Aliasing effect
d. None of the above
ANSWER: (a) The bandwidth occupied beyond the Nyquist Bandwidth of the filter
97) Nyquist criterion helps in
a. Transmitting the signal without ISI
b. Reduction in transmission bandwidth
c. Increase in transmission bandwidth
d. Both a and b
 DIGITAL COMMUNICATION

ANSWER: (d) Both a and b

98) The Nyquist theorem is
a. Relates the conditions in time domain and frequency domain
b. Helps in quantization
c. Limits the bandwidth requirement
d. Both a and c
ANSWER: (d) Both a and c
99) The difficulty in achieving the Nyquist criterion for system design is
a. There are abrupt transitions obtained at edges of the bands
b. Bandwidth criterion is not easily achieved
c. Filters are not available
d. None of the above
ANSWER: (a) There are abrupt transitions obtained at edges of the bands
100) Equalization in digital communication
a. Reduces inter symbol interference
b. Removes distortion caused due to channel
c. Is done using linear filters
d. All of the above
ANSWER: (d) All of the above
101) Zero forced equalizers are used for
a. Reducing ISI to zero
b. Sampling
c. Quantization
d. None of the abov
ANSWER: (a)Reducing ISI to zero
102) The transmission bandwidth of the raised cosine spectrum is given by
a. Bt = 2w(1 + α)
b. Bt = w(1 + α)
c. Bt = 2w(1 + 2α)
d. Bt = 2w(2 + α)
ANSWER: (a) Bt = 2w(1 + α)
103) The preferred orthogonalization process for its numerical stability is
a. Gram- Schmidt process
b. House holder transformation
c. Optimization
d. All of the above
ANSWER: (b) House holder transformation
104) For two vectors to be orthonormal, the vectors are also said to be orthogonal. The reverse of the same
a. Is true
b. Is not true
c. Is not predictable
d. None of the above
 DIGITAL COMMUNICATION

ANSWER: (b) Is not true

105) Orthonormal set is a set of all vectors that are
a. Mutually orthonormal and are of unit length
b. Mutually orthonormal and of null length
c. Both a & b
d. None of the above
ANSWER: (a) Mutually orthonormal and are of unit length
106) In On-Off keying, the carrier signal is transmitted with signal value ‘1’ and ‘0’ indicates
a. No carrier
b. Half the carrier amplitude
c. Amplitude of modulating signal
d. None of the above
ANSWER: (a) No carrier
107) ASK modulated signal has the bandwidth
a. Same as the bandwidth of baseband signal
b. Half the bandwidth of baseband signal
c. Double the bandwidth of baseband signal
d. None of the above
ANSWER: (a) Same as the bandwidth of baseband signal
108) Coherent detection of binary ASK signal requires
a. Phase synchronization
b. Timing synchronization
c. Amplitude synchronization
d. Both a and b
ANSWER: (d) Both a and b
109) The probability of error of DPSK is ______________ than that of BPSK.
a. Higher
b. Lower
c. Same
d. Not predictable
ANSWER: (a) Higher
110) In Binary Phase Shift Keying system, the binary symbols 1 and 0 are represented by carrier with phase shift
of
a. Π/2
b. Π
c. 2Π
d. 0
ANSWER: (b) Π
111) BPSK system modulates at the rate of
a. 1 bit/ symbol
b. 2 bit/ symbol
 DIGITAL COMMUNICATION

c. 4 bit/ symbol
d. None of the above
ANSWER: (a) 1 bit/ symbol
112) The BPSK signal has +V volts and -V volts respectively to represent
a. 1 and 0 logic levels
b. 11 and 00 logic levels
c. 10 and 01 logic levels
d. 00 and 11 logic levels
ANSWER: (a) 1 and 0 logic levels
113) The binary waveform used to generate BPSK signal is encoded in
a. Bipolar NRZ format
b. Manchester coding
c. Differential coding
d. None of the above
ANSWER: (a) Bipolar NRZ format
114) The bandwidth of BFSK is ______________ than BPSK.
a. Lower
b. Same
c. Higher
d. Not predictable
ANSWER: (c) Higher
115) In Binary FSK, mark and space respectively represent
a. 1 and 0
b. 0 and 1
c. 11 and 00
d. 00 and 11
ANSWER: (a) 1 and 0
116) The frequency shifts in the BFSK usually lies in the range
a. 50 to 1000 Hz
b. 100 to 2000 Hz
c. 200 to 500 Hz
d. 500 to 10 Hz
ANSWER: (a) 50 to 1000 Hz
117) The spectrum of BFSK may be viewed as the sum of
a. Two ASK spectra
b. Two PSK spectra
c. Two FSK spectra
d. None of the above
ANSWER: (a) Two ASK spectra
118) The maximum bandwidth is occupied by
a. ASK
b. BPSK
 DIGITAL COMMUNICATION

c. FSK
d. None of the above
ANSWER: (c) FSK
119) QPSK is a modulation scheme where each symbol consists of
a. 4 bits
b. 2 bits
c. 1 bits
d. M number of bits, depending upon the requireme
ANSWER: (b) 2 bits
120) The data rate of QPSK is ___________ of BPSK.
a. Thrice
b. Four times
c. Twice
d. Same
ANSWER: (c) Twice
121) QPSK system uses a phase shift of
a. Π
b. Π/2
c. Π/4
d. 2Π
ANSWER: (b) Π/2
122) Minimum shift keying is similar to
a. Continuous phase frequency shift keying
b. Binary phase shift keying
c. Binary frequency shift keying
d. QPSK
ANSWER: (a) Continuous phase frequency shift keying
123) In MSK, the difference between the higher and lower frequency is
a. Same as the bit rate
b. Half of the bit rate
c. Twice of the bit rate
d. Four time the bit rate
ANSWER: (b) Half of the bit rate
124) The technique that may be used to reduce the side band power is
a. MSK
b. BPSK
c. Gaussian minimum shift keying
d. BFSK
ANSWER: (c) Gaussian minimum shift keying
 DIGITAL COMMUNICATION

REVIEW QUESTIONS
DESCRIPTIVE TYPE QUESTION
UNIT-I
1. Describe with a neat block diagram the operation of a continuously variable slope delta modulator
(ADM).
2. Compare Delta modulation with Pulse code modulation technique
3. State and prove the sampling theorem for low pass signals.
4. A signal m ( t ) = cos ( 200p t ) + 2 cos ( 320p t ) is ideally sampled at fS = 300Hz. If the sampled
signal is passed through a low pass filter with a cutoff frequency of 250Hz. What frequency
components will appear in the output?
5. With a neat sketch explain the basic elements of a digital communication system.& List the
advantages and disadvantages of PCM.
6. Explain about Non uniform Quantization
7. a). Explain about Differential PCM and compare with PCM
b) . Explain about Quantization noise in PCM
8. A DM system is designed to operate at three times the Nyquist rate for a signal with 3 kHz
bandwidth. The quantizing step size is 250 mV.
a. Determine the maximum amplitude of a 1 kHz input sinusoid for which the delta modulator does
not show slope overload.
b. Determine the post filtered output SNR for the signal of part (i).
9. Describe about Detla modulation and demodulation.
10. a) Draw the block diagram and explain Digital communication system.
b) Describe the advantages of Digital communication system
11. Draw the block diagram of PCM and explain
12. a) Represent the data 110101 in all the encoding formats
b). what are the functions of regenerative repeaters.
II UNIT

13. Explain Shannon-Fano algorithm and Huffman coding with an example.

14. Explain the capacity of a Gaussian channel
15. Explain the Mutual Information and it’s properties
16. 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
17. a)what is the information rate?
b)An event has 6 possible outcomes with the probabilities p1=1/2, p2=1/4,p3=1/8, p4=1/16, p5=
p6=1/32.Find entropy of the system and also find rate of information if there are 6 outcomes.
18. a) Evaluate the relation H(X Y)=H(Y/X)+H(X).
b) Evaluate conditional entropies.
19. A Discrete source transmitter’s messages x1,x2,x3 with probabilities 0.3,0.4,0.3.calculate all
the entropies.
 DIGITAL COMMUNICATION

20. Transmitter has an alphabet at 4 letters x1,x2,x3,x4 and receiver has an alphabet at these

letters y1,y2,y3.The joint probability matrix is P(X Y)=

Find I(X Y).
21. .Describe the trade off between bandwidth and S/N ratio
22. A DMS has 5 equally likely symbols.
(a) Construct a Shannon-Fano code for X and calculate the efficiency of the code.
(b) Construct Huffman code for X and calculate the efficiency of the code.

23. Write notes on (a) Binary symmetric channel (b) Binary Communication Channel (c)
Cascaded Channel.
24. Write notes on (a) Binary erasure channel (b) noise free channel (c) non-symmetric channel
(d) repitition channels.
25. Explain matrix description of linear block codes
26. 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, d3and 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.
27. Discuss the performance of convolution codes
28. Explain about Decoding using Viterbi algorithm with an example.
29. A Convolution encoder is described by the polynomial g1(x)=1+x+x 2,g2(x)=x+x2 for the
message i/p 1010 draw state diagram,tree,trellis.
30. A (15,5) Linear Cyclic codes has a g(x)=1+x+x2+x4+x5+x8+x10 draw the encoder find the code
vector for D(x)=1+x+x2
31. Construct a (7,4)systematic & nonsystematic code word for
2 3
m=1101,g(x)=1+x+x +x and calculate the syndrome for R=010101 1
32. Consider a (6,3) Generator matrix
1 0 0 0 1 1
G= 0 1 0 1 0 1
0 0 1 1 1 0

i. Find all the code vectors.

33. consider (6,3) generated by
1 0 0 0 1 1
 DIGITAL COMMUNICATION

G= 0 1 0 1 0 1
0 0 1 1 1 0
(i) Find all the code vectors
(ii) Check whether the generated code for 110 is correct or not
34. A(15,5) linear cyclic code has a generator g(x)=1+x+x2+ x4+x5+x8+x10
a)Draw the block diagram of encoder and syndrome calculator for this code.
b)Find the code polynomial for the message polynomial(X)=1+ x2+ x4
35. Explain about block codes in which each block of k message bits encoded into block of n>k
bits with an example
36. The generated polynomial of(7,4) cyclic code is g(x)=1+ x2+ x3.find the code words for the
1101,1110 in systematic form and non systematic form.
37. Design an encoder for (7,4) binary cyclic code generated by g(x)= 1+x+x 2+ x3& verify its
operation using message vector 1010.
38. Design a syndrome calculator for (7,4) binary cyclic code generated by g(x)= 1+x+
x3.calculate the syndrome for R=1001010.
39. Encode the input sequence 1101 with encoding methods of convolution code

III UNIT
40. With a neat sketch explain the QPSK transmitter and Receiver
41. Calculate the error probability for QPSK and PSK
42. Discuss in brief about matched filter
43. Explain ASK Modulator, Coherent ASK and Non-Coherent Detector and .Calculate the error
probability for ASK
44. What is FSK, draw the Frequency Spectrum of FSK.
45. Explain about coherent and Non coherent FSK Detection,
46. With an example explain Differential PSK.
47. Write the comparisons among ASK, PSK, FSK and DPSK
48. Explain about PSK Calculate the error probability for PSK
49. Explain about the optimum filters.
50. Explain about Transmitter and receiver of DEPSK
51. Calculate the error probability for FSK
52. Describe integrate and dump receiver.
53. Describe about coherent reception and matched filter.

V UNIT
54. Describe about Code Division Multiple Access, List all the applications of Spread Spectrum
55. Describe Frequency Hopping Spread in detail.
56. Describe PN – sequences: Generation with an example.
57. Describe Synchronization in Direct Sequence Spread Spectrum Systems
58. Explain Synchronization in Frequency Hopping Spread Spectrum Systems
59. Describe about Direct Sequence Spread Spectrum (DSSS)
60. Give an example of DSSS and explain in detail..

SHORT QUESTIONS
I UNIT
1. Define sampling theorem.
 DIGITAL COMMUNICATION

2. Describe quantization in PCM.

3. What is the advantage in of non uniform quantization.
4. Describe the laws in non uniform quantization.
5. What is quantization noise in PCM.
6. If S/N in db is 48.find the no of bits needed to represent the message.
7. Draw the Transmitter and receiver of DPCM.
8. What is DPCM.
9. What is the advantage of DPCM.
10. Describe DM
11. Describe quantization Noise in DM
12. Describe Different types of noise in DM
13. What is ADM.
14. Represent the data 110101 in RZ and NRZ format.
15. Represent the data 101010 in bipolar signaling and split phase signaling.
16. Draw the block diagram of PCM.
17. Draw the block diagram of Digital communication system.
18. Describe the advantages of Digital communication system
19. What are the functions of regenerative repeaters
20. What is companding.
21. Draw the input and output characteristics of compressor.
22. What is the bandwidth requirement of PCM.
23. Consider a speech signal with maximum frequency of 3.4KHZ& maximum amplitude of
1V.This signal is applied to a DM whose bit tate is set at 20Kbps.Discuss the choice of stepsize for
the modulator.
24. Draw the modulator of ADM.
25. What is prediction filter.
II UNIT

26. Describe Information theory

27. What is Entropy.
28. Discuss the properties of Entropy.
29. Describe Information Rate.
30. An event has 4 possible outcomes with p1=0.5,p2=0.125,p3=0.125,p4=0.25.Find the Entropy
of the system.
31. Evaluate joint entropy.
32. Evaluate conditional entropy
33. Describe Mutual Information.
34. Discuss the properties of Mutual Information.
35. Describe Channel capacity.
36. Describe Channel capacity of noise free channels
37. Describe symmetric channels
38. Describe Channel capacity of Binary symmetric channels
39. Explain the relation between bandwidth and S/N ratio
40. A Gaussian channel has 2MHZ Bandwidth.calculate the Channel capacity if signal power to
noise spectral density ratiois 106HZ also find the maximum information rate.
41. What is Source coding theorem.
42. What is shannons 2nd theorem
43. Describe shannonsHartely theorem.
44. Describe Binary Erasure channels
45. Describe Repitition of signals

46. Draw the block diagram of error control coding.

 DIGITAL COMMUNICATION

47. Describe the types of codes.

48. Describe the types of errors.
49. Describe methods of controlling errors.
50. Design an encoder for (7,4) binary cyclic code generated by g(x)= 1+ x2+ x3
51. . Design a syndrome calculator for (6,3) binary cyclic code generated by g(x)= 1+x+ x2
52. Encode the input sequence 101 by tree diagram with g(x)= 1+ x+ x2
53. Encode the input sequence 111 by state diagram. with g(x)= 1+ x+ x2
54. Encode the input sequence 110 by trellis diagram. with g(x)= 1+ x+ x2
55. Describe veterbi algorithm for 101 for g(x)= 1+ x+ x2
56. The generated polynomial of(7,4) cyclic code is g(x)=1+ x2+ x3.find the code words for the
1001 in systematic form.
57. The generated polynomial of(7,4) cyclic code is g(x)=1+ x+ x3.find the code words for
the1010 in non systematic form
58. The generated polynomial of(6,3) cyclic code is g(x)=1+ x+ x3.find the code words for the
0101 in systematic form.
59. The generated polynomial of(7,4) cyclic code is g(x)=1+ x2+ x3.find the code words for
the1100 in non systematic form

III UNIT
60. What is optimum filter.
61. What is matched filter.
62. What is the probability of error of matched filter
63. What is the probability of error of ASK
64. What is the probability of error of PSK
65. What is the probability of error of FSK
66. What is the probability of error of QPSK
67. Describe coherent detection of ASK
68. Describe non coherent detection of ASK
69. Describe coherent detection of PSK
70. Describe coherent detection of FSK
71. Describe non coherent detection of FSK
72. Draw the block diagram of QPSK transmitter.
73. Draw the block diagram of QPSK receiver.
74. Draw the spectrum of PSK and what is its bandwidth.
75. Draw the spectrum of FSK and what is its bandwidth
76. Represent 1010110 in ASK,PSK,FSK
77. Describe the application of ASK
78. Describe the application of PSK
79. Describe the application of FSK
80. Describe the application of QPSK
81. Describe DPSK transmitter
82. Describe DEPSK
83. What is QAM
84. Draw the signal space diagram of QAM.

V UNIT
85. Describe Spread spectrum modulation.
86. Discuss the application of Spread spectrum modulation
87. Discuss the advantages of Spread spectrum modulation
88. Describe Direct sequence Spread spectrum modulation
89. Describe Frequency Hopping Spread spectrum modulation
90. Discuss Code division multiple acess.
 DIGITAL COMMUNICATION

91. Discuss the application of Direct sequence Spread spectrum modulation

92. Discuss Near far problem.
93. Draw the spectrum of FHSS
94. Describe the generation of PN sequence.
95. Discuss the characteristics of PN sequence.
96. Describe the synchronization in FH Signals.
97. Describe the synchronization in DSSS Signals.
98. Discuss Clustering in a PN sequence.
99. Discuss number of one’s and zero’s in PN sequence
100. What is maximum sequence of length in PN sequence

Code No: 126AN R13

 DIGITAL COMMUNICATION

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B.Tech III Year II Semester Examinations, May - 2016
DIGITAL COMMUNICATIONS
(Electronics and Communication Engineering)
Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B
consists of 5 Units. Answer any one full question from each unit. Each question carries
10 marks and may have a, b, c as sub questions.

PART - A (25 Marks)

1.a) What are the drawbacks of delta modulation? [2]

b) Explain the need for non-uniform quantization in digital communication. [3]
c) Draw the Signal space Diagram of ASK. [2]
d) List out the Advantages of Pass band Transmission over Baseband transmission. [3]
e) Define Entropy. [2]
f) Derive the Expression for the Information Rate. [3]
g) Explain in one sentence about (i) Block Size (ii) Linear block codes. [2]
h) List out Properties of Cyclic Codes. [3]
i) Briefly explain about “Spread spectrum.” [2]
j) What is Frequency hopping spread spectrum? [3]

PART - B (50 Marks)

2.a) With neat block diagram, Explain the process of Sampling and Quantization in digital
communication.
b) Derive the expression for the Quantization error. [5+5]
OR
3.a) Explain about the noise in PCM systems.
b) Write the comparison between PCM and Analog modulation techniques. [5+5]

4.a) With neat diagrams and equations, explain about PSK system.
b) Draw the space representation of BPSK. And also draw its waveforms? [5+5]
OR
5.a) The bit stream 1011100011 is to be transmitted using DPSK. Determine the encoded
sequence and transmitted phase sequence.
6. Explain about DPSK system. And also give the comparison between DPSK and PSK. [5+5]

6.a) What is the need of pulse shaping for optimum transmission in baseband transmission?

Explain.

b) What is meant by Cross talk? Explain in detail about the causes for cross talk. [5+5]

OR
7.a) Briefly explain about Variable length coding.

b) Explain in detail about Huffman coding and Lossy source code.

8.a) Write short notes on Hamming codes.

 DIGITAL COMMUNICATION

b) Explain about Error detection and Correction capabilities of Hamming codes. [5+5]
OR
9.a) Explain how Parity checking can be used for error detection or error correction.
For a linear block code, prove with example that:
i) The Syndrome depends only on error pattern and not on transmitted code word?
ii) All error patterns that differ by a codeword have the same syndrome? [5+5]

10.a) Explain the role of code division multiple access technique in present generation?
b) Give a brief history about direct sequence spread spectrum. [5+5]
OR
11.a) Explain about PN-Sequences generation and their characteristics. [5+5]
15. What is meant by Synchronization? Why we require synchronization in spread spectrum? Explain in
detail.
 DIGITAL COMMUNICATION

R13

Code No: 126AN

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B.Tech III Year II Semester Examinations, October/November-2016

DIGITAL COMMUNICATIONS

Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B

consists of 5 Units. Answer any one full question from each unit. Each question carries

10 marks and may have a, b, c as sub questions.

(Electronics and Communication Engineering)

PART - A (25 Marks)

1.a) Compare PCM and DM. [2]

b) Write the advantages of digital communication. [3]

c) Define QPSK. [2]

d) Draw the block diagram of the PLL. [3]

e) Define Baseband transmission. [2]

f) Define conditional entropy. [3]

g) Mention the properties of cyclic code. [2]

h) Write the advantages of convolution codes. [3]

i) List out the applications of CDMA. [2]

j) Define spread spectrum. List its uses. [3]

PART - B (50 Marks)

2.a) What is Hartley Shannon law? And explain sampling theorem.

b) With a neat sketch describe ADPCM concept. [5+5]

OR

3.a) Explain the tradeoff between bandwidth and signal to noise ratio.
b) Distinguish between analog communication and digital [5+5]
 DIGITAL COMMUNICATION

communication.

4.a) Draw and explain the operating principle of ASK Modulator.

Describe the BPSK modulation technique with the help of a neat
b) diagram. [5+5]

OR
Explain the DPSK modulation technique with the help of a neat
5.a) sketch.

b) Explain the working of non-coherent FSK detector. [5+5]

Draw and explain the working of optimum receiver with a neat
6.a) diagram.

b) Define eye diagram. Draw the eye diagram for FSK. [5+5]

OR

7.a) Explain Huffman coding with an example.

b) Explain crosstalk concept. [5+5]

8.a) Describe the algebraic structure of cyclic codes.

b) Explain how to encode cyclic codes. [5+5]

OR

9.a) Give the matrix description for linear block codes.

b) Decode convolution process using viterbi algorithm. [5+5]

10.a) What are the characteristics of PN sequences? Explain

b) Describe the process of code division multiple access in detail. [5+5]

OR

11.a) Describe with a neat sketch the direct sequence Spread spectrum technique.

b) Describe the concept of Ranging using DSSS. [5+5]

 DIGITAL COMMUNICATION

R13

Code No: 126AN

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B. Tech III Year II Semester Examinations, May - 2017

DIGITAL COMMUNICATIONS
(Electronics and Communication Engineering)

Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B

consists of 5 Units. Answer any one full question from each unit. Each question carries

10 marks and may have a, b, c as sub questions.

(Electronics and Communication Engineering)

PART - A (25 Marks)

 DIGITAL COMMUNICATION

1.a) Compare the performance of PCM and DM system. [2]

b) What is slope overload distortion? Explain. [3]

c) Write the expression for baud rate of BPSK system. [2]

d) Explain advantages of coherent digital modulation schemes. [3]

f) Define entropy and conditional entropy. [3]

g) Define code rate of block code. [2]

Mention various types of errors caused by noise in communication
h) channel. [3]

i) Define processing gain and jamming margin [2]

j) Explain the generation of PN sequence. [3]

PART - B (50 Marks)

2.a) A voice frequency signal band limited to 3kHz is transmitted with the use of the DM

system. The pulse repetition frequency is 30,000 pulses per second, and the step size is

40mV. Determine the permissible speech signal amplitude to avoid slope overload.

b) Derive the expression for overall SNR in a ADM system. [5+5]

OR

3.a) In a binary PCM system, the output signal to quantizing noise ratio is to be held to a

minimum of 40dB. Determine the number of required levels and find the corresponding

output signal to quantization noise ratio.

b) Explain the modulation and demodulation procedure in DPCM system. [5+5]

4.a) Explain frequency shift keying. Describe coherent detection of FSK signals. What

should be the relationship between bit-rate and frequency-shift for a better

performance?
6. Explain non coherent detection method of binary frequency shift keying scheme. [5+5]

OR
5.a) Explain coherent detection of PSK signals and derive probability of error.
b) Differentiate coherent and non-coherent detection techniques. [5+5]
6.a) Derive the bit error probability of a coherent ASK signaling scheme.
3. Apply Shannon-Fano coding procedure of M=2 and M=3 [x]=[x1, x2, x3, x4, x5, x6, x7,
x8] with probability [P]=[1/4, 1/8, 1/16, 1/16, 1/4, 1/16, 1/8 ,1/16]. [5+5]
OR
7.a) Compare code efficiency of Shanon Fano coding and Huffman coding when five source
messages have probabilities m1=0.4, m2=0.15, m3=0.15, m4=0.15, m5=0.15.
b) Obtain the probability of bit error for coherently detected BPSK. [5+5]
 DIGITAL COMMUNICATION

8.a) We transmit either a 1 or a 0, and add redundancy by repeating the bit. (i) Show that if
we transmit 11111 or 00000, then 2 errors can be corrected. (ii) Show that in general if
we transmit the same bit 2t+1 times we can correct upto t errors.
b) What are code tree, code trellis and state diagrams for convolution encoders? [5+5]
OR
9.a) Design the encoder for the (7, 4) cyclic code generated by G(p)=p 3+p2+1 and also
verify the operation for any message vector.

16. Derive the steps involved in generation of linear block codes. Define and explain the
properties of syndrome. [6+4]

10.a) Derive the necessity of DSSS techniques. Draw the transmitter and receiver block
diagram and explain.
b) Write a note on CDMA. [6+4]
OR
11.a) Explain the advantages and applications of spread spectrum modulation.
b) Discuss the frequency hopping spread spectrum technique in detail. [4+6]