Viterbi decoder 2-1-7
2016-08-23
17 0 0
4.0
Other
Earn points
viterbi decoding algorithm is a decoding algorithm for convolutional codes. Advantages not say. Drawback is bound to increase with the complexity of the algorithm is to increase the length of the fast. N is the path length constraint 7:00 to compare 64 there, the path goes to 8:00 128. (2 << (N-1)). So viterbi decoding is generally used in the constraint length is less than 10 occasions.
Said first encoding (e.g. constraint length of 7): 7 retarder state coder (0,1) form the 64 state of the entire encoder. Each state in the encoder input 0 or 1, it will jump to another being. For example, enter 110100 1:00 into 101 001 (in fact, the shift register). And the output is also the attendant change.
This decoding process is the reverse process. Algorithm specifies the data to be received at time t 64 times compared to the status of each channel is 64, there are two branches (because the input 0 or 1), while the spread jumped to two different states, the two the corresponding
Said first encoding (e.g. constraint length of 7): 7 retarder state coder (0,1) form the 64 state of the entire encoder. Each state in the encoder input 0 or 1, it will jump to another being. For example, enter 110100 1:00 into 101 001 (in fact, the shift register). And the output is also the attendant change.
This decoding process is the reverse process. Algorithm specifies the data to be received at time t 64 times compared to the status of each channel is 64, there are two branches (because the input 0 or 1), while the spread jumped to two different states, the two the corresponding
verilog
Viterbi
译码器
Related Source Codes
AXI Host Slave Function Model
0
0
no vote
Axi slave to fifo code
0
0
no vote
DMA Controller Based on AHB
0
0
no vote
Verilog implementation of ldpc code
0
0
no vote
Minimum sum decoding
0
0
no vote
No comment