Scribd
Upload
114 views6 pages

DC Bits

This document contains 25 multiple choice questions related to digital communications topics such as quantization, modulation schemes, source coding, channel coding, and information theory. The questions cover concepts like quantization error, linear prediction, modulation techniques like PSK, QPSK, FSK, source entropy, error correction codes, and the Shannon-Hartley theorem for channel capacity.

Uploaded by

ev
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
114 views6 pages

DC Bits

This document contains 25 multiple choice questions related to digital communications topics such as quantization, modulation schemes, source coding, channel coding, and information theory. The questions cover concepts like quantization error, linear prediction, modulation techniques like PSK, QPSK, FSK, source entropy, error correction codes, and the Shannon-Hartley theorem for channel capacity.

Uploaded by

ev
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

DIGITAL COMMUNICATIONS

1. Quantization is done in order to


a) Improve the quality of the signal
b) Improve the SNR at high frequencies
c) Discretize the signal in the amplitude domain also.
d) Improve the SNR at low frequencies
2. In uniform quantization, as the step size is decreased the mean-square
value of quantization error will
a) decrease
b) increase
c) not change
d) none of these
Ans. A
3. The linear predictor in a DPCM system is generally implemented as
a) A transversal digital filter
b) A recursive digital filter
c) An analog RC filter
d) None of the above
Ans. A
4. The line code which suppress the dc component is
a) Bipolar RZ
b) Manchester code
c) Polar NRZ
d) Unipolar NRZ
ANS. B
5. One of the following bandpass digital modulation schemes is not suitable
for transmission over nonlinear bandpass channel
a) FSK
b) ASK
c) PSK
d) QPSK
Ans. B
6. Which one of the following digital bandpass modulation schemes cannot be
detected noncoherently?
a) FSK
b) ASK
c) PSK
d) QPSK
Ans. C
7. The signal space of QPSK system has a dimension of
a) 1
b) 3
c) 4
d) 2
Ans. D
8. For a specified average transmitted power the system that gives the lowest
probability of error among the following is
a) Noncoherent FSK system
b) Coherent FSK System
c) PSK System
d) Coherent ASK System
Ans. C
9. Huffman coding gives
a) An equal-length code which is unique
b) A variable-length code which is unique
c) An equal-length code which is not unique
d) A variable-length code which is not unique
Ans. D
10. For a continuous channel, the maximum rate of transfer of information, as
given by the Shannon-Hartley law, is possible if and only if the input signal
is
a) Uniformly distributed
b) Gaussian distributed
c) Gaussian distributed and has a flat spectrum
d) Having a flat spectrum
Ans. C
11. A discrete memoryless source produces 4 symbols whose probabilities are
in the ratio of 0.25:0.5:0.75:1.0 . The entropy of the source is
a) 1.8466 bits
b) 1.213 bits
c) 0.7853 bits
d) 2.2468 bits
12. Given c1= [1 1 0 1 0 1 1] and c2=[1 0 1 1 1 0 1] the difference in their
Hamming weights and the Hamming weight of their difference are
respectively
a) 1 , 4
b) 0 , 0
c) 4 , 0
d) 0 , 4
Ans. D
13. For a linear (7,4) block code the ratio of parity bits to message bits and the
code rate are respectively
a) 3/7 , 4/7
b) 4/7 , 3/7
c) ,4/7
d) 4/3 , 4/7
Ans. C
14. Which one is digital modulation technique?
a) AM
b) PAM
c) PCM
d) NONE
Ans. c
15. Consider the following statements about PCM
1. PCM is not noise resistant
2. PCM requires complex encoding and quantizing circuitry
3. PCM requires large bandwidth
Which of the above are correct?
A) 1 ONLY
B) 1,2,3
C) 2,3
D) 1 & 3
Ans. C
16. For telegraphy the most commonly used modulation system is
A) FSK
B) Two tone modulation
C) PCM
D) Single tone modulation
Ans. A
17. In the Mid-tread type of quantizer any input value lying between -0.5 to
+0.5 is mapped into an output value of
a) 0.5
b) 1
c) -0.5
d) 0
Ans. D
18. In binary PCM , the (SRN)
O

A) Increases linearly with the number of bits/code word
B) Increases as the square of the number of bits/ codeword
C) Does not depend upon the number of bits/codeword
D) Increases exponentially with the number of bits/second
Ans. D
19. A sinusoidal message signal is being transmitted by an 8-bit binary PCM. If
the bits/codeword is reduced by a factor of 2, the output signal-to-
quantization noise ratio will
a) Reduced by 3 dB
b) Reduce by 12 dB
c) Reduce by 6 dB
d) Reduce by 24 dB
Ans. A
20. Generally the linear predictor s weight are so chosen that
A) The absolute value of the prediction error is minimized
B) The mean square value of the prediction error is minimized
C) The maximum value of the prediction error is minimized
D) None of the above
Ans. B
21. The transfer function of the matched filter for a triangular pulse that is
symmetrical about t=T/2 is
a) Sinc function
b) Sine function
c) Sinc square function
d) Rectrangular function
Ans. C
22. For the same bit error and channel noise the p
e
of QPSK is the same as
that of
a) BPSK
b) Coherent BFSK
c) Noncoherent BFSK
d) DPSK
Ans. A
23. In a QPSK Signal , the carrier phase can sometimes change by as much as
a) /4
b) /2
c)
d) 3/2
Ans. C
24. A fair die is thrown and simultaneously a fair coin is also tossed. The die
showed up 3 and the coin showed up head . The information associated
with these is
a) 1.08 bits
b) 0.58 bits
c) 3.585 bits
d) 1.82 bits
Ans. C
25. If 1nat=k bits is equal to
a) 1.4428
b) 0.58 bits
c) 3.585 bits
d) 1.82 bits
ans. a

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy