Viterbi decoding algorithm for convolutional codes with repeat request
H. Yamamoto, Kiminori Itoh · IEEE Transactions on Information Theory · 1980
Using the Viterbi decoding algorithm with repeat request for convolutional codes is proposed, and the resulting performance is analyzed by random coding and generating function arguments and by simulation. It is shown that the reliability function of the proposed decoding algorithm is asymptotically twice that of the Viterbi decoding algorithm without repeat request, and that in certain practical situations the proposed algorithm can save about 50 percent in constraint length over the ordinary Viterbi algorithm for a given performance.
Cited by 126 works. doi:10.1109/tit.1980.1056245
Authors
References
- Information Theory and Reliable Communication
- Information Theory and Reliable Communication.
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Convolutional Codes and Their Performance in Communication Systems
- On the Viterbi decoding algorithm
- Viterbi Decoding for Satellite and Space Communication
- Convolutional codes II. Maximum-likelihood decoding
- Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
- Exponential error bounds for erasure, list, and decision feedback schemes
- Truncation Error Probability in Viterbi Decoding