Ec8501 Digital Communication
Ec8501 Digital Communication
in
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.
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: c
Explana on: The self informa on of a
TOPIC 1.2 BINARY SYMMETRIC
random variable is infinity. CHANNEL
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: 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
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
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.
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.
Answer: a
UNIT II WAVEFORM CODING Explana on: Delta modula on is also
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
To prac ce tricky ques ons on all areas of a) Under sampling
Digital Communica on, here is complete set b) Over sampling
of 1000+ Mul ple Choice Ques ons and c) Aliasing
Answers. 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.
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?
M
c) Tariff computa on
d) All of the men oned Answer: b
Explana on: The process of quan za on
O
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
C
informa on exchange, tariff computa on, the quan za on noise can be reduced.
maintenance, billing etc.
T.
4. In PCM encoding, quan za on level varies
as a func on of ________
TOPIC 2.3 ADPCM & ADM a) Frequency
O
PRINCIPLES b) Amplitude
c) Square of frequency
SP
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
G
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
LO
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
.B
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
17
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.
SE
b) Quan za on error
3. Quan za on noise can be reduced by c) PAM error
________ the number of levels. d) Sampling error
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.
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: 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.
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: 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: 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
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.
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.
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
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.
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
of synchroniza on.
M
does not change the nature of spectrum.
a) One
14. QPSK signals perform be er than OQPSK b) Two
O
in the presence of phase ji er. c) Three
a) True d) None of the men oned
b) False
C
Answer: c
Answer: b Explana on: Coherent modula on requires
T.
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
O
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
SP
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
Answer: c
G
b) IF differen al detec on
c) FM discriminator detec on Explana on: Non coherent system requires
d) Envelope detec on frequency synchroniza on.
LO
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
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 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
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
decoding method considerably different from for convolu onal codes are Fano’s sequen al
block codes. coding, stack algorithm and feedback coding.
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.