adplus-dvertising
71. Block codes can achieve a larger coding gain than convolution coding.
a. True
b. False
c. May be True or False
d. Can't say
Discuss
Answer: (b).False

72. Which of the following indicates the number of input bits that the current output is dependent upon?
a. Constraint length
b. Code length
c. Search window
d. Information rate
Discuss
Answer: (a).Constraint length

73. Which of the following is not a way to represent convolution code?
a. State diagram
b. Trellis diagram
c. Tree diagram
d. Linear matrix
Discuss
Answer: (d).Linear matrix

74. Which of the following is not an algorithm for decoding convolution codes?
a. Viterbi algorithm
b. Stack algorithm
c. Fano’s sequential coding
d. Ant colony optimization
Discuss
Answer: (d).Ant colony optimization

75. Viterbi algorithm performs ____________ decoding of convolutional codes.
a. Maximum likelihood
b. Maximum a posteriori
c. Minimum square
d. Minimum mean square
Discuss
Answer: (a).Maximum likelihood

76. Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path.
a. True
b. False
c. May be True or False
d. Can't say
Discuss
Answer: (b).False

77. Which of the following is not an advantage of Fano’s algorithm in comparison to Viterbi’s algorithm?
a. Less storage
b. Large constraint length
c. Error rate
d. Small delays
Discuss
Answer: (d).Small delays

78. In comparison to stack algorithm, Fano’s algorithm is simpler.
a. True
b. False
c. May be True or False
d. Can't say
Discuss
Answer: (b).False

79. Which of the following is not an error correction and detection code?
a. Block code
b. Convolutional codes
c. Passive codes
d. Turbo codes
Discuss
Answer: (c).Passive codes

80. Which decoding method involves the evaluation by means of Fano’s algorithm?
a. Maximum Likelihood Decoding
b. Sequential Decoding
c. Maximum a priori
d. Minimum mean square
Discuss
Answer: (b).Sequential Decoding

Page 8 of 9