A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes

IEEE Transactions on Information Theory

Volumn 44, Issue 7, 1998, Pages 3124-3129

  Johansson, Thomas ^a,b   Zigangirov, Kamil ^a,b  

^a IEEE   (Sweden)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Linear block codes; Soft output symbol decoding; Trel lises

Indexed keywords

ALGORITHMS; BLOCK CODES; DECODING; ITERATIVE METHODS; OPTIMIZATION; TRELLIS CODES;

HAMMING CODES; LINEAR BLOCK CODES; SOFT-OUTPUT SYMBOL DECODING;

INFORMATION THEORY;

EID: 0032201784     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.737541     Document Type: Article

References (12)

1. L. R. Bahl, J. Cooke, 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.
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. J. Hagenauer, "Source controlled channel decoding," IEEE Trans. Com- mun., vol. 43, pp. 2449-2457, Sept. 1995.
4. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding," in Proc. IEEE Int. Conf. Com- munications (Geneva, Switzerland, May 1993), pp. 1064-1070.
5. R. Lucas, M. Bossert, and M. Breitbach, "On iterative soft-decision decoding of linear binary block codes and product codes," IEEE J. Select. Areas Commun., vol. 16, pp. 276-296, Feb. 1998.
6. C. R. Hartmann and L. D. Rudolph, "An optimal symbol-by-symbol decoding rule for linear codes," IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
7. G. Battail, M. C. Decouvelaere, and P. Godlewski, "Replication de- coding," IEEE Trans. Inform. Theory, vol. IT-25, pp. 332-345, Sept. 1979.
8. J. K. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, Jan. 1978.
9. V. V. Zyablov, and V. R. Sidorenko, "Bounds on complexity of trellis decoding of linear block codes," Probl. Pered. Inform., vol. 29, no. 3, pp. 1-6, July-Sept. 1993.
10. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
11. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
12. M. Lentmaier, "Soft iterative decoding of generalized low-density parity-check codes based on MAP decoding of component Hamming codes," Diploma Thesis, Dept. Inform. Technol., University of Ulm, Ulm, Germany, 1997.