On turbo decoding of nonbinary codes
- 1 April 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 2 (4) , 94-96
- https://doi.org/10.1109/4234.664216
Abstract
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for nonbinary block and convolutional codes over an extension field GF(p/sup a/) are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more efficient for high-rate codes. It is shown that these algorithms meet all requirements needed for iterative decoding as the output of the decoder can be split into three independent estimates: soft channel value, a priori term and extrinsic value. The discussed algorithms are then applied to a parallel concatenated coding scheme with nonbinary component codes in conjunction with orthogonal signaling.Keywords
This publication has 6 references indexed in Scilit:
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codesIEEE Journal on Selected Areas in Communications, 1998
- Iterative decoding of binary block and convolutional codesIEEE Transactions on Information Theory, 1996
- Replication decodingIEEE Transactions on Information Theory, 1979
- An optimum symbol-by-symbol decoding rule for linear codesIEEE Transactions on Information Theory, 1976
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974