On turbo decoding of nonbinary codes

IEEE Communications Letters

Volumn 2, Issue 4, 1998, Pages 94-96

  Berkmann, Jens ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Iterative decoding; MAP algorithm; Nonbinary linear coder; Turbo codes

Indexed keywords

ALGORITHMS; BLOCK CODES; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; CONVOLUTIONAL CODES; ITERATIVE METHODS; PROBABILITY; VECTORS;

ITERATIVE DECODING; NONBINARY LINEAR CODER; TURBO CODES;

DECODING;

EID: 0032047736     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.664216     Document Type: Article

References (6)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes (1)," in Proc. IEEE Int. Conf. on Communication (ICC), Geneva, Switzerland, May 1993, pp. 1064-1070.
2. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
3. S. Riedel, "New symbol-by-symbol MAP decoding algorithms for high-rate convolutional codes which use reciprocal dual codes," IEEE J. Select. Areas Commun., vol. 16, pp. 175-185, Feb. 1998.
4. C. R. Hartmann and L. D. Rudolph, "An optimum symbol-by-symbol decoding rule for linear codes," IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
5. G. Battail, M. C. Decouvelaere, and P. Godlewski, "Replication decoding," IEEE Trans. Inform. Theory, vol. IT-25, pp. 332-345, May 1979.
6. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.