Sufficient conditions for ruling-out useless iterative steps in a class of iterative decoding algorithms

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 10, 1999, Pages 2061-2072

  Kasami, Tadao ^a   Tang, Yuansheng ^b   Koumoto, Takuya ^c   Fujiwara, Toru ^b  

^a HIROSHIMA CITY UNIVERSITY   (Japan)

^b NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^c NTT CORPORATION   (Japan)

Author keywords

Binary block codes; Early termination conditions; Iterative decoding; Ruling out conditions; Soft decision

Indexed keywords

EID: 33746797407     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. D. Chase, "A new class for decoding block codes with channel measurement information," IEEE Trans. Inf. Theory, vol.IT-18, pp.170-182, Jan. 1972.
2. N. Tendolkar and C.P. Hartmann, "Generalization of chase algorithms for soft decision decoding of binary linear codes," IEEE Trans. Inf. Theory, vol.IT-30, pp.714-721, Sept. 1984.
3. D.J. Taipale and M.B. Pursley, "An improvement to generalized minimum-distance decoding," IEEE Trans. Inf. Theory, vol.37, pp.167-172, Jan. 1991.
4. T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder," IEEE Trans. Inf. Theory, vol.40, pp.320-327, March 1994.
5. M.P.C. Fossorier and S. Lin, "Soft-decision decoding of binary linear block codes based on ordered statistics," IEEE Trans. Inf. Theory, vol.44, pp.1217-1234, Sept. 1995.
6. T. Kasami, T. Takata, T. Koumoto, T. Fujiwara, H. Yamamoto, and S. Lin, "The least stringent sufficient condition on optimality of suboptimal decoded codewords," IEICE Technical Report, IT94-82, Jan. 1995.
7. T. Kasami, T. Koumoto, T. Takata, and S. Lin, "The effectiveness of the least stringent sufficient condition on the optimality of decoded codewords," Proc. 3rd Int. Symp. on Commu. Theory & Appl., pp.324-333, Charlotte Mason College, Ambleside, Lake District, UK, July 1995.
8. T. Kaneko, T. Nishijima, and S. Hirasawa, "An improvement of soft-decision maximum-likelihood docoding algorithm using hard-decision bounded-distance decoding," IEEE Trans. Inf. Theory, vol.43, pp.1314-1319, July 1997.
9. T. Koumoto and T. Kasami, "An iterative decoding algorithm based on information of decoding failure," Proc. the 20th Symp. on Inform. Theory & Appl., pp.325-328, Japan, Dec. 1997.
10. T. Koumoto, T. Kasami, and S. Lin, "A sufficient condition for ruling out some useless test error patterns in iterative decoding algorithms," IEICE Trans. Fundamentals, vol.E81-A, no.2, pp.321-326, Feb. 1998.
11. T. Kasami and T. Koumoto, "Computational complexity for computing sufficient conditions on the optimality of a decoded codeword," NAIST-IS-TR98008 ISSN 0919-9527, July 1998.
12. Y. Tang, T. Kasami, and T. Fujiwara, "An optimality testing algorithm for a decoded codeword of binary block codes and its computational complexity," Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (AAECC), Honolulu, HI, USA, Nov. 1999.
13. T. Koumoto and T. Kasami, "Analysis and improvement on chase type 2 like decoding algorithms," Proc. 21th Symp. on Inform. Theory & Appl., pp.531-534, Japan, Dec. 1998.
14. T. Koumoto, T. Takata, T. Kasami, and S. Lin, "A low-weight trellis based iterative soft-decision decoding algorithm for binary linear block codes," IEEE Trans. Inf. Theory, vol.45, pp.731-741, March 1999.
15. M.P.C. Fossorier, T. Koumoto, T. Takata, T. Kasami, and S. Lin, "The least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis," Proc. Int. Symp. on Inform. Theory (ISIT), p.430, Ulm, Germany, June 1997.
16. C.X. Chen, "Sufficient condition for the optimality of a candidate codeword in soft-decision decoding of binary linear block codes," Master Thesis, Univ. of Hawaii, Oct. 1998.
17. H. Greenberg, Integer Programming, Academic Press, 1971.