Convolution Encoding and Decoding MCQ’s

Read Time:1 Minute, 54 Second

This set of Digital Communications Systems Multiple Choice Questions & Answers (MCQs) focuses on “Convolution Encoding and Decoding”.

1. A binary symmetric channel is a
a) Discrete memoryless channel
b) Continuous memoryless channel
c) Discrete memory channel
d) Continuous memory channel

2. In maximum likelihood detector the error probability is
a) Maximum
b) Minimum
c) Zero
d) None of the mentioned

3. Binary symmetric channel is hard decision channel.
a) True
b) False

4. The measure of the amount of redundancy is given by
a) Code size
b) Code weight
c) Code rate
d) Minimum distance

5. How many number of transitions can be made at each bit time?
a) One
b) Two
c) Three
d) Half

6. Soft decision decoding requires
a) Less memory
b) More memory
c) More speed
d) None of the mentioned

7. Example for convolution encoder state diagram is
a) Tree diagram
b) Trellis diagram
c) Tree & Trellis diagram
d) None of the mentioned

8. The method used for representing convolution encoder are
a) Connection pictorial
b) State diagram
c) Tree diagram
d) All of the mentioned

9. Periodic truncation is done by
a) Appending zero to end of the input data sequence
b) Appending zero to the beginning of the input data sequence
c) Appending one’s to end of the data sequence
d) Appending one’s to beginning of the data sequence

10. Gaussian channel is a hard decision channel.
a) True
b) False

11. The number of k bit shift over which a single information bit influences the encoder output is given by
a) Code rate
b) Constraint length
c) Code length
d) Code weight

12. For a binary code, the maximum number of possible sequence made up of L branch words is
a) L2
b) 2L
c) 2L
d) L/2

13. Branch word synchronization is the process of determining the
a) Beginning of received sequence
b) Beginning of transmitted sequence
c) End of received sequence
d) End of transmitted sequence

14. If the quantization level of a demodulator output is ________ then it is called as soft decision decoding.
a) Equal to 2
b) More than 2
c) Less than 2
d) None of the mentioned

15. Finite state machines have
a) Past memories also
b) Only present and future memories
c) Only future memories
d) Only present memories

16. In maximum likelihood decoding technique, the likelihood function compares the
a) Joint probabilities
b) Individual probabilities
c) Conditional probabilities
d) None of the mentioned

17. In trellis diagram, the number of nodes ______ at successive branching.
a) Increases by 1
b) Doubles
c) Triples
d) None of the mentioned

0 %
0 %
0 %
0 %
0 %
0 %

Average Rating

5 Star
4 Star
3 Star
2 Star
1 Star

Leave a Reply

Your email address will not be published. Required fields are marked *

Previous post Cyclic and Linear Block Codes MCQ’s
Next post Reed-Solomon Code Properties MCQ’s