DEPARTMENT OF ELECTRONICS AND COMMUNICATION

ENGINEERING

B.E. Electronics and Communication Engineering

Anna University Regulation: 2021

EC3491 –COMMUNICATION SYSTEMS

II Year / IV Semester

Question Bank

Unit – III
DIGITAL TECHNIQUES

UNIT III DIGITAL TECHNIQUES

1. Mention the merits of DPCM.
1 .Bandwidth requirement of DPCM is less compared to PCM.
2. .Quantization error is reduced because of prediction filter
3. .Numbers .of bits used to represent .one sample .value are also reduced compared to PCM.

2. 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.
3. 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.
4. 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
5. What should be the minimum bandwidth required to transmit a
PCM Channel?
The minimum transmission bandwidth in PCM is given as,
BT = vW
Here v is the number of bits used to represent one pulse.
W is the maximum signal frequency.
6. 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.
7. What are the two limitations of delta modulation?
1 Slope of overload distortion.
2. Granular noise.
8. How does Granular noise occurs?
It occurs due to large step size and very small amplitude variation in the input
signal.
9. What are the advantages of the Delta modulation?
1 Delta modulation transmits only one bit for one sample. Thus the signalling rate
and transmission channel bandwidth is quite small for delta modulation.
2. .The .transmitter .and .receiver .implementation .is .very .much .simple .for .delta
modulation. There is no analog to digital converter involved in delta modulation.

\]]]]]NAThe 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.
10. Define code efficiency.
The code efficiency is the ratio of message bits in a block to the transmitted bits for
that block by the encoder i.e., Code efficiency= (k/n)
k=message bits n=transmitted bits.
11. 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.
12. What is meant by linear code?
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.
13. What are the error detection and correction capabilities of hamming co d
es ?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.
14. 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.

15. . 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 H.is thTe transpose of parity check matrix
16. What is BCH code?
BCH .codes .are .most .extensive .and .powerful .error .correcting .cyclic .codes. .The decoding of BCH
codes is comparatively simpler. For any positive integer „m‟ and „t‟ (where t<2 m-1)there exists a BCH
code with following parameters:
Block length: n= 2 m-1
Number of parity check bits : n-k<=mt
Minimum distance: d min>=2t+1
17. What is RS code?
These are non binary BCH codes. The encoder for RS code operates on multiple bits
simultaneously. The (n, k) RS code takes the groups of m- bit symbols of incoming binary data stream. It
takes such „k‟ number of symbols in one block. Then the encoder acts (n – k) redundant symbols to form
the code word of „n‟ symbols
RS code has:
Block Length : n=2.-1msymbols
Message size: K symbols
Parity check size: n-k= 2t symbols
Minimum distance: dmin=2t+a symbols
18. What is difference between block codes and convolutional codes?
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.
19. Define constraint length in convolutional code?
Constraint length is the number of shift over which the single message bit can influence the encoder
output. It is expressed in terms of message bits.
20. 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= (E.b/N.)oencoded (E.b/N.)ocoded
For convolutional coding, the coding gain is given as,
A = rd./f2
Here „r‟ is the code rate
And „df is the free distance.
21. What is convolution 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.
22. What is meant by syndrome of linear block code?
The non zero output of the produce YH.is calleTd syndrome & it is used to detect errors in y. Syndrome
is denoted by S & given as,
S=YH T
23. What are the advantages of convolutional codes?
Advantages:
1 .The decoding delay is small in convolutional codes since they operate o 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.
24. 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. .„S 1‟ represents the input message bit and S.stores the2 previous message bit. .Since only one
previous message bit is stored, .this encoder can have states depending upon this stored message bit.
.Let‟ s represent,
S.2= 0
and S.2= 1 state „b‟
state „a‟
 25. Compare between code tree and trellis diagram?
26. Write the futures of BCH Codes?
BCH codes are most extensive and powerful error correcting
cyclic codes. Thedecoding of BCH codes is comparatively
simpler.

Golay code is the (23,12) cyclic code whose generating polynomial is, G(p) = p.
+1p1.+p.9+p.+7p.+6p+15
This code has minimum distance of d min= 7. This code can correct upto 3 errors. But
Golay code cannotbe generalized to other combinations of n and k.
27. Define constraint length in convolutional codes?
Constraint length is the number of shifts over which the single message bit can
influence the encoderoutput. .This expressed in terms of message bits.

16 MARKS QUESTIONS
1. Consider the (7,4) linear block code with generator matrix
(i) Find all the code vectors.
(ii) Find parity check matrix.
(iii)Minimum weight of this code.

101
2. For a systematic (6, 3) linear block code, P=

011
110 . Analyze all the possible code vectors.

3. (i) Describe the steps involved in the generation of linear block codes.
(ii) Explain the properties of syndrome.
4. Illustrate how the errors are corrected using hamming code with an
example.
5. Explain syndrome decoding and explain its property with
appropriate example.
6. Assume that the code word C=10110 for the (6,3) case is transmitted and (13) BTL 4 Analyzingthe
vector R=001110 is received. Show how a decoder using the syndrome

110100
lookup table can correct the error. Take generator matrix as G=

011010
101001

101100
7. An error control code has the following parity check matrix H=

110010
011001
(i) What is the generator matrix G?
(ii) Find the code word that begins with 101…
(iii) Decode the received code word 110110. Comment on error
correction and detection capability of this code.

CS_3491
8. Explain cyclic codes with the linear and cyclic property. Also represent the cyclic property of a code word in polynomial
notation.

9. Draw the diagram of the ½ rate convolutional encoder with generator polynomials
G1 (D)=1+D
G2 (D)=1+D+D2
And complete the encoder output for input sequence 101101.
10. Find the (7,4) systematic and non-systematic cyclic code words of the message word
1101.Assume the generator polynomial as 1+x2 +x3
11. Determine how Viterbi decoding algorithm is used for convolutional code. (13)

12. Draw the state diagram of rate ½ convolutional encoder given in the figure below.
13. A convolutional code is described by the following generator sequences, g (1)= {1,0,1}, g(2)=
{1,0,0}, g(3) = {1,1,1}.
(i) Draw the encoder to this code
(ii) Draw the state diagram
(iii) If the message sequence is 10110, Design the code word.
14. (i) Compare linear block codes and convolutional codes.
(ii) State the advantages, disadvantages and applications of convolutional codes.