Efficient Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes

IEEE Transactions on Information Theory

Volumn 39, Issue 5, 1993, Pages 1514-1523

  Han, Yunghsiang S ^a,b   Hartmann, Carlos R P ^a   Chen, Chih Chieh ^c,d  

^a SYRACUSE UNIVERSITY   (United States)

^b Department of Electronic Engineering Hua Fan Institute of Humanities and Technology ^*  (Taiwan)

^c JOHNS HOPKINS UNIVERSITY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

block codes; decoding; Dijkstra's algorithm; maximum likelihood; priority first search; soft decision; trellis

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DECODING; PROBABILITY;

BLOCK CODES; MAXIMUM LIKELIHOOD; SOFT DECISION;

INFORMATION THEORY;

EID: 0027668419     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.259636     Document Type: Article

References (28)

1. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform Theory, pp. 284–287, Mar. 1974.
2. L. D. Baumert and L. R. Welch, “Minimum-weight codewords in the (128,64) BCH Code,” Jet Prop. Lab., California Inst. Technol., Pasadena, CA, DSN Progr. Rep. 42–42, Sept. and Oct. 1977.
3. L. D. Baumert and R. J. McEliece, “Soft decision decoding of block codes,” Jet Prop. Lab., California Inst. Technol., Pasadena, CA, DSN Progr. Rep. 42–47, July and Aug. 1978.
4. E. R. Berlekamp, Algebraic Coding Theory. New York, NY: McGraw-Hill Book Co., 1968.
5. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
6. R.W. D. Booth, M. A. Herro, and G. Solomon, “Convolutional coding techniques for certain quadratic residue codes,” in Proc. 1975 Int. Telemetering Conf., 1975, pp. 168–177.
7. G. Brassard and P. Bratley, Algorithmics Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1988.
8. G. C. Clark, Jr., and J. B. Cain, Error-Correction Coding for Digital Communications. New York, NY: Plenum, 1981.
9. G. P. Cohen, P. J. Godlewski, and T. Y. Hwang, “Generating codewords in real space: Applications to decoding,” in Proc. 3rd Int. Colloquium Coding Theory and Applications, Nov. 1988, pp. 114–122.
10. 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, pp. 41–50, vol. IT-32, Jan. 1986.
11. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: The M.I.T. Press, 1991.
12. B. G. Dorsch, “A decoding algorithm for binary block codes and J-ary output channels,” IEEE Trans. on Inform. Theory, pp. 391–394, vol. IT-20, May 1974.
13. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: The M.I.T. Press, 1966.
14. ——, “Coset codes—Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, pp. 1152–1187, vol. 34, Sept. 1988.
15. Y. S. Han, C. R. P. Hartmann, and C-C. Chen, “Efficient maximum-likelihood soft-decision decoding of linear block codes using algorithm A*,” School of Comput. Inform. Sci., Syracuse Univ., Syracuse, NY 13244, Tech. Rep. SU-CIS-91-42, Dec. 1991.
16. Y. S. Han and C. R. P. Hartmann, “Designing efficient soft-decision decoding algorithms for linear block codes using algorithm A*,” School of Comput. Inform. Sci., Syracuse Univ., Syracuse, NY 13244, Tech. Rep. SU-CIS-91-10, June 1992.
17. T.-Y. Hwang, “Decoding linear block codes for minimizing word error rate,” IEEE Trans. Inform. Theory, pp. 733–737, Nov. 1979.
18. T. Kancko, T. Nishijima, H. Inazumi, and S. Hirasawa, “An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder,” IEEE Trans. Inform. Theory, to be published.
19. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: Elsevier, 1977.
20. C. L. Mallows and N. J. A. Sloane, “An upper bound for self-dual codes,” Inform. Contr, vol. 22, pp. 188–200, 1973.
21. K. R. Matis and J. W. Modestino, “Reduced-search soft-decision trellis decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 349–355, Mar. 1982.
22. N. J. Nilsson, Principle of Artificial Intelligence. Palo Alto, CA: Tioga Publishing Co., 1980.
23. I. S. Reed, T. K. Truong, X. Chen, and X. Yin, “The algebraic decoding of the (41,21,9) quadratic residue code,” IEEE Trans. Inform. Theory, vol. 38, pp. 974–986, May 1992.
24. G. Solomon and H. C. A. van Tilborg, “A connection between block and convolutional codes,” SIAM J. Appl. Math., pp. 358–369, 1979.
25. 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.
26. A. M. Tenenbaum and M. J. Augenstein, Data Structures Using Pascal. Englewood Cliffs, NJ: Prentice-Hall, 1986, 2nd ed.
27. A. J. Viterbi, “Error bound for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Information Theory, vol. IT-13, pp. 260–269, Apr. 1967.
28. 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.