received

d) None of the men oned

EC8501 DIGITAL
Answer: c
COMMUNICATION Explana on: When probability of error
during transmission is 0.5 then the channel is
very noisy and thus no informa on is
received.

4. Binary Huffman coding is a

UNIT I INFORMATION a) Prefix condi on code
THEORY b) Suffix condi on code
c) Prefix & Suffix condi on code
d) None of the men oned
TOPIC 1.1 DISCRETE MEMORYLESS
SOURCE, INFORMATION ENTROPY, Answer: a
MUTUAL INFORMATION AND Explana on: Binary Huffman coding is a
prefix condi on code.
DISCRETE MEMORYLESS CHANNELS
5. The event with minimum probability has
1. Self informa on should be least number of bits.
a) Posi ve a) True
b) Nega ve b) False
c) Posi ve & Nega ve
d) None of the men oned Answer: b
Explana on: In binary Huffman coding the
Answer: a event with maximum probability has least
Explana on: Self informa on is always non number of bits.
nega ve.
6. The method of conver ng a word to
2. The unit of average mutual informa on is stream of bits is called as
a) Bits a) Binary coding
b) Bytes b) Source coding
c) Bits per symbol c) Bit coding
d) Bytes per symbol d) Cipher coding

Answer: a Answer: b
Explana on: The unit of average mutual Explana on: Source coding is the method of
informa on is bits. conver ng a word to stream of bits that is 0’s
and 1’s.
3. When probability of error during
transmission is 0.5, it indicates that 7. When the base of the logarithm is 2, then
a) Channel is very noisy the unit of measure of informa on is
b) No informa on is received a) Bits
c) Channel is very noisy & No informa on is b) Bytes
c) Nats Answer: b
d) None of the men oned Explana on: Encoding block of symbols is
more efficient than encoding each symbol of
Answer: a a block.
Explana on: When the base of the logarithm
is 2 then the unit of measure of informa on 12. Lempel-Ziv algorithm is
is bits. a) Variable to fixed length algorithm
b) Fixed to variable length algorithm
8. When X and Y are sta s cally c) Fixed to fixed length algorithm
independent, then I (x,y) is d) Variable to variable length algorithm
a) 1
b) 0 Answer: a
c) Ln 2 Explana on: Lempel-Ziv algorithm is a
d) Cannot be determined variable to fixed length algorithm.

Answer: b 13. Coded system are inherently capable of

Explana on: When X and Y are sta s cally be er transmission efficiency than the
independent the measure of informa on I uncoded system.
(x,y) is 0. a) True
b) False
9. The self informa on of random variable is
a) 0 Answer: a
b) 1 Explana on: Yes, the coded systems are
c) Infinite capable of be er transmission efficiency than
d) Cannot be determined the uncoded system.

Answer: c
Explana on: The self informa on of a
TOPIC 1.2 BINARY SYMMETRIC
random variable is infinity. CHANNEL

10. Entropy of a random variable is 1. Structured sequences are

a) 0 a) Block codes
b) 1 b) Convolu onal codes
c) Infinite c) Turbo codes
d) Cannot be determined d) All of the men oned
Answer: c Answer: d
Explana on: Entropy of a random variable is Explana on: Structured sequences are those
also infinity. which add structured redundancy to the
source code. Examples are turbo codes, block
11. Which is more efficient method? codes, and convolu onal codes.
a) Encoding each symbol of a block
b) Encoding block of symbols 2. In binary symmetric channel, in the
c) Encoding each symbol of a block & demodulator _____ decision is made.
Encoding block of symbols a) Hard
d) None of the men oned b) So
c) Hard & So 6. If the parity bit takes value one then the
d) None of the men oned summa on of code-word gives
a) Even result
Answer: c b) Odd result
Explana on: In binary symmetric channel c) Even & Odd result
the demodulator consists of only two d) None of the men oned
discrete elements. Thus it makes hard or firm
decision. Answer: a
Explana on: The parity bit takes on the value
3. In Gaussian channel demodulator ______ of one or zero to ensure that the summa on
decision is made. of all the bits in the code-word yields even or
a) Hard odd result.
b) So
c) Hard & So 7. The summa on opera on is performed
d) None of the men oned using _____ logical opera on.
a) EX-OR
Answer: b b) AND
Explana on: In Gaussian channel c) OR
demodulator consists of con nuous alphabet d) EX-NOR
or quan zed approxima on thus so
decision is made. Answer: a
Explana on: The summa on opera on is
4. Which decoders are less complex? performed using modulo 2 arithme c or
a) So decision decoder exclusive OR opera on.
b) Hard decision decoder
c) Hard & So decision decoder 8. The probability of message error is wri en
d) None of the men oned as
a) Block error
Answer: b b) Word error
Explana on: The design of a so decision c) Block & Word error
decoder is more complex than the design of d) None of the men oned
hard decision decoder.
Answer: c
5. The ra o of redundant bits to data bits is Explana on: We can write the probability of
called as message error also called as block error or
a) Code rate word error.
b) Redundancy rate
c) Symbol rate 9. In a real me communica on system
d) Transmission rate addi on of redundant bits leads to
a) More bandwidth requirement
Answer: b b) Faster rate of transmission
Explana on: The ra o of redundant bits to c) More bandwidth requirement & Faster
data bits is called as redundancy of the code rate of transmission
and the ra o of data bits to total bits is called d) None of the men oned
as code rate.
Answer: c 2. The capacity rela onship is given by
Explana on: In a real me communica on a) C = W log2 ( 1+S/N )
system the addi on of redundant bits b) C = 2W log2 ( 1+S/N )
dictates a faster transmission rate and which c) C = W log2 ( 1-S/N )
means more bandwidth. d) C = W log10 ( 1+S/N )

10. Coding gain is defined as Answer: a

a) Reduc on in Eb/N0 Explana on: The capacity rela onship from
b) Increase in Eb/N0 Shannon-hartley capacity theorem is given by
c) Same as Eb/N0 C = W log2 ( 1+S/N ).
d) None of the men oned
3. Which parameter is called as Shannon
Answer: a limit?
Explana on: For a given bit error probability a) PB/N0
coding gain can be defined as reduc on in b) EB/N0
Eb/N0 that can be realized through the use of c) EBN0
code. d) None of the men oned

11. The capacity per cell is ______ Eb/N0. Answer: b

a) Directly propor onal Explana on: There exists a limi ng value for
b) Inversely propor onal EB/N0 below which they can be no error free
c) Double the communica on at any informa on rate. This
d) Half the EB/N0 is called as Shannon limit.

Answer: b 4. Entropy is the measure of

Explana on: The capacity that is the number a) Amount of informa on at the output
of users per cell is inversely propor onal to b) Amount of informa on that can be
Eb/N0. transmi ed
c) Number of error bits from total number of
bits
TOPIC 1.3 CHANNEL CAPACITY,
d) None of the men oned
HARTLEY - SHANNON LAW
Answer: a
1. The minimum nyquist bandwidth needed Explana on: Entropy is defined as the
for baseband transmission of Rs symbols per average amount of informa on per source
second is output.
a) Rs
b) 2Rs 5. Equivoca on is the
c) Rs/2 a) Condi onal entropy
d) Rs2 b) Joint entropy
c) Individual entropy
Answer: c d) None of the men oned
Explana on: Theore cal minimum nyquist
bandwidth needed for the baseband Answer: a
transmission of Rs symbols per second Explana on: Shannon uses a correc on
without ISI is Rs/2. factor called equivoca on to account for
uncertainty in the received signal. It is c) Inter leavers & Punching pa ern
defined as the condi onal entropy of the d) None of the men oned
message X given Y.
Answer: c
6. For a error free channel, condi onal Explana on: There are many instances of
probability should be turbo codes, using different component
a) Zero encoders, input/output ra os, inter leavers,
b) One punching pa erns.
c) Equal to joint probability
d) Equal to individual probability 10. Decoders are connected in series.
a) True
Answer: a b) False
Explana on: For a error free channel
condi onal probability should be zero, Answer: a
because having received Y there is complete Explana on: Two elementary decoders are
certainty about the message X. connected in serial connec on for decoding
the turbo codes.
7. Average effec ve informa on is obtained
by 11. The inter leaver connected between the
a) Subtrac ng equivoca on from entropy two decoders is used to
b) Adding equivoca on with entropy a) Remove error bursts
c) Ra o of number of error bits by total b) Sca er error bursts
number of bits c) Add error bursts
d) None of the men oned d) None of the men oned

Answer: a Answer: b
Explana on: According to Shannon the Explana on: An inter leaver installed
average effec ve informa on is obtained by between the two decoders connected in
subtrac ng the equivoca on from the series is used to sca er error bursts.
entropy of the source.
12. In so decision approach what does -127
8. Turbo codes are mean?
a) Forward error correc on codes a) Certainly one
b) Backward error correc on codes b) Certainly zero
c) Error detec on codes c) Very likely zero
d) None of the men oned d) Very likely one

Answer: a Answer: b
Explana on: Turbo codes are a class of high Explana on: The decoder front end
performance forward error correc on codes. produces an integer for each bit in the data
stream. This integer is the measure of how
9. Components used for genera on of turbo likely it is that the bit 0 or 1 and is called as
codes are so bit. It ranges from -127 to 127. Here -127
a) Inter leavers represents certainly zero.
b) Punching pa ern
13. In so decision approach 100 means? c) Bits per symbol
a) Certainly one d) Bytes per symbol
b) Certainly zero
c) Very likely zero Answer: a
d) Very likely one Explana on: The unit of average mutual
informa on is bits.
Answer: d
Explana on: The decoder front end 3. When probability of error during
produces an integer for each bit in the data transmission is 0.5, it indicates that
stream. This integer is the measure of how a) Channel is very noisy
likely it is that the bit 0 or 1 and is called as b) No informa on is received
so bit. It ranges from -127 to 127. Here 100 c) Channel is very noisy & No informa on is
represents very likely one. received
d) None of the men oned
14. In so decision approach 0 represents
a) Certainly one Answer: c
b) Certainly zero Explana on: When probability of error
c) Very likely zero during transmission is 0.5 then the channel is
d) Could be either zero or one very noisy and thus no informa on is
received.
Answer: d
Explana on: The decoder front end 4. Binary Huffman coding is a
produces an integer for each bit in the data a) Prefix condi on code
stream. This integer is the measure of how b) Suffix condi on code
likely it is that the bit 0 or 1 and is called as c) Prefix & Suffix condi on code
so bit. It ranges from -127 to 127. Here 0 d) None of the men oned
represents ‘could be either zero or one’.
Answer: a
Explana on: Binary Huffman coding is a
TOPIC 1.4 SOURCE CODING prefix condi on code.
THEOREM, SHANNON - FANO CODE
5. The event with minimum probability has
1. Self informa on should be least number of bits.
a) Posi ve a) True
b) Nega ve b) False
c) Posi ve & Nega ve
Answer: b
d) None of the men oned
Explana on: In binary Huffman coding the
Answer: a event with maximum probability has least
Explana on: Self informa on is always non number of bits.
nega ve.
6. The method of conver ng a word to
2. The unit of average mutual informa on is stream of bits is called as
a) Bits a) Binary coding
b) Bytes b) Source coding
c) Bit coding c) Infinite
d) Cipher coding d) Cannot be determined

Answer: b Answer: c
Explana on: Source coding is the method of Explana on: Entropy of a random variable is
conver ng a word to stream of bits that is 0’s also infinity.
and 1’s.
11. Which is more efficient method?
7. When the base of the logarithm is 2, then a) Encoding each symbol of a block
the unit of measure of informa on is b) Encoding block of symbols
a) Bits c) Encoding each symbol of a block &
b) Bytes Encoding block of symbols
c) Nats d) None of the men oned
d) None of the men oned
Answer: b
Answer: a Explana on: Encoding block of symbols is
Explana on: When the base of the logarithm more efficient than encoding each symbol of
is 2 then the unit of measure of informa on a block.
is bits.
12. Lempel-Ziv algorithm is
8. When X and Y are sta s cally a) Variable to fixed length algorithm
independent, then I (x,y) is b) Fixed to variable length algorithm
a) 1 c) Fixed to fixed length algorithm
b) 0 d) Variable to variable length algorithm
c) Ln 2
d) Cannot be determined Answer: a
Explana on: Lempel-Ziv algorithm is a
Answer: b variable to fixed length algorithm.
Explana on: When X and Y are sta s cally
independent the measure of informa on I 13. Coded system are inherently capable of
(x,y) is 0. be er transmission efficiency than the
uncoded system.
9. The self informa on of random variable is a) True
a) 0 b) False
b) 1
c) Infinite Answer: a
d) Cannot be determined Explana on: Yes, the coded systems are
capable of be er transmission efficiency than
Answer: c the uncoded system.
Explana on: The self informa on of a
random variable is infinity. TOPIC 1.5 HUFFMAN CODE
10. Entropy of a random variable is
a) 0 1. Which of the following algorithms is the
b) 1 best approach for solving Huffman codes?
a) exhaus ve search
b) greedy algorithm 5. The code length does not depend on the
c) brute force algorithm frequency of occurrence of characters.
d) divide and conquer algorithm a) true
b) false
Answer: b
Explana on: Greedy algorithm is the best Answer: b
approach for solving the Huffman codes Explana on: The code length depends on
problem since it greedily searches for an the frequency of occurrence of characters.
op mal solu on. The more frequent the character occurs, the
less is the length of the code.
2. How many printable characters does the
ASCII character set consists of? 6. In Huffman coding, data in a tree always
a) 120 occur?
b) 128 a) roots
c) 100 b) leaves
d) 98 c) le sub trees
d) right sub trees
Answer: c
Explana on: Out of 128 characters in an Answer: b
ASCII set, roughly, only 100 characters are Explana on: In Huffman encoding, data is
printable while the rest are non-printable. always stored at the leaves of a tree inorder
to compute the codeword effec vely.
3. Which bit is reserved as a parity bit in an
ASCII set? 7. From the following given tree, what is the
a) first code word for the character ‘a’?
b) seventh
c) eighth
d) tenth

Answer: c
Explana on: In an ASCII character set, seven
bits are reserved for character representa on
while the eighth bit is a parity bit.

4. How many bits are needed for standard

encoding if the size of the character set is X?
a) log X
b) X+1
c) 2X
d) X2
a) 011
Answer: a b) 010
Explana on: If the size of the character set is c) 100
X, then [log X] bits are needed for d) 101
representa on in a standard encoding.
Answer: a occurs at frequency fi, the cost of the
Explana on: By recording the path of the codeword obtained is ∑fidi.
node from root to leaf, the code word for
character ‘a’ is found to be 011. 10. An op mal code will always be present in
a full tree.
8. From the following given tree, what is the a) true
computed codeword for ‘c’?
b) false

Answer: a
Explana on: An op mal tree will always have
the property that all nodes are either leaves
or have two children. Otherwise, nodes with
one child could move up a level.

11. The type of encoding where no character

code is the prefix of another character code
is called?
a) op mal encoding
b) prefix encoding
c) frequency encoding
d) trie encoding
a) 111
b) 101 Answer: b
c) 110 Explana on: Even if the character codes are
d) 011 of different lengths, the encoding where no
character code is the prefix of another
Answer: c character code is called prefix encoding.
Explana on: By recording the path of the
node from root to leaf, assigning le branch 12. What is the running me of the Huffman
as 0 and right branch as 1, the codeword for c encoding algorithm?
is 110. a) O(C)
b) O(log C)
9. What will be the cost of the code if c) O(C log C)
character ci is at depth di and occurs at d) O( N log C)
frequency fi? Answer: c
a) cifi Explana on: If we maintain the trees in a
b) ∫cifi priority queue, ordered by weight, then the
c) ∑fidi running me is given by O(C log C).
d) fidi 13. What is the running me of the Huffman
algorithm, if its implementa on of the
Answer: c priority queue is done using linked lists?
Explana on: If character ci is at depth di and a) O(C)
b) O(log C)
c) O(C log C) Answer: a
d) O(C2) Explana on: Predic on gain increases for
be er predic on.
Answer: d
Explana on: If the implementa on of the 4. Delta modula on is
priority queue is done using linked lists, the a) 1 bit DPCM
b) 2 bit DPCM
running me of Huffman algorithm is O(C2).
c) 4 bit DPCM
d) None of the men oned

Answer: a
Explana on: Delta modula on is also
UNIT II WAVEFORM CODING considered as 1 bit DPCM.
& REPRESENTATION
5. 1 bit quan zer is a
a) Hard limiter
TOPIC 2.1 PREDICTION FILTERING b) Two level comparator
AND DPCM c) Hard limiter & Two level comparator
d) None of the men oned
1. Uniform quan zer is also known as
a) Low rise type Answer: c
b) Mid rise type Explana on: 1 bit quan zer is also called as
c) High rise type two level comparator and also as hard limiter.
d) None of the men oned
6. If step size is increased _____ occurs.
Answer: b a) Slope overload distor on
Explana on: Uniform quan zer is also b) Granular noise
known as mid rise type quan zer. c) Slope overload distor on & Granular noise
d) None of the men oned
2. The SNR value can be increased by _____
the number of levels. Answer: b
a) Increasing Explana on: When step size is increased to
b) Decreasing prevent slope overload distor on, granular
c) Does not depend on noise occurs.
d) None of the men oned
7. Which helps in maintaining the step size?
Answer: a a) Delta modula on
Explana on: The signal to noise ra o can be b) PCM
increased by increasing the number of levels. c) DPCM
d) Adap ve delta modula on
3. Predic on gain _____ for be er predic on.
a) Increases Answer: d
b) Decreases Explana on: Step size if effec vely
c) Remains same maintained using adap ve delta modula on.
d) None of the men oned
8. The low pass filter at the output end of 12. Vector quan za on is used in
delta modulator depends on a) Audio coding
a) Step size b) Video coding
b) Quan za on noise c) Speech coding
c) Bandwidth d) All of the men oned
d) None of the men oned
Answer: c
Answer: c Explana on: Vector quan za on is widely
Explana on: The design of low pass filter at used in speech coding for digital cellular
the output end of delta modulator depends systems.
on bandwidth.
13. The spectral density of white noise is
9. In early late ming error detec on method a) Exponen al
if the bit is constant, then the slope will be b) Uniform
a) Close to zero c) Poisson
b) Close to infinity d) Gaussian
c) Close to origin
d) None of the men oned Answer: b
Explana on: The spectral density of white
Answer: a noise is uniform.
Explana on: In early ming error detec on
method if the bit is constant and doesn’t 14. The probability density func on of the
change, then the slope will be close to zero. envelope of narrow band noise is
a) Uniform
10. The theore cal gain in zero crossing TED b) Gaussian
is greater than early late TED. c) Rayleigh
a) True d) Rician
b) False
Answer: b
Answer: a Explana on: The probability density func on
Explana on: The theore cal gain in zero of the envelope of narrow band noise is
crossing ming error detec on is twice more Gaussian func on.
than that in the early late ming error
detec on method. 15. The type of noise that interferes much
with high frequency transmission is
11. Non uniform quan zer ______ distor on. a) White
a) Increases b) Flicker
b) Decreases c) Transit me
c) Does not effect d) Shot
d) None of the men oned
Answer: c
Answer: b Explana on: The type of noise that interferes
Explana on: Distor on can be reduced by much with high frequency transmission is
using non uniform quan zer. transit me.
16. Thermal noise power of a resistor c) Analog to digital and digital to analog
depends upon d) None of the men oned
a) Its resistance value
b) Noise temperature Answer: c
c) Bandwidth Explana on: Delta modula on is the process
d) Ambient temperature of analog to digital and digital to analog
conversion technique used for transmission
Answer: b of voice signals.
Explana on: Thermal noise power of a
resistor depends upon noise temperature. 4. To achieve high signal to noise ra o, delta
modula on must use
a) Under sampling
b) Over sampling
c) Aliasing
d) None of the men oned

Answer: b
TOPIC 2.2 DELTA MODULATION Explana on: To achieve high signal to noise
ra o, delta modula on must use over
1. Proper es used to determine stream’s sampling techniques.
fidelity
a) Sampling rate 5. The demodulator in delta modula on
b) Bit depth technique is
c) Sampling rate & Bit depth a) Differen ator
d) None of the men oned b) Integrator
c) Quan zer
Answer: c d) None of the men oned
Explana on: Two basic proper es to
determine stream’s fidelity are bit depth and Answer: b
sampling rate, number of mes per second Explana on: The demodulator used in delta
that samples are taken. modula on is a simple form of integrator.

2. In bipolar codes, pulses can be 6. Source of noise in delta modula on is

a) Posi ve a) Granularity
b) Nega ve b) Slope overload
c) Absent c) Granularity & Slope overload
d) All of the men oned d) None of the men oned

Answer: d Answer: c
Explana on: In bipolar codes, the pulses can Explana on: Sources of noise in delta
be posi ve, nega ve or absent. modula on are granularity and slope
overload.
3. Delta modula on is ______ conversion.
a) Analog to digital 7. When probability of receiving a symbol is 1
b) Digital to analog then how much informa on will be
obtained?
a) Li le informa on 11. Space division has dedicated
b) Much informa on a) Paths
c) No informa on b) Time slots
d) None of the men oned c) Paths & Time slots
d) None of the men oned
Answer: c
Explana on: When the probability of Answer: a
receiving a symbol is 1 then the informa on Explana on: Space division has dedicated
obtained is zero. paths and me division has dedicated me
slots.
8. In channel encoding procedure
a) Redundancy bits are added 12. In me division system, the actual switch
b) Errors are corrected is called as
c) Redundancy bits are added & Errors are a) Speech memory
corrected b) Cross point
d) None of the men oned c) Connec ng point
d) None of the men oned
Answer: c
Explana on: In channel encoding includes Answer: a
addi on of redundancy to the signal such Explana on: In me division, actual switch is
that any bit errors can be corrected. called as speech memory and in space
division actual switch is called as cross point.
9. Modula on process includes
a) Analog to digital conversion 13. In me division, connec on is established
b) Digital to analog conversion using
c) All of the men oned a) Data exchange
d) None of the men oned b) Galvanic connec on
c) Data exchange & Galvanic connec on
Answer: b d) None of the men oned
Explana on: Modula on procedure includes
digital to analog conversion which produces a Answer: a
con nuous me signal that can be sent Explana on: In me division, connec on is
through the channel. established using data exchange and in space
division it is established using galvanic
10. Switching exists in connec ons.
a) Point to point communica on
b) Broadcast communica on 14. Analogue switches provides
c) Point to point & Broadcast communica on a) Good bandwidth
d) None of the men oned b) Low distor on
c) Low cost
Answer: a d) All of the men oned
Explana on: Circuit connec on in point to
point communica on is called as switching. Answer: d
Switching does not exist in broadcast Explana on: Some of the features of
communica on or network. analogue switches are good bandwidth, low
cost, low distor on, lower reliability.
15. Opera ons performed by switching a) Decreasing
system b) Increasing
a) Path establishment c) Doubling
b) Informa on exchange d) Squaring
c) Tariff computa on
d) All of the men oned Answer: b
Explana on: The process of quan za on
Answer: d replaces the true signal with the
Explana on: Opera ons performed by approxima on(quan za on noise). By
switching network are path establishment, increasing the number of quan za on level
informa on exchange, tariff computa on, the quan za on noise can be reduced.
maintenance, billing etc.
4. In PCM encoding, quan za on level varies
as a func on of ________
TOPIC 2.3 ADPCM & ADM a) Frequency
PRINCIPLES b) Amplitude
c) Square of frequency
1. The signals which are obtained by d) Square of amplitude
encoding each quan zed signal into a digital
word is called as Answer: b
a) PAM signal Explana on: In linear PCM the quan za on
b) PCM signal levels are uniform. But in normal PCM
c) FM signal encoding the quan za on level vary
d) Sampling and quan za on according to the amplitude, based of A-law of
Myu-law.
Answer: b
Explana on: Pulse code modula on is the 5. What is bit depth?
name for the class of signals which are a) Number of quan za on level
obtained by encoding the quan zed signals b) Interval between two quan za on levels
into a digital word. c) Number of possible digital values to
represent each sample
2. The length of the code-word obtained by d) None of the men oned
encoding quan zed sample is equal to
a) l=log(to the base 2)L Answer: c
b) l=log(to the base 10)L Explana on: One of the proper es of PCM
c) l=2log(to the base 2)L signal which determines its stream fidelity is
d) l=log(to the base 2)L/2 bit depth which is the number of possible
digital values that can be used to represent
Answer: a each sample.
Explana on: The quan zed sample which
are digitally encoded into l bit value code- 6. Choosing a discrete value that is near but
word. The length l can be calculated as not exactly at the analog signal level leads to
l=log(to the base 2)L. a) PCM error
b) Quan za on error
3. Quan za on noise can be reduced by c) PAM error
________ the number of levels. d) Sampling error
Answer: b 10. Sample resolu on for LPCM ____ bits per
Explana on: One of the limita ons of PCM is sample.
quan za on error which occurs when we a) 8
choose a discrete value at some near by b) 16
value and not at the analog signal level. c) 24
d) All of the men oned
7. In PCM the samples are dependent on
________ Answer: d
a) Time Explana on: Common sampling resolu on
b) Frequency for LPCM are 8, 16, 20, 24 bits per sample.
c) Quaniza on leavel
d) Interval between quan za on level 11. Adap ve DPCM is used to
a) Increase bandwidth
Answer: a b) Decrease bandwidth
Explana on: The samples depend on me,an c) Increase SNR
accurate clock is required for accurate d) None of the men oned
reproduc on.
Answer: b
8. DPCM encodes the PCM values based on Explana on: Adap ve DPCM is used to
a) Quan za on level decrease required bandwidth for the given
b) Difference between the current and SNR.
predicted value
c) Interval between levels
TOPIC 2.4 LINEAR PREDICTIVE
d) None of the men oned
CODING
Answer: b
Explana on: Differen al PCM encodes the 1. Linear predic ve coders belong to _______
PCM value based on the difference between domain class of vocoders.
the previous sample and the present sample a) Time
value. b) Frequency
c) Direct
9. Delta modula on uses _____ bits per d) Indirect
sample.
a) One Answer: a
b) Two Explana on: Linear predic ve vocoders
c) Four belong to the me domain class of vocoders.
d) Eight This class of vocoders a empts to extract the
significant features of the speech from the
Answer: a me waveform.
Explana on: Delta modula on is used for
analog to digital conversion and vice versa. It 2. Linear predic ve coders are
is a simple form of DPCM. Its uses 1 bit per computa onally simple.
sample. It also depends on the difference a) True
between the current and previous sample b) False
values.
Answer: b book. In this method, the coder and decoder
Explana on: Linear predic ve coders are have a predetermined code book of
computa onally intensive. But, they are the stochas c (zero mean white Gaussian)
most popular among the class of low bit excita on signals.
vocoders. With LPC, it is possible to transmit
good quality voice at 4.8 kbps and poorer 6. How many past samples are used by linear
quality voice at even lower rates. predic ve coders to es mate present
sample?
3. Linear predic ve coding system models the a) 100-150
vocal tract as __________ linear filter. b) 10-15
a) Pole and zero c) 1
b) All zero d) 1000-1100
c) All pole
d) No pole Answer: b
Explana on: LPCs uses weighted sum of past
Answer: c p samples to es mate the present samples.
Explana on: The linear predic ve coding The number of past samples used by linear
system models the vocal tract as an all pole predic ve coders ranges from 10 to 15.
linear filter. The excita on to this filter is
either a pulse at the pitch frequency or 7. Which of the non-linear transform is
random white noise depending on whether generally used to improve the coding of
the speech segment is voiced or unvoiced. reflec on coefficient?
a) Long area ra o transform
4. Linear predic ve vocoders use __________ b) Mutual informa on
to es mate present sample. c) Least square
a) Weighted sum of past samples d) Interpola on
b) Mul plica on of past samples
c) One past sample Answer: a
d) Do not use past samples Explana on: Long area ra o (LAR) transform
is generally used to improve the coding of
Answer: a reflec on coefficient. This non linear
Explana on: The linear predic ve coder uses transforma on reduces the sensi vity of
a weighted sum of p past samples. Using this reflec on coefficients to quan za on errors.
technique, the current sample can be wri en LAR performs an inverse hyperbolic tangent
as linear sum of the immediately precoding mapping of reflec on coefficients.
samples.
8. Which of the following LPC uses two
5. Which of the following LPC uses code sources at the receiver?
book? a) Mul ple excited LPC
a) Mul ple excited LPC b) Residual excited LPC
b) Residual excited LPC c) LPC Vocoders
c) LPC Vocoders d) Code excited LPC
d) Code excited LPC
Answer: c
Answer: d Explana on: LPC vocoder uses two sources
Explana on: Code excited LPC uses code at the receiver, one of white noise and the
other with a series of pulses at the current pulses per pitch period. This is the reason for
pitch rate. The selec on of either of these be er speech quality.
excita on methods is based on
voiced/unvoiced decision made at the TOPIC 2.5 PROPERTIES OF LINE
transmi er.
CODES, POWER SPECTRAL DENSITY
9. Which of the following LPC produces a OF UNIPOLAR / POLAR RZ & NRZ
buzzy twang in the synthesized speech?
a) Mul ple excited LPC 1. Which waveforms are also called as line
b) Residual excited LPC codes?
c) LPC Vocoders a) PCM
d) Code excited LPC b) PAM
c) FM
Answer: c d) AM
Explana on: LPC vocoder requires that the
transmi er extract pitch frequency Answer: a
informa on which is o en very difficult. Explana on: When pulse modula on is
Moreover, the phase coherence between the applied to binary symbol we obtain pulse
harmonic components of the excita on pulse code modulated waveforms. These
tends to produce a buzzy twang in the waveforms are also called as line codes.
synthesized speech.
2. When pulse code modula on is applied to
10. The problem of buzzy twang in non binary symbols we obtain waveform
synthesized speech is mi gated by mul pulse called as
excited LPC or code excited LPC. a) PCM
a) True b) PAM
b) False c) M-ary
d) line codes
Answer: a
Explana on: LPC vocoder produces buzzy Answer: c
twang in the synthesized speech due to Explana on: When pulse code modula on is
phase coherence between the harmonic applied to binary symbols we get PCM
components of the excita on pulses. This waveforms and when it is applied to non
problem is mi gated by mul pulse excited or binary symbols we obtain M-ary waveforms.
code excited LPC.
3. Examples of PCM waveforms are
11. Mul pulse excited LPC requires pitch a) Non return to zero
detec on. b) Phase encoded
a) True c) Mul level binary
b) False d) All of the men oned
Answer: b Answer: d
Explana on: Mul pulse excited LPC does not Explana on: Some of the examples or
require pitch detec on and the predic on classifica on of pulse code modulated signals
residual is be er approximated by several are non return to zero, return to zero, phase
encoded, mul level binary etc.
4. Which type is used and preferred in digital M. Logic 0 is represented by a change in
logic circuits? voltage level and logic 1 is represented as no
a) NRZ-L change in voltage level.
b) NRZ-M
c) NRZ-S 8. The return to zero waveform consists of
d) None of the men oned a) Unipolar RZ
b) Bipolar RZ
Answer: a c) RZ-AMI
Explana on: NRZ-L is extensively used in d) All of the men oned
digital logic circuits. In this method, logic 1 is
represented by one voltage level and logic 0 Answer: d
is represented by another voltage level. Explana on: Different types of return to zero
waveforms are unipolar RZ, bipolar RZ, RZ-
5. Which method is called as differen al AMI. These are used in baseband
encoding? transmission and in magne c recording.
a) NRZ-L
b) NRZ-M 9. Phase encoded group consists of
c) NRZ-S a) Manchester coding
d) None of the men oned b) Bi-phase-mark
c) Miller coding
Answer: b d) All of the men oned
Explana on: In NRZ-M, logic 1 is represented
by a change in voltage level and logic 0 is Answer: d
represented by no change in level. This is Explana on: Different types of phase
called as differen al encoding. encoded waveform consists of manchester
coding, bi-phase-mark, bi-phase-space, delay
6. Which method is preferred in magne c modula on.
tape recording?
a) NRZ-L 10. In which waveform logic 1 is represented
b) NRZ-M by half bit wide pulse and logic 0 is
c) NRZ-S represented by absence of pulse?
d) None of the men oned a) Unipolar RZ
b) Bipolar RZ
Answer: b c) RZ-AMI
Explana on: NRZ-M is also called as d) Manchester coding
differen al encoding and it is most preferred
in magen c tape recording. Answer: a
Explana on: In unipolar RZ waveform, logic 1
7. NRZ-S is complement of _______ is represented by half bit wide pulse and
a) NRZ-L logic 0 is represented by the absence of a
b) NRZ-M pulse.
c) NRZ-L & NRZ-M
d) None of the men oned 11. In which waveform logic 1 and logic 0 are
represented by opposite one half bit wide
Answer: b pulses?
Explana on: NRZ-S is a complement of NRZ- a) Unipolar RZ
b) Bipolar RZ c) Bi-p-S
c) RZ-AMI d) Delay modula on
d) Manchester coding
Answer: a
Answer: b Explana on: In bi-phase-level one is
Explana on: In bipolar return to zero represented by half bit wide pulse posi oned
waveform ones and zeroes are represented during the first half and zero is represented
by opposite level pulses one half bit wide by half bit wide pulse posi oned in the
pulses. second half.

12. In which waveform logic 1 is represented 3. Which binary waveform uses three levels?
by equal amplitude alterna ng pulses? a) Bipolar RZ
a) Unipolar RZ b) RZ-AMI
b) Bipolar RZ c) Bipolar RZ & RZ-AMI
c) RZ-AMI d) None of the men oned
d) Manchester coding
Answer: c
Answer: c Explana on: In PCM waveforms signals
Explana on: In RZ-AMI logic 1 is represented generally use two levels. But few signals use
by equal amplitude alterna ng pulses and three levels such as bipolar RZ, RZ-AMI,
logic 0 is represented by the absence of a dicode, duobinary etc.
pulse.
4. Which waveform type has the feature of
clocking?
TOPIC 2.6 BIPOLAR NRZ, a) Manchester coding
MANCHESTER CODING b) Bbi-p-M
c) Delay modula on
1. Applica on of phase encoded binary d) NRZ-L
signals are
a) Op cal communica on Answer: a
b) Magne c recording Explana on: In manchester coding transi on
c) Satellite telemetry occurs in the middle of every bit interval.
d) All of the men oned Thus it has a feature of clocking.

Answer: d 5. Which waveform has the feature of error

Explana on: Some of the fields where phase detec on?
encoded waveforms is being used are op cal a) NRZ-L
communica on, magne c tape recording, b) RZ-AMI
satellite telemetry etc. c) Manchester coding
d) Duobinary
2. In which waveform one is represented by
half bit wide pulse posi oned during the first Answer: d
half and zero is represented by half bit wide Explana on: Duobinary scheme does error
pulse posi oned in the second half? detec on without introducing any addi onal
a) Bi-p-L error bits into the data sequence.
b) Bi-p-M
6. Which waveform scheme introduces described by number of quan za on levels
bandwidth compression? allowed for each sample.
a) Duobinary
b) Manchester coding 10. Some of the M-ary waveforms are
c) Phase encoded waveform a) PAM
d) Mul level codes b) PPM
c) PDM
Answer: d d) All of the men oned
Explana on: Mul level codes increases the
bandwidth efficiency by reducing the Answer: d
bandwidth u liza on for the given data rate. Explana on: When we pulse modulate non
binary signals we get M-ary waveform. Some
7. Which waveform type has be er noise of the examples of M-ary waveforms are
immunity? PAM, PPM, PDM.
a) NRZ
b) RZ 11. Which method should be implemented
c) Phase encoded for reducing bandwidth?
d) Mul level codes a) Mul level codes
b) Mul level signalling
Answer: a c) PAM
Explana on: NRZ waveforms has be er error d) PDM
performance than RZ signal waveforms.
Answer: b
8. In pulse modula on, reciprocal of T( me) Explana on: The transmission bandwidth
is required for binary digital waveforms is large.
a) Bandwidth To reduce the bandwidth, mul level
b) Symbol rate signalling method can be used.
c) Signal voltage
d) None of the men oned 12. In M-ary PPM waveform, modula on is
effected by
Answer: b a) Delaying
Explana on: T is the me period of the b) Advancing
signal. In pulse modula on, the symbol rate c) Delaying & Advancing
Rs can be given as reciprocal of T. d) None of the men oned

9. PCM word size can be described by Answer: c

a) Time period Explana on: In M-ary PPM waveform,
b) Symbol rate modula on is effected by delaying or
c) Number of quan za on levels advancing pulse occurrence by an amount
d) None of the men oned that corresponds to informa on symbol.

Answer: c 13. For both PPM and PDM _______ is kept

Explana on: Each analog sample is constant.
transformed into PCM word made up of a a) Amplitude
group of bits. The PCM word size can be b) Time period
c) Frequency sequence to be detected is in sinc shape the
d) Number of levels pulses can be detected without ISI.

Answer: a 3. What is symbol rate packing?

Explana on: In PPM waveform delaying or a) Maximum possible symbol transmission
advancing of pulse is done. In PDM the pulse rate
width is varied. Thus in both the cases b) Maximum possible symbol receiving rate
amplitude is maintained constant. c) Maximum bandwidth
d) Maximum ISI value allowed

Answer: a
Explana on: A system with bandwidth Rs/2
UNIT III BASEBAND can support a maximum transmission rate of
Rs without ISI. Thus for ideal Nyquist filtering
TRANSMISSION & RECEPTION the maximum possible symbol transmission
rate is called as symbol rate packing and it is
TOPIC 3.1 ISI equal to 2 symbols/s/Hz.

4. A nyquist pulse is the one which can be

1. The method in which the tail of one pulse represented by _____ shaped pulse
smears into adjacent symbol interval is called mul plied by another me func on.
as a) Sine
a) Intersymbol interference b) Cosine
b) Interbit interference c) Sinc
c) Interchannel interference d) None of the men oned
d) None of the men oned
Answer: c
Answer: a Explana on: A nyquist filter is one whose
Explana on: Due to the effect of system frequency transfer func on can be
filtering the received pulse can overlap on represented by a rectangular func on
one and another. The tail of one pulse smears convolved with any real even symmetric
into the adjacent symbol interval thereby frequency func on and a nyquist pulse is one
interfering the detec on process. This whose shape can be represented by sinc
process is called as intersymbol interference. func on mul plied by another me func on.
2. If each pulse of the sequence to be 5. Examples of nyquist filters are
detected is in _____ shape, the pulse can be a) Root raised cosine filter
detected without ISI. b) Raised cosine filter
a) Sine c) Root raised & Raised cosine filter
b) Cosine d) None of the men oned
c) Sinc
d) None of the men oned Answer: c
Explana on: The most popular among the
Answer: c class of nyquist filters are raised cosine and
Explana on: The sinc shaped pulse is the root raised cosine filter.
ideal nyquist pulse. If each pulse in the
6. The minimum nyquist bandwidth for the Answer: c
rectangular spectrum in raised cosine filter is Explana on: A pulse shaping filter should
a) 2T provide the desired roll off and should be
b) 1/2T realizable, that is the impulse response needs
c) T2 to be truncated to a finite length.
d) 2/T
10. Examples of double side band signals are
Answer: b a) ASK
Explana on: For raised cosine spectrum the b) PSK
minimum nyquist bandwidth is equal to 1/2T. c) ASK & PSK
d) None of the men oned
7. Roll off factor is the frac on of
a) Excess bandwidth and absolute bandwidth Answer: c
b) Excess bandwidth and minimum nyquist Explana on: ASK and PSK needs twice the
bandwidth transmission bandwidth of equivalent
c) Absolute bandwidth and minimum nyquist baseband signals. Thus these are called as
bandwidth double side band signals.
d) None of the men oned
TOPIC 3.2 NYQUIST CRITERION FOR
Answer: b
Explana on: The roll off factor is defined by
DISTORTION LESS TRANSMISSION
a frac on of excess bandwidth and the
minimum nyquist bandwith. It ranges from 0 It looks like nothing was found at this
to 1. loca on. Maybe try searching?

8. Which value of r (roll off factor) is Search for: Search …

considered as Nyquist minimum bandwidth Search
case?
a) 0
TOPIC 3.3 PULSE SHAPING –
b) 1
c) Infinity CORRELATIVE CODING
d) None of the men oned
1. The method in which small amount of
Answer: a controlled ISI is introduced into the data
Explana on: For the roll off factor of 0 an stream rather than trying to eliminate it
ideal rectangular nyquist pulse is obtained. completely is called as
This is called as nyquist minimum bandwidth a) Correla ve coding
case. b) Duobinary signalling
c) Par al response signalling
9. A pulse shaping filter should sa sfy two d) All of the men oned
requirements. They are
a) Should be realizable Answer: d
b) Should have proper roll off factor Explana on: The interference at the detector
c) Should be realizable & have proper roll off can be cancelled out using these methods in
factor which some controlled amount of ISI is
d) None of the men oned introduced into the data stream.
2. From digital filter we will get the output c) EXOR-ed
pulse as the _______ of the current and the d) Added
previous pulse.
a) Summa on Answer: c
b) Difference Explana on: To avoid error propoga on
c) Product precoding method is used. In this each bit is
d) Ra o encoded individually without having any
effect due to its prior bit or decisions.
Answer: a
Explana on: The digital filter incorporates 6. The duobinary filter, He (f) is called as
one digit delay and thus it adds the incoming a) Sine filter
pulse with the value of the previous pulse. b) Cosine filter
c) Raised cosine filter
3. In duobinary signalling method, for M-ary d) None of the men oned
transmission, the number of output obtained
is Answer: b
a) 2M Explana on: The transfer func on is 2T
b) 2M+1 cos(πfT) which is called as cosine filter.
c) 2M-1
d) M2 7. The method which has greater bandwidth
efficiency is called as
Answer: c a) Duobinary signalling
Explana on: In duobinary coding, the b) Polybinary signalling
number of output obtained for M-ary c) Correla ve coding
transmission is 2M-1. d) All of the men oned

4. The method using which the error Answer:b

propaga on in dubinary signalling can be Explana on: If more than three levels are
avoided is introduced in duobinary signalling technique
a) Filtering the bandwidth efficiency increases This
b) Precoding method is called as polybinary signalling.
c) Postcoding
d) None of the men oned 8. In polybinary signalling method the
present bit of binary sequence is algebraically
Answer: b added with ______ number of previous bits.
Explana on: In duobinary signalling method a) j
if one error occurs it repeats everywhere b) 2j
through out the next steps. To avoid this c) j+2
precoding method can be used. d) j-2

5. In precoding technique, the binary Answer: d

sequence is _____ with the previous Explana on: In polybinary signalling method
precoded bit. the present binary digit of the sequence is
a) And-ed formed from the modulo-2 addi on of the j-2
b) Or-ed preceding digits of the sequence and the
present digit.
9. The primary advantage of this method is Answer: b
a) redistribu on of spectral density Explana on: As the eye closes, ISI increases
b) to favor low frequencies and as the eye opens ISI decreases.
c) redistribu on of spectral density & to favor
low frequencies 3. Pseudo noise signal has _______ and
d) none of the men oned _______ SNR for the same peak transmi ed
power.
Answer: c a) Larger, smaller
Explana on: Each bit can be independently b) Smaller, larger
detected in-spite of strong correla on and c) Larger, larger
this provides redistribu on of spectral d) Smaller, smaller
density and also favors low frequencies.
Answer: c
10. Source encoding procedure does Explana on: A training pulse is applied to
a) Sampling the equalizer and corresponding impulse
b) Quan za on response is observed. Pseudo noise is
c) Compression preferred as the training pulse as it has larger
d) All of the men oned SNR value and larger average power value.

Answer: d 4. The index value n, in transversal filter can

Explana on: Source encoding includes a be used as.
sampling of con nuous me signals, a) Time offset
quan za on of con nuous valued signals and b) Filter coefficient iden fier
compression of those sources. c) Time offset & Filter coefficient iden fier
d) None of the men oned
TOPIC 3.4 EYE PATTERN Answer: c
Explana on: The index n can be used as both
1. The range of amplitude difference gives me offset and the filter coefficient iden fier,
the value of which is the address in the filter.
a) Width
b) Distor on 5. The over-determined set of equa ons can
c) Timing ji er be solved using
d) Noise margin a) Zero forcing
b) Minimum mean square error
Answer: b c) Zero forcing & Minimum mean square
Explana on: In the eye pa ern, the error
amplitude difference gives the value of d) None of the men oned
distor on caused by ISI.
Answer: c
2. As the eye opens, ISI _______ Explana on: The matrix x in transversal
a) Increases equalizer if non square with dimensions
b) Decreases 4N+1 and 2N+1. Such equa ons are called as
c) Remains the same over-determined set. This can be solved by
d) None of the men oned two methods called as zero forcing method
and minimum mean square error method.
6. If the filter’s tap weight remains fixed b) Time varying channel degrades the
during transmission of data, then the performance of the system
equaliza on is called as c) All of the men oned
a) Preset equaliza on d) None of the men oned
b) Adap ve equaliza on
c) Fixed equaliza on Answer: b
d) None of the men oned Explana on: The disadvantage of preset
equaliza on is that it requires an ini al
Answer: a training period that must be invoked at the
Explana on: If the weight remains fixed start of any new transmission. Also me
during transmission of data then the varying channel can degrade system
equaliza on is called as preset equaliza on. performance due to ISI, since the tap weights
It is a simple method which consists of are fixed.
se ng the tap weight according to some
average knowledge of the channel. 10. For AWGN, the noise variance is
a) N0
7. Equaliza on method which is done by b) N0/2
tracking a slowly me varying channel c) 2N0
response is d) N0/4
a) Preset equaliza on
b) Adap ve equaliza on Answer: b
c) Variable equaliza on Explana on: The noise variance out of the
d) None of the men oned correlator for AWGN is N0/2.

Answer: b 11. Performance of BFSK signal is ________

Explana on: This method is implemented to than BPSK.
perform tap weight adjustment periodically a) 3db worse
or con nually. Equaliza on is done by b) 3db be er
tracking a slowly varying channel response. c) 6db worse
d) 6db be er
8. Preamble is used for
a) Detect start of transmission Answer: a
b) To set automa c gain control Explana on: The performance of BFSK is 3db
c) To align internal clocks worse than BPSK signalling, since for a given
d) All of the men oned signal power, the distance squared between
orthogonal vectors is a factor of two less than
Answer: d the distance squared between orthopodal
Explana on: The receiver uses preamble for signals.
detec ng the start of transmission, to set
automa c gain control, and to align internal 12. A Gaussian distribu on into the non
clocks and local oscillator with the received linear envelope detector yields
signal. a) Rayleigh distribu on
b) Normal distribu on
9. The disadvantage of preset equalizer is c) Poisson distribu on
that d) Binary distribu on
a) It doesnot requires ini al training pulse
Answer: a b) Non coherent system
Explana on: The two output signals of c) Coherent & Non coherent system
Gaussian distribu on yields Rayleigh and d) None of the men oned
Rician distribu on.
Answer: b
13. The non coherent FSK needs ________ Explana on: A non coherent system is
Eb/N0 than coherent FSK. desirable because there may be difficulty is
a) 1db more establishing and maintaining a coherent
b) 1db less reference.
c) 3db more
d) 3db less 17. Which is the main system considera on?
a) Probability of error
Answer: a b) System complexity
Explana on: The non coherent receiver is c) Random fading channel
easier to implement. The non coherent FSK d) All of the men oned
needs 1db more Eb/N0 than coherent FSK.
Answer: d
14. The DPSK needs ________ Eb/N0 than Explana on: The major system
BPSK. considera ons are error probability,
a) 1db more complexity and random fading channel.
b) 1db less Considering all this non coherent system is
c) 3db more more desirable than coherent.
d) 3db less

Answer: a
TOPIC 3.5 RECEIVING FILTERS
Explana on: The DPSK system is easier to
implement than PSK and it needs 1db more 1. In pulse code modula on bandwidth
Eb/N0 than BPSK. required is low.
a) True
15. Coherent PSK and non coherent b) False
orthogonal FSK have a difference of ______
in PB. Answer: b
a) 1db Explana on: PCM stands for pulse code
b) 3db modula on. In PCM, the amplitude of the
c) 4db analog signal is discri sed and converted into
d) 6db digital form for transmission of binary data.
PCM usually requires a large bandwidth.
Answer: c
Explana on: The difference of PB is 2. How do we eliminate the ghosts in the
approximately 4db for the best ( coherent picture?
PSK ) and the worst (non coherent a) by using a long transmission line
orthogonal FSK). b) by using a booster
c) by changing the orienta on of antenna
16. Which is easier to implement and is d) by twis ng the transmission line
preferred?
a) Coherent system
Answer: c bandwidth for frequency modulated system
Explana on: Change in antenna orienta on is about 150 KHz.
helps in improving the recep on of signals
which further removes ghosts in the picture. 6. A buffer amplifier is a ________
a) double tuned amplifier
3. For ge ng maximum undistorted b) tuned amplifier
transmi ed power in a carrier wave, the c) high gain DC amplifier
value of modula on should be _________ d) low gain DC amplifier
a) 1
b) 0.5 Answer: c
c) 0.2 Explana on: Gain of an amplifier is its ability
d) 0.8 to increase the voltage at the input and
produce the result at the output. A buffer
Answer: a amplifier is basically a high gain DC amplifier.
Explana on: The possible maximum value of It is basically used for transferring voltage
modula on can be one. It signifies 100% from a high output impedance level to a low
modula on and thus at this value we have input impedance level circuit.
maximum undistorted transmi ed power.
7. The direc on of rota on of a CD is
4. To avoid fading in communica on, broad clockwise.
band antenna is used. a) True
a) True b) False
b) False
Answer: b
Answer: b Explana on: CD stands for compact disk. The
Explana on: It is generally observed that a direc on of rota on of Compact Disk is
ship to ship communica on suffers from an clockwise.
fading. This problem can be avoided by using
frequency diversity in which the components 8. What is the full form of PAM?
of a radio wave are received from different a) Pulse Analog Modula on
channels thus reducing the error that occurs b) Phase Analog Modula on
in the transmission of a single frequency c) Pulse Amplitude Modula on
component. d) Phase Amplitude Modula on

5. What is the commercial channel Answer: c

bandwidth in a frequency modulated Explana on: In communica on, PAM stands
system? for Pulse Amplitude Modula on. In PAM, the
a) 150 KHz amplitude of the individual pulses of the
b) 250 KHz message signal are varied in a specific me
c) 500 KHz interval.
d) 900 KHz
9. In a TV receiver antenna the length of
Answer: a reflector rod is _________
Explana on: Bandwidth is the band of a) same as that of dipole
frequencies present within a given range of b) less than that of dipole
frequency. The standard commercial channel
c) more than that of dipole Answer: a
d) is half of that of dipole Explana on: Wired channels are lossy
channels.
Answer: c
Explana on: A dipole antenna is the one 4. The equivalent temperature in a receiver
having its conduc ve wire rod equal to half design must be kept
the maximum wavelength of an antenna. The a) Low
length of receiving antenna in a TV receiver b) High
must be more than that of dipole to get a c) Does not affect the receiver
be er recep on of signals. d) None of the men oned

Answer: a
TOPIC 3.6 MATCHED FILTER Explana on: The equivalent temperature is
the func on of the receiver design and it
1. What are the main features of a receiver? must be always kept low.
a) Synchroniza on
b) Mul ple parallel receiver chain 5. Which corrects the sampling me problem
c) Synchroniza on & Mul ple parallel in a digital system?
receiver chain a) Interpolator
d) None of the men oned b) Decimator
c) Equalizer
Answer: c d) Filter
Explana on: The main features of a receiver
which increases its complexity are Answer: a
synchroniza on of carrier, phase, and ming Explana on: Interpolator corrects the
and mul ple parallel receiver chain. sampling me problem using discrete me
processing.
2. What condi ons must be fulfilled in a good
digital communica on system? 6. What are the main features of a
a) High data rate transmi er?
b) High fidelity a) Higher clock speed
c) Low transmit power b) Linear power amplifier
d) All of the men oned c) Direc onal antennas
d) All of the men oned
Answer: d
Explana on: Some of the condi ons which Answer: d
must be sa sfied in a digital communica on Explana on: Some of the main features
system are high data rate, high fidelity, low which make the transmi er complex are
bandwidth, low transmit power and low higher clock speed, higher transmit power,
transmi er and receiver complexity. direc onal antennas and need for a linear
amplifier.
3. Wired channels are
a) Lossy 7. Transmission media used in low frequency
b) Lossless band are
c) Lossy & Lossless a) Air
d) None of the men oned b) Water
c) Copper cable Answer: d
d) All of the men oned Explana on: Digital communica on system
can handle signals that are analog or those
Answer: d that are already digital. It can also handle 1D
Explana on: Air, water and copper cable can and 2D signals.
be used as transmission media in low
frequency band communica on. 12. The informa on source of a digital
communica on system can be
8. Transmission media used for medium a) Packe zed
frequency band are b) Con nuous
a) Coaxial cable c) Packe zed & Con nuous
b) Copper cable d) None of the men oned
c) Op cal fiber
d) All of the men oned Answer: c
Explana on: Informa on source comes from
Answer: b a higher networking layer. It can be
Explana on: For medium frequency band con nuous or packe zed.
communica on air and copper cable can only
be used as a transmission medium.
TOPIC 3.7 CORRELATION RECEIVER
9. Matched filter technique is used to
a) Increase SNR 1. In CDMA spread spectrum systems, chip
b) Decrease SNR rate is less than the bandwidth of the
c) SNR is not affected channel.
d) None of the men oned a) True
b) False
Answer: a
Explana on: Matched filter technique is a Answer: b
demodula on process used to increase SNR. Explana on: In CDMA spread spectrum
systems, the chip rate is typically much
10. Matched filter can also be used as least greater than the flat fading bandwidth of the
squares es mator. channel. Whereas conven onal modula on
a) True techniques require an equalizer to undo
b) False intersymbol interference between adjacent
channels.
Answer: a
Explana on: A matched filter can also be 2. A RAKE receiver collects the __________
used as a least squares es mator. versions of the original signal.
a) Time shi ed
11. Digital communica on system can handle b) Amplitude shi ed
a) Analog signals c) Frequency shi ed
b) 1D signals d) Phase shi ed
c) 2D signals
d) All of the men oned Answer: a
Explana on: RAKE receiver a empts to
collect the me shi ed versions of the
original signal. It is due to the fact that there collect the me shi ed version of the original
is useful informa on present in the mul path signal by providing a separate correla on
components. receiver for each of the mul path signal.

3. RAKE receiver uses separate _________ to 6. RAKE receiver is used for _______
provide the me shi ed version of the signal. technique.
a) IF receiver a) CDMA
b) Equalizer b) TDMA
c) Correla on receiver c) FDMA
d) Channel d) OFDM

Answer: c Answer: a
Explana on: RAKE receiver uses separate Explana on: RAKE receiver is essen ally a
correla on receivers to provide the me diversity receiver which is used specifically
shi ed version of the original signal for each for CDMA. It uses the fact that the mul path
of the mul path signal. CDMA receivers components are prac cally uncorrelated
combine these me shi ed versions of the from one another when their rela ve
original signal to transmission in order to propaga on delays exceed a chip period.
improve the signal to noise ra o of the
receiver. 7. A RAKE receiver uses __________ to
separately detect the M strongest signals.
4. Each correla on receiver in RAKE receiver a) Single correlator
is adjusted in ____________ b) Mul ple correlator
a) Frequency shi c) Single IF receiver
b) Amplitude change d) Mul ple IF receivers
c) Phase shi
d) Time delay Answer: b
Explana on: A RAKE receiver uses mul ple
Answer: d correlators to separately detect the M
Explana on: Each correla on receiver may strongest mul path components.
be adjusted in me delay, so that a Demodula on and bit decisions are then
microprocessor controller can cause different based on the weighted ouputs of the M
correla on receivers to search in different correlators.
me windows for significant mul path.
8. In a RAKE receiver, if the output from one
5. The range of me delays that a par cular correlator is corrupted by fading, all the
correlator can search is called ________ other correlator’s output are also corrupted.
a) Search window a) True
b) Sliding window b) False
c) Time span
d) Dwell me Answer: b
Explana on: In a RAKE receiver, if the output
Answer: a from one correlator is corrupted by fading,
Explana on: The range of me delays that a the others may not be. And the corrupted
par cular correlator an search is called a signal may be discounted through weigh ng
search window. RAKE receiver a empts to process.
9. A RAKE receiver uses __________ complexity and effec veness varies in
a) Equaliza on wireless communica on system.
b) Channel coding
c) Diversity 2. Equaliza on is used to compensate
d) Encryp on __________
a) Peak signal to noise ra o
Answer: c b) Intersymbol interference
Explana on: RAKE receiver is a diversity c) Channel fading
receiver. Diversity is provided by the fact that d) Noises present in the signal
the mul path components are prac cally
uncorrelated from one another when their Answer: b
rela ve propaga on delays exceed chip Explana on: Equaliza on compensate the
period. intersymbol interference (ISI) created by
mul path within me dispersive channels.
10. Interleaving is used to obtain An equalizer within a receiver compensates
___________ diversity. for the average range of the expected
a) Time channel amplitude and delay characteris cs.
b) Frequency
c) Polariza on 3. Training and tracking are the opera ng
d) Antenna modes of _________
a) Diversity techniques
Answer: a b) Channel coding techniques
Explana on: Interleaving is used to obtain c) Equaliza on techniques
me diversity in a digital communica on d) Demodula on techniques
system without adding any overhead. It
provides rapid prolifera on of digital speech Answer: c
coders which transform analog voices into Explana on: General opera ng modes of an
efficient digital messages. adap ve equalizer includes training and
tracking. A known fixed length training
sequence is sent by the transmi er so that
TOPIC 3.8 ADAPTIVE EQUALIZATION the receiver’s equalizer may adapt to a
proper se ng for minimum bit error rate
1. Which of the following is not used to detec on.
improve received signal quality over small
scale mes and distance? 4. An equalizer is said to be converged when
a) Modula on it is properly _______
b) Equaliza on a) Trained
c) Diversity b) Tracked
d) Channel coding c) Installed
d) Used
Answer: a
Explana on: Equaliza on, diversity and Answer: a
channel coding are the three techniques Explana on: When an equalizer has been
which are used to improve received signal properly trained, it is said to have converged.
quality and link performance over small scale Equalizers are commonly used in digital
mes and distance. But, the approach, cost, communica on systems where user data is
segmented into short me blocks or me equaliza on is to sa sfy that the combina on
slots. of the transmi er, channel and receiver be
an all pass channel.
5. Time for convergence of an equalizer is not
a func on of _______ 8. ______ controls the adap ve algorithm in
a) Equalizer algorithm an equalizer.
b) Equalizer structure a) Error signal
c) Time rate of change of mul path radio b) Transmi ed signal
channel c) Received signal
d) Transmi er characteris cs d) Channel impulse response

Answer: d Answer: a
Explana on: The mespan over which an Explana on: The adap ve algorithm is
equalizer converges is a func on of the controlled by the error signal. The error
equalizer algorithm, the equalizer structure signal is derived by comparing the output of
and the me rate of change of the mul path the equalizer and some signal which is either
radio channel. Equalizers require proper an exact scaled replica of the transmi ed
retraining in order to maintain effec ve ISI signal or represents a property of transmi ed
cancella on. signal.

6. Equalizer is usually implemented in 9. The adap ve algorithms in equalizer that

__________ do not require training sequence are called
a) Transmi er ________
b) Baseband or at IF in a receiver a) Linear adap ve algorithms
c) Radio channel b) Blind algorithms
d) Modulator stage c) Non-linear adap ve algorithms
d) Spa ally adap ve algorithms
Answer: b
Explana on: An equalizer is implemented at Answer: b
baseband or at IF in a receiver. Since the Explana on: Blind algorithms exploit the
baseband complex envelope expression can characteris cs of the transmi ed signal and
be used to represent bandpass waveform, do not require training sequence. These type
the channel response, the demodulated of algorithm are able to acquire equaliza on
signal and adap ve equalizer algorithm are through property restoral techniques of
usually simulated and implemented at transmi ed signal.
baseband.
10. Which of the following is a blind
7. Equalizer is ________ of the channel. algorithm?
a) Opposite a) Linear adap ve algorithms
b) Same characteris cs b) Constant modulus algorithm
c) Inverse filter c) Non-linear adap ve algorithms
d) Add on d) Spa ally adap ve algorithms

Answer: c Answer: b
Explana on: An equalizer is actually an Explana on: Blind algorithm technique uses
inverse filter of the channel. The goal of algorithms such as the constant modulus
algorithm (CMA) and the spectral coherence Answer: d
restoral algorithm (SCORE). CMA is used for Explana on: Some of the proper es of
constant envelope modula on and forces the Fourier transform are duality property, me
equalizer weights to maintain a constant scaling property, me shi ing property,
envelope on the received signal. modula on property and many more.

4. A base-band signal can be up-converted

using
a) Sine wave
UNIT IV DIGITAL b) Cosine wave
c) Filtering
MODULATION SCHEME d) None of the men oned

TOPIC 4.1 GEOMETRIC Answer: b

Explana on: A base-band signal can be up-
REPRESENTATION OF SIGNALS
converted to band-pass filter by applying
cosine wave.
1. In the digital communica on system,
signals in different frequency bands are 5. A band-pass signal can be down-converted
a) Orthogonal using
b) Non orthogonal a) Sine wave
c) Orthogonal & Non orthogonal b) Cosine wave
d) None of the men oned c) Time delayed wave
d) None of the men oned
Answer: a
Explana on: In digital communica on Answer: b
system, signals from different frequency Explana on: For down-conversion of a band-
bands are orthogonal thus interference won’t pass signal also cosine signal is used and
occur. mul plied with it.

2. Proper es of impulse func on are 6. In down-conversion mul plica on with

a) Symmetry cosine wave is followed by
b) Time scaling a) Low pass filter
c) Shi ing b) High pass filter
d) All of the men oned c) Bandpass filter
d) Bandstop filter
Answer: d
Explana on: Some of the proper es of Answer: a
impulse func on are symmetry, me scaling Explana on: Downconversion of bandpass
and shi ing. signal includes mul plica on with sine wave
followed by low pass filtering.
3. Proper es of Fourier transform are
a) Duality property 7. ADSL has _____ informa on channels.
b) Time shi ing property a) One
c) Modula on property b) Three
d) All of the men oned
c) Four 11. A band-pass signal has a Fourier
d) None of the men oned transform equal to
a) One
Answer: b b) Zero
Explana on: Asymmetric digital subscriber c) Infinity
line has three informa on channels – a high d) Cannot be determined
speed downstream channel, ISDN channel
and medium speed duplex channel. Answer: b
Explana on: A band-pass signal has a Fourier
8. Fourier transform of a signal gives the transform equal to zero for all value in both
a) Frequency content frequency and me domain.
b) Bandwidth
c) Frequency content & Bandwidth 12. A band-pass signal has
d) None of the men oned a) DC component
b) No DC component
Answer: c c) No side lobes
Explana on: Fourier transform of a signal d) Cannot be determined
give the frequency content and also
determines the bandwidth of the signal. Answer: b
Explana on: A band-pass signal has no DC
9. Random things in a communica on system components and has Fourier transform equal
are to zero. Outside the band it will not be
a) Timing offset exactly zero. Thus this results in presence of
b) Device frequency side lobes.
c) A enua on
d) All of the men oned 13. Which are orthonormal signal
representa on?
Answer: d a) Sine and cosine at same frequency
Explana on: Some of the random things in b) Wavelets
the communica on system are noise in the c) Complex sinusoids at a different frequency
channel, a enua on, fading, channel d) All of the men oned
filtering, device frequency, phase and ming
offset. Answer: d
Explana on: Some of the common
10. Which can be used for periodic and non orthonormal signal representa ons are sine
periodic? and cosine at the same frequency, Fourier
a) Fourier series serier, sinc func ons centered at sampling
b) Fourier transforms mes, wavelets etc.
c) Fourier series & transforms
d) None of the men oned 14. Constella on diagram is plo ed in
a) Constella on space
Answer: b b) Signal space
Explana on: Fourier series is limited to only c) Orthogonal space
periodic signals where as Fourier transforms d) Boundary space
and laplace transforms can be used for both
periodic and non periodic signals.
Answer: b Answer: a
Explana on: The constella on diagram is Explana on: Con nuous frequency shi
plo ed in a space called as signal space. keying has no phase discon nuity between
symbols.
15. Cumula ve distribu ve func on is
a) Non nega ve 3. FSK recep on is
b) Non decreasing a) Phase Coherent
c) Non nega ve & decreasing b) Phase non coherent
d) None of the men oned c) Phase Coherent & non coherent
d) None of the men oned
Answer: c
Explana on: Cumula ve distribu on Answer: c
func on is non nega ve and non decreasing Explana on: Recep on of FSK can be either
func on. phase coherent or phase non coherent.

16. Which are non nega ve func ons? 4. FSK recep on uses
a) PDF a) Correla on receiver
b) PMF b) PLL
c) PDF & PMF c) Correla on receiver & PLL
d) None of the men oned d) None of the men oned

Answer: c Answer: c
Explana on: PDF, PMF and CDF are non Explana on: Frequency shi keying uses
nega ve func ons. correla on receiver and phase locked loop.

5. In non coherent recep on _____ is

TOPIC 4.2 GENERATION, DETECTION, measured.
PSD & BER OF COHERENT BPSK AND a) Phase
QAM b) Energy
c) Power
1. Average energy per bit is given by d) None of the men oned
a) average energy symbol/log2 M
b) average energy symbol * log2 M Answer: b
c) log2 M/ Average energy symbol Explana on: In non coherent recep on of
d) none of the men oned FSK, energy in each frequency is measured.

6. Every frequency has ____ orthogonal

Answer: a
Explana on: Average energy per bit is given func ons.
a) One
by average energy symbol divided by log2 M.
b) Two
2. Which FSK has no phase discon nuity? c) Four
a) Con nuous FSK d) Six
b) Discrete FSK
c) Uniform FSK Answer: b
Explana on: Every frequency has two
d) None of the men oned
orthogonal func ons – sine and cosine.
7. If we correlate the received signal with any Answer: b
one of the two orthogonal func on, the Explana on: Matched filter is a
obtained inner product will be demodula on technique with LTI.
a) In phase
b) Quadrature 11. Which is called as on-off keying?
c) Zero a) Amplitude shi keying
d) Cannot be determined b) Uni-polar PAM
c) Amplitude shi keying & Uni-polar PAM
Answer: c d) None of the men oned
Explana on: If we correlate the received
signal with only one of the orthogonal Answer: c
func on for example sine, the inner product Explana on: Amplitude shi keying and uni-
obtained will be zero. polar PAM both schemes are called as on off
keying.
8. If we correlate the received signal with
both orthogonal func on the inner product 12. QAM uses ______ as the dimensions.
will be a) In phase
a) In phase b) Quadrature
b) Quadrature c) In phase & Quadrature
c) In phase and quadrature d) None of the men oned
d) Unity
Answer: c
Answer: c Explana on: QAM uses in phase and
Explana on: If we correlate the received quadrature which is cosine and sine
signal with both the orthogonal func on, the respec vely as the dimensions.
two inner products obtained will be in phase
and quadrature. 13. Which has same probability of error?
a) BPSK and QPSK
9. Simula on is used to determine b) BPSK and ASK
a) Bit error rate c) BPSK and PAM
b) Symbol error rate d) BPSK and QAM
c) Bit error
d) Symbol error Answer: c
Explana on: BPSK is similar to bipolar PAM
Answer: a and both have same probability of error.
Explana on: A simula on of digital
communica on system is used to es mate 14. Which system uses QAM?
bit error rate. a) Digital microwave relay
b) Dial up modem
10. Matched filter is a _____ technique. c) Digital microwave relay & Dial up modem
a) Modula on d) None of the men oned
b) Demodula on
c) Modula on & Demodula on Answer: c
d) None of the men oned Explana on: Digital microwave relay, dial up
modem and etc uses QAM modula on
technique.
 two values according to the two possible
TOPIC 4.3 BFSK & QPSK
values.
a) Amplitude
1. In linear modula on technique b) Phase
__________ of transmi ed signal varies c) Frequency
linearly with modula ng digital signal. d) Angle
a) Amplitude
b) Frequency Answer: b
c) Phase Explana on: In binary phase shi keying
d) Angle (BPSK), the phase of a constant amplitude
carrier signal is switched between two
Answer: a possible values m1 and m2. These two values
Explana on: In linear modula on technique, corresponds to binary 1 and 0 respec vely.
the amplitude of transmi ed signal varies
linearly with modula ng digital signal. It is a 5. By applying cos(2π ), BPSK signal is
form of digital modula on technique. equivalent to ________
a) Double sideband suppressed carrier
2. Linear modula on techniques are not amplitude modulated waveform
bandwidth efficient. b) Single sideband suppressed carrier
a) True amplitude modulated waveform
b) False c) Frequency modulated waveform
d) SSB amplitude waveform
Answer: b
Explana on: Linear modula on techniques Answer: a
are bandwidth efficient. They are used in Explana on: The BPSK signal is equivalent to
wireless communica on systems when there a double sideband suppressed carrier
is an increasing demand to accommodate amplitude modulated waveform, where
more and more users within a limited cos(2π ) is applied as the carrier. Hence, a
spectrum. BPSK signal can be generated using a
balanced modulator.
3. Which of the following is not a linear
modula on technique? 6. BPSK uses non-coherent demodulator.
a) OQPSK a) True
b) π/4 QPSK b) False
c) FSK
d) BPSK Answer: b
Explana on: BPSK uses coherent or
Answer: c synchronous demodula on. It requires the
Explana on: OQPSK, π/4 QPSK and BPSK are informa on about the phase and frequency
the most popular linear modula on of the carrier be available at the receiver.
techniques. They have very good spectral
efficiency. However, FSK is an non-linear 7. DPSK uses coherent form of PSK.
modula on technique. a) True
b) False
4. In BPSK, the ________ of constant
amplitude carrier signal is switched between
Answer: b (QPSK) has twice the bandwidth of BPSK. It is
Explana on: Differen al phase shi keying because two bits are transmi ed in a single
uses noncoherent form of phase shi keying. modula on symbol. The phase of the carrier
Noncoherent form avoids the need for a takes on one of the four equally spaced
coherent reference signal at the receiver. values, where each value of phase
Noncoherent receivers are also easy and corresponds to a unique pair of message bit.
cheap to build.
11. QPSK provides twice the bandwidth
8. In DPSK system, input signal is differen ally efficiency and _______ energy efficiency as
encoded and then modulated using a compared to BPSK.
________ modulator. a) Twice
a) Amplitude b) Half
b) Frequency c) Same
c) BPSK d) Four mes
d) QPSK
Answer: c
Answer: c Explana on: The bit error probability of
Explana on: In DPSK system, input binary QPSK is iden cal to BPSK but twice as much
sequence is first differen ally encoded and data can be sent in the same bandwidth.
then modulated using a BPSK modulator. The Thus, when compared to BPSK, QPSK
differen ally encoded sequence is generated provides twice the spectral efficiency with
from input binary sequence by exactly the same efficiency.
complimen ng their modulo-2 sum.
12. What is the full form of OQPSK?
9. The energy efficiency of DPSK is a) Op cal Quadrature Phase Shi Keying
_________ to coherent PSK. b) Orthogonal Quadrature Pulse Shi Keying
a) Superior c) Orthogonal Quadrature Phase Shi Keying
b) Same d) Offset Quadrature Phase Shi Keying
c) Zero
d) Inferior Answer: d
Explana on: OQPSK stands for offset
Answer: d quadrature phase shi keying. It is a modified
Explana on: The energy efficiency of DPSK is form of QPSK which is less suscep ble to
inferior to that of coherent PSK by about 3 deleterious effects and supports more
dB. But, it has an advantage of reduced efficient amplifica on. OQPSK is some mes
receiver complexity. also called staggered QPSK.

10. QPSK has ________ the bandwidth 13. The bandwidth of OQPSK is _______ to
efficiency of BPSK. QPSK.
a) Twice a) Iden cal
b) Same b) Twice
c) Half c) Half
d) Four mes d) Four mes

Answer: a Answer: a
Explana on: Quadrature phase shi keying Explana on: The spectrum of an OQPSK
signal is iden cal to that of QPSK signal. in both frequency and phase with the
Hence, both signals occupy the same received signal.
bandwidth. The staggered alignment of the
even and odd bit streams in OQPSK signal 2. Coherent modula on requires ____ level
does not change the nature of spectrum. of synchroniza on.
a) One
14. QPSK signals perform be er than OQPSK b) Two
in the presence of phase ji er. c) Three
a) True d) None of the men oned
b) False
Answer: c
Answer: b Explana on: Coherent modula on requires
Explana on: OQPSK signal perform be er three levels of synchroniza on – phase
than QPSK in the presence of phase ji er. It is symbol and frame.
due to the presence of noisy reference signal
at the receiver. 3. Non coherent system requires
a) Phase synchroniza on
15. Which of the following is not a detec on b) Frequency synchroniza on
technique used for detec on of π/4 QPSK c) Phase & Frequency synchroniza on
signals? d) None of the men oned
a) Baseband differen al detec on
b) IF differen al detec on Answer: c
c) FM discriminator detec on Explana on: Non coherent system requires
d) Envelope detec on frequency synchroniza on.

Answer: d 4. For block codes _____ is necessary.

Explana on: There are various types of a) Phase synchroniza on
detec on techniques used for the detec on b) Frequency synchroniza on
of π/4 QPSK signals. They include baseband c) Frame synchroniza on
differen al detec on, IF differen al detec on d) None of the men oned
and FM discriminator detec on.
Answer: c
Explana on: Frame synchroniza on is
TOPIC 4.4 CARRIER necessary when the informa on is organized
SYNCHRONIZATION in blocks or messages of some uniform
number of symbols. Thus block code needs
1. In phase lock which parameter is frame synchroniza on.
synchronized
a) Frequency 5. The synchroniza on necessary for BPSK is
b) Phase a) Frequency tracking
c) Frequency & Phase b) Bit ming
d) None of the men oned c) Phase tracking
d) All of the men oned
Answer: c
Explana on: Being in phase lock means that Answer: d
the receiver’s local oscillator is synchronized Explana on: Non coherently detected BPSK
is the simplest digital receiver and it requires 9. Which method has fast acquisi on and can
frequency tracking, bit ming work without return link?
synchroniza ons and also phase a) Open loop method
synchroniza on. b) Closed loop method
c) Open & Closed loop method
6. Transmi er synchroniza on implies d) None of the men oned
a) One way communica on
b) Two way communica on Answer: a
c) One & Two way communica on Explana on: The main advantage of open
d) None of the men oned loop method is that acquisi on is fast, the
procedure can work without return link and
Answer: b the amount of real me computa on that is
Explana on: Transmi er plays a role in required is small.
synchroniza on by varying the frequency and
ming of its transmissions to correspond to 10. Which method has two way link?
expecta on of receiver. This transmi er a) Open loop method
synchroniza on implies two way b) Closed loop method
communica on. c) Open & Closed loop method
d) None of the men oned
7. As the synchroniza on levels increases,
cost Answer: b
a) Decreases Explana on: Closed loop method requires
b) Increases return link, large amount of real me
c) Remains the same processing and has two way link.
d) None of the men oned
11. Which method requires external
Answer: b authority and is inflexible?
Explana on: For each level increase in a) Open loop method
synchroniza on levels, cost increases. b) Closed loop method
c) Open & Closed loop method
8. Synchroniza on is used in system which d) None of the men oned
has
a) Non coherent modula on techniques Answer: a
b) Many users accessing Explana on: Open loop method is inflexible,
c) Non coherent modula on techniques & does not adjust quickly to unplanned
Many users accessing changes and needs external authority that
d) None of the men oned provides prior knowledge, where as closed
loop method does not need all these.
Answer: c
Explana on: For communica on system 12. Which method needs precorrect me?
using non coherent modula on techniques a) Open loop method
and many users accessing the central b) Closed loop method
communica on node, synchroniza on is c) Open & Closed loop method
necessary. d) None of the men oned
Answer: a b) Small
Explana on: In open loop method the c) Large & Small
frequency and me are precorrected. d) None of the men oned

13. In open loop method, the me reference Answer: a

error __________ with respect to me. Explana on: The system with increased
a) Increases exponen ally signal to noise ra o will allow it to tolerate
b) Decreases exponen ally larger ming error so the improvement is
c) Increases quadra cally error performance is rapid.
d) Decreases quadra cally

Answer: a
TOPIC 4.5 PRINCIPLE OF DPSK.
Explana on: In open loop transmi er
synchroniza on system, the me reference 1. The correla ng detector is also known as
error increases quadra cally with me. a) Maximum likelihood detector
b) Minimum likelihood detector
14. When a terminal is able to u lize the c) Maximum & Minimum likelihood detector
measurements made on the return link it is d) None of the men oned
called as
a) Open loop method Answer: a
b) Closed loop method Explana on: Coherent detector considers
c) Quasi close loop method phase as the most important parameter. This
d) None of the men oned coherent detector is also known as maximum
likelihood detector.
Answer: c
Explana on: The case where a terminal is 2. The minimum nyquist sampling rate is
able to u lize the measurements made on a given as, fs =
return link signal is called as quasi closed a) 1/T
loop transmi er synchroniza on. b) T
c) 2/T
15. Which reduces the effec ve distance d) 2T
between signals in signal space?
a) Time error Answer: a
b) Frequency offset Explana on: The input signal comprises of a
c) Time error & Frequency offset prototype signal plus noise and the
d) None of the men oned bandwidth is 1/2T where T is the symbol me
and minimum nyquist sampling rate can be
Answer: c given as 2W or 1/T.
Explana on: Time error or frequency offset
or combina on of both will reduce the 3. Phase-locked loop circuitry is used for
effec ve distance between signals in signal a) Carrier wave recovery
space and degrade error performance. b) Phase es ma on
c) Carrier wave recovery & Phase es ma on
16. The system which has ______ signal to d) None of the men oned
noise ra o can tolerate larger ming error.
a) Large
Answer: c 7. The minimum tone separa on corresponds
Explana on: The phase locked loop circuitry to
locks on the arriving carrier wave and a) T
es mates its phase. b) 1/T
c) 2T
4. In differen al PSK the date is d) T/2
a) Encoded differen ally
b) Decoded differen ally Answer: b
c) Encoded & Decoded differen ally Explana on: In non coherent detec on the
d) None of the men oned minimum tone separa on corresponds to
1/T.
Answer: a
Explana on: In this method, the data is 8. Matched filter is used for
encode deferen ally that is the presence of a) Coherent detec on
binary zero or one is manifested by symbol’s b) Non coherent detec on
similarity or difference when compared to c) Coherent & Non coherent detec on
that of the previous symbol. d) None of the men oned

5. Envelope detector consists of Answer: a

a) Rec fier and high pass filter Explana on: Matched filter is used for
b) Rec fier and low pass filter coherent detec on. It cannot be used for non
c) Amplifier and low pass filter coherent detec on because matched filter
d) Amplifier and high pass filter output is a func on of unknown angle α.

Answer: b 9. In differen al encoding the _________

Explana on: An envelope detector consists different between two wave forms is
of a rec fier and a low pass filter. The measured.
detectors are matched to the envelopes and a) Magnitude
not to the signal themselves. b) Frequency
c) Phase
6. The minimum required spacing is the d) Time period
difference between the
a) Center of the spectral main lobe and first Answer: c
zero crossing Explana on: In differen al encoding, the
b) First and second zero crossing phase of the present signal waveform is
c) First and last zero crossing compared with the phase of the previous
d) None of the men oned signal.

Answer: a 10. The error probability of DPSK is ________

Explana on: The frequency difference worse than PSK.
between the center of the spectral main lobe a) Twice
and the first zero crossing is called as the b) 3 db
minimum required spacing in non coherent c) Twice (3db)
detec on. d) None of the men oned
Answer: c Answer: a
Explana on: DPSK has twice as much as Explana on: ASCII code is a fixed length
noise than in PSK. The error probability in code. It has a fixed length of 7 bits.
DPSK is twice (3db) worse than PSK.
4. Which reduces the size of the data?
a) Source coding
b) Channel coding
c) Source & Channel coding
UNIT V ERROR CONTROL d) None of the men oned
CODING Answer: a
Explana on: Source coding reduces the size
TOPIC 5.1 CHANNEL CODING of the data and channel coding increases the
size of the data.
THEOREM
5. In digital image coding which image must
1. While recovering signal, which gets be smaller in size?
a enuated more? a) Input image
a) Low frequency component b) Output image
b) High frequency component c) Input & Output image
c) Low & High frequency component d) None of the men oned
d) None of the men oned
Answer: b
Answer: b Explana on: In digital image coding, output
Explana on: High frequency components are image must be smaller than the input image.
a enuated more when compared to low
frequency components while recovering the 6. Which coding method uses entropy
signals. coding?
a) Lossless coding
2. Mutual informa on should be b) Lossy coding
a) Posi ve c) Lossless & Lossy coding
b) Nega ve d) None of the men oned
c) Posi ve & Nega ve
d) None of the men oned Answer: b
Explana on: Lossy source coding uses
Answer: c entropy coding.
Explana on: Mutual informa on can also be
nega ve. 7. Which achieves greater compression?
a) Lossless coding
3. ASCII code is a b) Lossy coding
a) Fixed length code c) Lossless & Lossy coding
b) Variable length code d) None of the men oned
c) Fixed & Variable length code
d) None of the men oned Answer: b
Explana on: Lossy coding achieves greater
compression where as lossless coding Answer: a
achieves only moderate compression. Explana on: The cyclic codes are a subclass
of linear codes. It is designed using feedback
8. A code is a mapping from shi registers.
a) Binary sequence to dicrete set of symbols
b) Discrete set of symbols to binary sequence 2. A cyclic code can be generated using
c) All of the men oned a) Generator polynomial
d) None of the men oned b) Generator matrix
c) Generator polynomial & matrix
Answer: b d) None of the men oned
Explana on: A code is a mapping from
discrete set of symbols to finite binary Answer: a
sequence. Explana on: A cyclic code can be generated
using generator polynomial and block codes
9. Which are uniquely decodable codes? can be generated using generator matrix.
a) Fixed length codes
b) Variable length codes 3. The feedback shi register circuit is called
c) Fixed & Variable length codes as
d) None of the men oned a) Mul plying circuit
b) Dividing circuit
Answer: a c) Feedback circuit
Explana on: Fixed length codes are uniquely d) Shi ing circuit
decodable codes where as variable length
codes may or may not be uniquely Answer: b
decodable. Explana on: The cyclic shi of a code-word
polynomial and encoding involves division of
10. A rate distor on func on is a one polynomial by another. Thus this
a) Concave func on feedback shi register is also called as
b) Convex func on dividing circuit.
c) Increasing func on
d) None of the men oned 4. In the dividing circuit, the parity
polynomial is obtained by the
Answer: b a) Quo ent
Explana on: A rate distor on func on is a b) Remainder
monotone decreasing func on and also a c) Dividend
convex func on. d) Divisor

Answer: b
TOPIC 5.2 LINEAR BLOCK CODES AND
Explana on: The parity polynomial is the
CYCLIC CODES remainder a er diving by the generator
polynomial it is available in the register a er
1. The cyclic codes are designed using n shi s through the n-k stage feedback
a) Shi registers with feedback registers.
b) Shi registers without feedback
c) Flipflops 5. The received code contains an error if the
d) None of the men oned syndrome vector is
a) Zero 9. The rate of a block code is the ra on of
b) Non zero a) Block length to message length
c) Infinity b) Message length to block length
d) None of the men oned c) Message weight to block length
d) None of the men oned
Answer: b
Explana on: If the syndrome is an all zero Answer: b
vector then the received code-word is a valid Explana on: The rate of a block code is the
code. If the syndrome is a non zero vector ra o between its message length and the
then the received code has errors. block length, R=k/n.

6. Block codes are generated using 10. Linear codes are used for
a) Generator polynomial a) Forward error correc on
b) Generator matrix b) Backward error correc on
c) Generator polynomial & matrix c) Forward error detec on
d) None of the men oned d) Backward error detec on

Answer: b Answer: a
Explana on: Block codes are generated using Explana on: Linear codes are used in
generator matrix and cyclic codes are forward error correc on. It allows for more
generated using generator polynomial. efficient encoding and decoding procedures.

7. Extended go-lay code is formed by 11. The k-bit message forms ____ dis nct
a) Adding overall parity bit to perfect go-lay messages which is referred to as k-tuples.
code a) 2k
b) Ex-oaring overall parity bit with perfect go- b) K2
lay code c) 2k
c) Ex-oaring each bit of go-lay code d) 21/k
d) Dividing the overall parity bit with perfect
go-lay code Answer: c
Explana on: The k bit messages for 2k
Answer: a dis nct message sequences which are
Explana on: Extended go-lay code is formed referred to as k-tuples or sequence of k
by adding overall parity bit with the perfect digits.
bit known as the golay code.
12. The sum of any two vectors in subset S is
8. Block length is the _____________ in the also in S. This is called as
code word. a) Addi on property
a) Number of elements b) Subset property
b) Distance between elements c) Closure property
c) Number of parity bits d) Similarity property
d) None of the men oned
Answer: c
Answer: a Explana on: The closure property states that
Explana on: The block length n is the the sum of any two vectors in subset S is also
number of elements in the code word. in S.
13. To avoid corrup on during transmission, code word can be given as the number of
the code-word should be non zero elements and the distance between
a) Near two code words is the hamming distance
b) Far apart between them.
c) Far
d) None of the men oned 17. Some examples of linear codes
a) Hamming code
Answer: b b) Reed-Solomon code
Explana on: The code-words should be far c) Parity code
apart from one and another as possible so d) All of the men oned
even when the vectors experience some
corrup on they may s ll be correctly Answer: d
decoded. Explana on: Some examples of linear codes
are block codes, parity codes, reed-Solomon
14. In a standard matrix set code-word there codes, hamming code, cyclic codes,
are _______ cosset. polynomial codes, go-lay codes etc.
a) 2k
b) 2n+k
TOPIC 5.3 HAMMING CODES
c) 2n-k
d) 2n
1. The most common hamming codes are a
Answer: c generalized version of?
Explana on: Each n-tuple appears in only a) Hamming(7, 4) code
one loca on none are missing and none are b) Hamming(8, 4) code
replicated. There are 2n-k cosets. c) Hamming(6, 3) code
d) Hamming(5, 7) code
15. Syndrome is calculated by
a) HT/r Answer: a
b) rHT Explana on: The most common hamming
c) rH codes generalize to form hamming(7, 4)
d) None of the men oned code. It encodes four bits of data into seven
bits by adding three parity bits.
Answer: b
Explana on: The syndrome is calculated 2. What is the minimal Hamming distance
using S=rHT. between any two correct codewords?
a) 1
16. The _____ of the code-word is the b) 2
number of non zero elements. c) 3
a) Size d) 4
b) Weight
c) Distance Answer: c
d) Subspace Explana on: Since we use a generalized
version of Hamming(7, 4) code, the minimal
Answer: b hamming distance is 3. It cannot correct
Explana on: The size of the code-word is the burst errors.
number of code words. The weight of the
3. Why do we require hamming codes? Answer: b
a) Error correc on Explana on: Hamming codes are a class of
b) Encryp on only binary linear codes, hence r>=2. For a
c) Decryp on hamming(7, 4) code, the block length ‘n’ is
d) Bit stuffing 2r-1 where r is the parity bit. Here, r=3.
Answer: a 7. What is the message length ‘k’ of a
Explana on: Hamming codes are used for Hamming(7,4) code?
the purpose of error detec on and a) 2r-1
correc on. It is also used for channel
encoding and decoding. They are linear-error b) 2r-r+1
correc ng codes. c) 2r-r-1
d) 2r+1-r
4. Hamming codes can be used for both
single-bit error and burst error detec on and Answer: c
correc on. Explana on: Hamming codes are a class of
a) True binary linear codes, hence r>=2. For a
b) False hamming(7,4) code, the message length ‘k’ is
2r-r-1 where r is the parity bit. Here, r=3.
Answer: b
Explana on: Hamming bits are suitable only 8. What is the rate of hamming codes?
for single-bit error detec on and correc on
a) 1-[r/(2r-1)]
and two bit error detec on. It is very unlikely
to detect burst errors. b) 1-(r/2r)
c) 1+(r/2r)
5. Who invented Hamming codes? d) r/2r+1
a) Richard Hamming
b) Ross Hamming Answer: a
c) Shannon Explana on: Rate of a hamming code is
d) Huffman message length divided by block length (i.e.)
2r-r-1/2r-1 = 1-[r/(2r-1)]. It is the highest rate
Answer: a
for a minimum distance of three.
Explana on: Richard W. Hamming invented
hamming codes in Bell Telephone Laboratory 9. A two-out-of-five code consists of
to minimize the errors in punched card _________
readers. Huffman invented huffman codes. a) Two 0s and three 1s
Shannon invented Shannon-Fanno codes. b) Three 0s and two 1s
c) Four 0s and one 1s
6. What is the total block length ‘n’ of a
d) One 0s and four 1s
Hamming code?
a) 2r Answer: b
b) 2r-1 Explana on: A two-out-of-five code consists
c) 2r-1-1 of three 0s and two 1s. Hence, it contains ten
possible combina ons to represent digits
d) 2r+1
from 0-9.
10. Including a parity bit along with the data Answer: c
surely detects the errors. Explana on: The code rate of a repe on
a) true hamming code is the second number divided
b) false by the first number. Here, it is 1/3.

Answer: b 14. For a hamming code of parity bit m=8,

Explana on: If error has occurred in a data what is the total bits and data bits?
string, parity will change inorder to indicate a) (255, 247)
errors. However, if the error occurs in parity b) (127, 119)
bit, the error goes undetected. c) (31, 26)
d) (0, 8)
11. ________ is the mechanism of sending
data bits mul ple mes to ensure Answer: a
consistency. Explana on: Total bits are computed as, 2m-
a) Repe on 1 = 28-1 =255.
b) Duplica on
c) Mirroring Data bits are computed as 2m-m-1= 28-8-1=
d) Redundancy 247.

Answer: a 15. What is the rate of the hamming code of

Explana on: Repea ng data bits mul ple parity bit m=8?
mes is done to ensure consistency. If the a) 0.94
data bit to be sent is a 1, a n=3 repe on b) 0.92
code will send 111. If the bits are not the c) 0.90
same, an error has occurred. d) 0.97

12. An Extended hamming code is also called Answer: d

as __________ Explana on: For a hamming code of parity
a) SEDDEC bit 8, total bits = 255 and data bits = 247.
b) SEDDED Rate= data bits/ total bits
c) SECDED = 247/255 = 0.969 = 0.97.
d) SECDEC
TOPIC 5.4 CONVOLUTIONAL CODES,
Answer: c VITERBI DECODER
Explana on: An Extended Hamming code is
also called as SECDED (Single Error Correc on
Double Error Detec on). The most popular 1. Block codes can achieve a larger coding
codes are (72, 64) code and (127,120) code. gain than convolu on coding.
a) True
13. What is the code rate of a repe on b) False
Hamming code (3, 1)?
a) 1 Answer: b
b) 3 Explana on: Convolu on code can achieve a
c) 1/3 larger coding gain that can be achieved using
d) 1.3 a block coding with the same complexity.
Their mapping is highly structured, enabling a
decoding method considerably different from for convolu onal codes are Fano’s sequen al
block codes. coding, stack algorithm and feedback coding.

2. Which of the following indicates the 5. Viterbi algorithm performs ____________

number of input bits that the current output decoding of convolu onal codes.
is dependent upon? a) Maximum likelihood
a) Constraint length b) Maximum a posteriori
b) Code length c) Minimum square
c) Search window d) Minimum mean square
d) Informa on rate
Answer: a
Answer: a Explana on: Viterbi algorithm performs
Explana on: Constraint length determines maximum likelihood decoding of
the number of input data bits that the convolu onal codes. The algorithm was first
current output is dependent upon. The developed by A.J. Viterbi. It is one of the
constraint length determines how powerful most important algorithm used for decoding
and complex the code is. convolu onal codes.

3. Which of the following is not a way to 6. Fano’s algorithm searches all the paths of
represent convolu on code? trellis diagram at same me to find the most
a) State diagram probable path.
b) Trellis diagram a) True
c) Tree diagram b) False
d) Linear matrix
Answer: b
Answer: d Explana on: Fano’s algorithm searches for
Explana on: Linear matrix is not a way to the most probable path through the trellis
represent convolu on code. Various ways of diagram by examining one path at a me.
represen ng convolu on codes are generator The error rate performance of Fano’s
matrix, generator polynomial, logic tables, algorithm is comparable to Viterbi’s
state diagram, tree diagram and trellis algorithm.
diagram.
7. Which of the following is not an advantage
4. Which of the following is not an algorithm of Fano’s algorithm in comparison to Viterbi’s
for decoding convolu on codes? algorithm?
a) Viterbi algorithm a) Less storage
b) Stack algorithm b) Large constraint length
c) Fano’s sequen al coding c) Error rate
d) Ant colony op miza on d) Small delays

Answer: d Answer: d
Explana on: There are a number of Explana on: In comparison to Viterbi
techniques for decoding convolu on codes. decoding, sequen al decoding has a
The most important of these methods is significantly larger delay. In advantage over
Viterbi algorithm. Other decoding algorithms Viterbi decoding is that it requires less
storage, and thus codes with larger constraint digital message data by encoding the source
lengths can be employed. informa on into a code sequence.

8. In comparison to stack algorithm, Fano’s 10. Which decoding method involves the
algorithm is simpler. evalua on by means of Fano’s algorithm?
a) True a) Maximum Likelihood Decoding
b) False b) Sequen al Decoding
c) Maximum a priori
Answer: b d) Minimum mean square
Explana on: In comparison to Fano’s
algorithm, the stack algorithm is Answer: b
computa onally simpler since there is no Explana on: Fano’s algorithm involves
retrac ng over the same path. But stack sequen al decoding. It searches for the most
algorithm requires more storage than Fano’s probable path through the trellis by
algorithm. examining one path at a me.

9. Which of the following is not an error 11. In Viterbi’s algorithm, the selected paths
correc on and detec on code? are regarded as __________
a) Block code a) Survivors
b) Convolu onal codes b) Defenders
c) Passive codes c) Destroyers
d) Turbo codes d) Carriers

Answer: c Answer: a
Explana on: There are three basic types of Explana on: In Viterbi’s algorithm, the
error correc on and detec on codes. They selected paths are regarded as survivors. The
are block codes, convolu onal codes and path thus defined is unique and corresponds
turbo codes. A channel coder operates on to the decoded output.