Sliding Block Decoding of Convolutional Codes
- 1 September 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 29 (9) , 1401-1403
- https://doi.org/10.1109/tcom.1981.1095134
Abstract
It is shown that a convolutional code can be decoded with a sliding-block decoder, a time-invariant nonlinear digital filter with finite memory and delay. If the memory and delay are small, then the sliding-block decoder can be implemented as a table lookup procedure in ROM, resulting in a low cost, high speed, and high reliability decoder.Keywords
This publication has 7 references indexed in Scilit:
- Truncation Error Probability in Viterbi DecodingIEEE Transactions on Communications, 1977
- Sliding-block source codingIEEE Transactions on Information Theory, 1975
- Convolutional codes II. Maximum-likelihood decodingInformation and Control, 1974
- Real-Time Minimal-Bit-Error Probability Decoding of Convolutional CodesIEEE Transactions on Communications, 1974
- The viterbi algorithmProceedings of the IEEE, 1973
- Convolutional Codes and Their Performance in Communication SystemsIEEE Transactions on Communication Technology, 1971
- Viterbi Decoding for Satellite and Space CommunicationIEEE Transactions on Communication Technology, 1971