On iterative soft-decision decoding of linear binary block codes and product codes

IEEE Journal on Selected Areas in Communications

Volumn 16, Issue 2, 1998, Pages 276-296

  Lucas, Rainer ^b,c   Bossert, Martin ^a,b,c,d,e   Breitbach, Markus ^b,f  

^a IEEE

^b UNIVERSITY OF ULM   (Germany)

^c UNIVERSITY OF KARLSRUHE   (Germany)

^d DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^e LINKÖPING UNIVERSITY   (Sweden)

^f RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Iterative decoding; Linear binary block codes; Majority logic decoding; Minimal trellis; Product codes; Separable (rectangular) codes; Soft decision decoding

Indexed keywords

ALGORITHMS; DECODING; ITERATIVE METHODS; SIMULATION; TRELLIS CODES;

ITERATIVE DECODING; PRODUCT CODES; SOFT DECISION MAXIMUM LIKELIHOOD DECODING;

BLOCK CODES;

EID: 0031999054     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.661116     Document Type: Article

References (47)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes(1)," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, 1993, pp. 1064-1079.
2. R. Gallager, "Low density parity-check codes," IRE Trans. Inform. Theory, pp. 21-28, Jan. 1962.
3. G. Battail, M. C. Decouvelaere, and P. Godlewski, "Replication decoding," IEEE Trans. Inform. Theory, vol. IT-25, pp. 332-345, May 1979.
4. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-446, Mar. 1996.
5. A. Lafourcade and A. Vardy, "Asymptotically good codes have infinite trellis complexity," IEEE Trans. Inform. Theory, vol. 41, pp. 555-559, 1995.
6. G. D. Forney, "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, Apr. 1966.
7. D. Chase, "A class of algorithms for decoding block codes with channel measurement information," IEEE Trans. Inform. Theory, vol. IT-18, pp. 170-182, Jan. 1972.
8. T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder," IEEE Trans. Inform. Theory, vol. 40, pp. 320-327, Mar. 1994.
9. J. Snyders and Y. Be'ery, "Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes," IEEE Trans. Inform. Theory, vol. 35, pp. 963-975, Sept. 1989.
10. Y. S. Han, C. R. P. Hartmann, and C. C. Chen. "Efficient priorityfirst search maximum likelihood soft-decision decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 39. pp. 1514-1523, Sept. 1993.
11. M. P. Fossorier and S. Lin, "Computationally efficient soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 42, pp. 738-751, May 1996.
12. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
13. R. Lucas, M. Bossert, and M. Breitbach, "Iterative soft-decision decoding of linear binary block codes," in Proc. IEEE Int. Symp. Inform. Theory Appl., Sept. 1996, pp. 811-814.
14. 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.
15. P. Hoeher, P. Robertson, and E. Villebrun, "Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding," European Trans. Telecommun., to be published.
16. J. Hagenauer and P. Hoeher, "A Viterbi algorithm with soft-decision outputs and its applications," in Conf. Rec. GLOBECOM 89, Dallas, TX, vol. 3, Nov. 1989, pp. 47.1.1-47.1.7.
17. L. D. Rudolph, C. R. Hartmann, T. Hwang, and N. Due, "Algebraic analog decoding of linear binary codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 430-440, July 1979.
18. V. D. Kolesnik, "Iterative code constructions and multistep decoding," Sci. Rep., Dec. 1993, DLR, NT, Oberpfaffenhofen, Germany.
19. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
20. C. R. P. 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.
21. J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
22. M. Rahman and I. F, Blake, "Majority logic decoding using combinatorial designs," IEEE Trans. Inform. Theory, pp. 585-587, Sept. 1975.
23. M. Bossert and F. Herget, "Hard- and soft-decision decoding beyond the half minimum distance - An algorithm for linear codes," IEEE Trans. Inform. Theory, vol. IT-32, pp. 709-714, Sept. 1986.
24. R. Lucas, "On iterative soft-decision decoding of linear binary block codes," Ph.D. dissertation, Univ. Ulm, Germany, 1997.
25. M. Papageorgiou, Optimierung. München/Wien, Germany: R. Oldenburg Verlag, 1996.
26. A. Vardy and F. Kschischang, "Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis," IEEE Trans. Inform. Theory, vol. 42, pp. 2027-2034, Nov. 1996.
27. V. Sidorenko, "The Euler characteristic of the minimal code trellis is maximum," Probl. Inform. Transm., vol. 33, pp. 87-93, Jan.-Mar. 1997.
28. J. L. Massey, "Foundations and methods of channel encoding," in Int. Conf. Inform. Theory Syst., vol. 65. Berlin, Germany: NTG Fachberichte, 1978, pp. 148-157.
29. F. Kschischang, "The trellis structure of maximal fixed-cost codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1828-1838, Nov. 1996.
30. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
31. R. J. McEliece, "On the B.J.C.R. trellises for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
32. G. D. Fomey, "Dimension/length profiles and trellis complexity of linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, Nov. 1994.
33. T. Kasami, T. Takata, T. Fuijwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, 1993.
34. _, "On complexity of trellis structure of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, 1993.
35. G. B. Horn and F. Kschischang, "On the intractability of permuting a block code to minimize trellis complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 2024-2047, Nov. 1996.
36. A. Engelhardt, M. Bossert, and J. Maucher, "Heuristic algorithms for ordering a linear block code to reduce the number of nodes of a minimal trellis," submitted for publication.
37. F. R. Kschischang and G. B. Horn, "A heuristic for ordering a linear block code to minimize trellis state complexity," in Proc. 32nd Annu. Allerton Conf. Commun., Contr., Computing, Sept. 1994, pp. 75-84.
38. 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.
39. S. Lin and E. J. Weldon, "Further results on cyclic product codes," IEEE Trans. Inform. Theory, vol. IT-16, pp. 452-459, July 1970.
40. J. Lodge, R. Young, P. Hoeher, and J. Hagenauer, "Separable MAP filters for the decoding of product and concatenated codes," in Proc. IEEE Int. Conf. Commun. ICC'93, Geneva, Switzerland, May 1993, pp. 1740-1745.
41. S. Lin and D. J. Costello, Error Control Coding, Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
42. Y. Yasuda, K. Kashiki, and Y. Hirata, "High rate punctured convolutional codes for soft-decision Viterbi decoding," IEEE Trans. Commun., vol. 32, pp. 315-319, Mar. 1984.
43. H. T. Moorthy, S. Lin, and T. Kasami, "Soft decision decoding of binary linear block codes based on iterative search algorithm," IEEE Trans. Inform. Theory, vol. 43, pp. 1030-1039, May 1997.
44. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
45. D. Coppersmith and G. Seroussi, "On the minimum distance of some quadratic residue codes," IEEE Trans. Inform. Theory, vol. IT-30, pp. 407-411, Mar. 1984.
46. R. Lucas, M. Bossert, M. Breitbach, and H. Griesser, "On iterative soft-decision decoding of binary quadratic residue codes," in Proc. 5th Int. Workshop Algebraic and Combinatorial Coding Theory, June 1996, pp. 184-189.
47. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1984.