Deck 8: Channel Coding and Error Correction Techniques

Full screen (f)
exit full mode
Question
For a error free channel, conditional probability should be

A)zero
B)one
C)equal to joint probability
D)equal to individual probability
Use Space or
up arrow
down arrow
to flip the card.
Question
Average effective information is obtained by

A)subtracting equivocation from entropy
B)adding equivocation with entropy
C)ratio of number of error bits by total number of bits
D)none of the mentioned
Question
Turbo codes are

A)forward error correction codes
B)backward error correction codes
C)error detection codes
D)none of the mentioned
Question
Components used for generation of turbo codes are

A)inter leavers
B)punching pattern
C)inter leavers & punching pattern
D)none of the mentioned
Question
Decoders are connected in series.
Question
The inter leaver connected between the two decoders is used to

A)remove error bursts
B)scatter error bursts
C)add error bursts
D)none of the mentioned
Question
In soft decision approach what does -127 mean?

A)certainly one
B)certainly zero
C)very likely zero
D)very likely one
Question
In soft decision approach 100 means?

A)certainly one
B)certainly zero
C)very likely zero
D)very likely one
Question
In soft decision approach 0 represents

A)certainly one
B)certainly zero
C)very likely zero
D)could be either zero or one
Question
In layering, n layers provide service to

A)n layer
B)n-1 layer
C)n+1 layer
D)none of the mentioned
Question
Which can be used as an intermediate device in between transmitter entity and receiver entity?

A)ip router
B)microwave router
C)telephone switch
D)all of the mentioned
Question
Which has comparatively high frequency component?

A)sine wave
B)cosine wave
C)square wave
D)none of the mentioned
Question
Which has continuous transmission?

A)asynchronous
B)synchronous
C)asynchronous & synchronous
D)none of the mentioned
Question
Which requires bit transitions?

A)asynchronous
B)synchronous
C)asynchronous & synchronous
D)none of the mentioned
Question
In synchronous transmission, receiver must stay synchronous for

A)4 bits
B)8 bits
C)9 bits
D)16 bits
Question
How error detection and correction is done?

A)by passing it through equalizer
B)by passing it through filter
C)by amplifying it
D)by adding redundancy bits
Question
Which is more efficient?

A)parity check
B)cyclic redundancy check
C)parity & cyclic redundancy check
D)none of the mentioned
Question
Which can detect two bit errors?

A)parity check
B)cyclic redundancy check
C)parity & cyclic redundancy check
D)none of the mentioned
Question
CRC uses

A)multiplication
B)binary division
C)multiplication & binary division
D)none of the mentioned
Question
Block codes can achieve a larger coding gain than convolution coding.
Question
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
Question
Which of the following is not a way to represent convolution code?

A)state diagram
B)trellis diagram
C)tree diagram
D)linear matrix
Question
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
Question
Fano's algorithm searches all the paths of trellis diagram at same time to find the most probable path.
Question
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
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/25
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 8: Channel Coding and Error Correction Techniques
1
For a error free channel, conditional probability should be

A)zero
B)one
C)equal to joint probability
D)equal to individual probability
zero
2
Average effective information is obtained by

A)subtracting equivocation from entropy
B)adding equivocation with entropy
C)ratio of number of error bits by total number of bits
D)none of the mentioned
subtracting equivocation from entropy
3
Turbo codes are

A)forward error correction codes
B)backward error correction codes
C)error detection codes
D)none of the mentioned
forward error correction codes
4
Components used for generation of turbo codes are

A)inter leavers
B)punching pattern
C)inter leavers & punching pattern
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
5
Decoders are connected in series.
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
6
The inter leaver connected between the two decoders is used to

A)remove error bursts
B)scatter error bursts
C)add error bursts
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
7
In soft decision approach what does -127 mean?

A)certainly one
B)certainly zero
C)very likely zero
D)very likely one
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
8
In soft decision approach 100 means?

A)certainly one
B)certainly zero
C)very likely zero
D)very likely one
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
9
In soft decision approach 0 represents

A)certainly one
B)certainly zero
C)very likely zero
D)could be either zero or one
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
10
In layering, n layers provide service to

A)n layer
B)n-1 layer
C)n+1 layer
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
11
Which can be used as an intermediate device in between transmitter entity and receiver entity?

A)ip router
B)microwave router
C)telephone switch
D)all of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
12
Which has comparatively high frequency component?

A)sine wave
B)cosine wave
C)square wave
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
13
Which has continuous transmission?

A)asynchronous
B)synchronous
C)asynchronous & synchronous
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
14
Which requires bit transitions?

A)asynchronous
B)synchronous
C)asynchronous & synchronous
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
15
In synchronous transmission, receiver must stay synchronous for

A)4 bits
B)8 bits
C)9 bits
D)16 bits
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
16
How error detection and correction is done?

A)by passing it through equalizer
B)by passing it through filter
C)by amplifying it
D)by adding redundancy bits
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
17
Which is more efficient?

A)parity check
B)cyclic redundancy check
C)parity & cyclic redundancy check
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
18
Which can detect two bit errors?

A)parity check
B)cyclic redundancy check
C)parity & cyclic redundancy check
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
19
CRC uses

A)multiplication
B)binary division
C)multiplication & binary division
D)none of the mentioned
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
20
Block codes can achieve a larger coding gain than convolution coding.
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
21
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
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
22
Which of the following is not a way to represent convolution code?

A)state diagram
B)trellis diagram
C)tree diagram
D)linear matrix
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
23
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
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
24
Fano's algorithm searches all the paths of trellis diagram at same time to find the most probable path.
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
25
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
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 25 flashcards in this deck.