Adaptive decoding of convolutional codes
Open Access
- 13 June 2007
- journal article
- Published by Copernicus GmbH in Advances in Radio Science
- Vol. 5, 209-214
- https://doi.org/10.5194/ars-5-209-2007
Abstract
Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on the number of transmission errors. To reduce the complexity of the decoding process for good transmission conditions, an alternative syndrome based decoder is presented. The reduction of complexity is realized by two different approaches, the syndrome zero sequence deactivation and the path metric equalization. The two approaches enable an easy adaptation of the decoding complexity for different transmission conditions, which results in a trade-off between decoding complexity and error correction performance.Keywords
This publication has 7 references indexed in Scilit:
- Fundamentals of Convolutional CodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Error-trellis syndrome decoding techniques for convolutional codesIEE Proceedings F Communications, Radar and Signal Processing, 1985
- Syndrome Decoding of Binary Rate-1/2 Convolutional CodesIEEE Transactions on Communications, 1976
- Syndrome Decoding of Convolutional CodesIEEE Transactions on Communications, 1975
- The viterbi algorithmProceedings of the IEEE, 1973
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967