Soft-Decision Decoding of Linear Block Codes Based on Ordered Statistics

IEEE Transactions on Information Theory

Volumn 41, Issue 5, 1995, Pages 1379-1396

  Fossorier, Marc P C ^a   Lin, Shu ^a  

^a UNIVERSITY OF HAWAII   (United States)

Author keywords

block codes; Maximum likelihood decoding; ordered statistics; reliability information

Indexed keywords

BIT ERROR RATE; BLOCK CODES; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECODING; INFORMATION THEORY; PARALLEL PROCESSING SYSTEMS; SIGNAL TO NOISE RATIO; STATISTICS;

ERROR PERFORMANCE; MAXIMUM LIKELIHOOD DECODING; RELIABILITY INFORMATION; SOFT DECISION DECODING;

ALGORITHMS;

EID: 0029373149     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.412683     Document Type: Article

References (31)

1. 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.
2. J. H. Conway and N. J. A. Sloane, “Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 41–50, Jan. 1986.
3. G. D. Forney Jr, “Generalized minimum distance decoding,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 125–131, Apr. 1966.
4. 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.
5. H. Tanaka and K. Kakigahara, “Simplified correlation decoding by selecting codewords using erasure information,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 743–748, Sept. 1983.
6. T. Taneko, T. Nishijima, H. Inazumi, and S. Hirasawa, “An efficient maximum likelihood decoding of linear block codes with algebraic decoder,” IEEE Trans. Inform. Theory, vol. 40, pp. 320–327, Mar. 1994.
7. 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.
8. N. J. C. Lous, P. A. H. Bours, and H. C. A. van Tilborg, “On maximum likelihood soft-decision decoding of binary linear codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 197–203, Jan. 1993.
9. J. Snyders, “Reduced lists of error patterns for maximum likelihood soft decoding,” IEEE Trans. Inform. Theory, vol. 37, pp. 1194–1200, July 1991.
10. —, “On survivor error patterns for maximum likelihood soft decoding,” in Proc. IEEE Int. Symp. on Information Theory (Budapest, Hungary, June 1991), p. 192.
11. G. D. Forney, Jr, “Coset codes II: Binary lattices and related codes,” IEEE Trans. on Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.
12. D. Muder, “Minimal trellises for block codes,” IEEE Trans. Inform, Theory, vol. 34, pp. 1049–1053, Sept. 1988.
13. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On complexity of trellis structure of linear block codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 1057–1064, May 1993.
14. A. Lafourcade and A. Vardy, “Asymptotically good codes have infinite trellis complexity,” IEEE Trans. Inform. Theory, vol. 41, pp. 555–559, Mar. 1995.
15. F. Hemmati, “Closest coset decoding of ∣u∣u + v∣ codes,” IEEE J. Selected Areas Commun., vol. 7, pp. 982–988, Aug. 1989.
16. J. Wu, S. Lin, T. Kasami, T. Takata, and T. Fujiwara, “An upper bound on the effective error coefficient of two-stage decoding and good two-level decompositions of some Reed-Muller codes,” IEEE Trans. Commun., vol. 42, pp. 813–818, Feb./Mar./Apr. 1994.
17. Y. S. Han, C. R. P. Hartmann, and C. C. Chen, “Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 1514–1523, Sept. 1993.
18. Y. S. Han, C. R. P. Hartmann, and K. G. Mehrotra, “Further results on decoding linear block codes using a generalized Dijkstra's algorithm,” in Proc. IEEE Int. Symp. on Information Theory (Trondheim, Norway, June 1994), p. 342.
19. R. Sedgewick, Algorithms in C. New York: Addison-Wesley, 1990.
20. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: M.I.T. Press, 1972.
21. N. Balakrishnan and A. Clifford Cohen, Ordered Statistics and Inference: Estimation Methods. San Diego, CA: Academic Press, 1991.
22. D. J. Taipale and M. B. Pursley, “An improvement to generalized-minimum-distance decoding,” IEEE Trans. Inform. Theory, vol. 37, pp. 167–172, Jan. 1991.
23. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: M.I.T. Press, 1966.
24. A. Papoulis, Probability, Random Variables, and Stochastic Processes, 3rd ed. New York: McGraw-Hill, 1991.
25. M. P. C. Fossorier and S. Lin, “First order approximation of the ordered binary symmetric channel,” submitted to IEEE Trans. Inform. Theory, Nov. 1994.
26. M. P. C. Fossorier, “Soft decision decoding of linear block codes based on ordered statistics,” Ph.D. dissertation, University of Hawaii at Manoa, Dec. 1994.
27. A. Vardy and Y. Be'ery, “More efficient soft decoding of the Golay codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 667–672, May 1991.
28. S. Lin and D. J. Costello, Jr., Error Control Coding Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
29. H. Thirumoorthy, S. Lin, and T. Kasami, “Soft decision decoding of binary linear block codes based on an iterative search algorithm,” submitted to IEEE Trans. Inform. Theory, Jan. 1995.
30. A. Vardy and Y. Be'ery, “Maximum likelihood soft decoding decoding of BCH codes,” IEEE Trans. Inform. Theory, vol. 40, pp. 546–554, Mar. 1994.
31. T. Kasami, T. Kakata, T. Fujiwara, and S. Lin, “On complexity of trellis structure of linear block codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 1057–1064, May 1993.