WorksheetsDigital Communications Quiz
Total questions: 20
Worksheet time: 10mins
Probability of error for QPSK technique is
erfc (EbNo)
12erfc (EbNo)
12erfc (Eb2No)
None of the above
Matched filter
Is a non-linear filter
Produces maximum output SNR
All of the mentioned
None of the mentioned
Base band signal receiver is also called as Integrate and Dump filter receiver.
True
False
Which has same probability of error?
ASK and FSK
ASK and PSK
PSK and FSK
None of the mentioned
Which of the following relation is correct for average of Mutual Information I(X, Y)
H(X) + H(Y) - H (X, Y)
H(X) + H(Y) + H (X, Y)
H(X) - H(Y) - H (X, Y)
H(X) - H(Y) + H (X, Y)
Information rate is defined as
Information per unit time
Average number of bits of information per second
r.H, r- sampling rate and H- entropy
All of the above
Information content of an event is directly proportional to its probability of occurrence.
True
False
Channel capacity is _________________ proportional to Bandwidth.
Inversely
Directly
Efficiency of Source coding for Partitioning / Reduction value M=2 is
H(X)/2L
H(X)/L
2.H(X)/L
H(X)/4L
Entropy of N random variables is the _____ of the entropy of individual random variable.
Sum
Product
Sum of squares
Average
The channel capacity is measured in terms of:
Bits per channel
Number of input channel connected
Calls per channel
Number of output channel connected
The code length does not depend on the frequency of occurrence of characters.
True
False
The received code contains an error if the syndrome vector is
Infinity
Zero
non-Zero
None of the mentioned
Which of the following is not a way to represent convolution code?
State diagram
Trellis diagram
Tree diagram
Linear matrix
The minimum distance of an (n,k)=(7,4) linear block code is
1
2
3
4
For a (7, 4) block code, 7 is the total number of bits and 4 is the number of
Message bits
Redundant bits
Total bits- information bits
None of the above
A linear code in which
Sum of code words is also a code word
All-zero code word is a code word
Minimum hamming distance between two code words is equal to weight of any non-zero code word
All of the above
The capacity of an independent channel is
0
1
∞
None of the above
The cyclic codes are designed using
Shift registers with feedback
Shift registers without feedback
Flipflops
None of the mentioned
Example for convolution encoder state diagram is
Tree diagram
Trellis diagram
Tree & Trellis diagram
None of the mentioned
