A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes

IEEE Transactions on Information Theory

Volumn 45, Issue 2, 1999, Pages 731-741

  Koumoto, Takuya ^a   Takata, Toyoo ^a   Kasami, Tadao ^a   Lin, Shu ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Iterative decoding; Low weight subtrellis; Optimality

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTER SIMULATION; DECISION THEORY; DECODING; ERROR ANALYSIS; ITERATIVE METHODS; TRELLIS CODES;

BINARY LINEAR BLOCK CODES; LOW-WEIGHT TRELLIS-BASED ITERATIVE SOFT-DECISION DECODING ALGORITHMS;

BLOCK CODES;

EID: 0033097453     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.749023     Document Type: Article

References (17)

1. A. Vardy and Y. Be'ery, "Maximum likelihood soft-decision decoding of BCH codes," IEEE Trans. Inform. Theory, vol. 40, pp. 546-554, Mar. 1994.
2. Y. Berger and Y. Be'ery, "Soft trellis-based decoder for linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 764-773, May 1994.
3. L. Ekroot and S. Dolinar, "Adecoding of block codes," IEEE Trans. Commun., vol. 44, pp. 1052-1056, Sept. 1996.
4. 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.
5. 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.
6. A. Lafourcade and A. Vardy, "Optimum sectionalization of a trellis," IEEE Trans. Inform. Theory, vol. 42, pp. 689-702, May 1996.
7. R.J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
8. T. Fujiwara, H. Yamamoto, T. Kasami, and S. Lin, "A trellis-based recursive maximum likelihood decoding algorithm for linear block codes," IEEE Trans. Inform. Theory, vol. 44, pp. 714-729, Mar. 1998.
9. H.T. Moorthy, S. Lin, and T. Kasami, "Soft-decision decoding of binary linear block codes based on an iterative search algorithm," IEEE Trans. Inform. Theory, vol. 43, pp. 1030-1040, May 1997.
10. D. Chase, "A class of algorithms for decoding block codes with channel measurement information," IEEE Trans. Inform. Theory, vol. 18, pp. 170-182, Jan. 1972.
11. M.P. C. Fossorier and S. Lin, "Soft-decision decoding of binary linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 44. pp. 1217-1234, Sept. 1995.
12. 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.
13. Y. Berger and Y. Be'ery, "The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1817-1827, Nov. 1996.
14. T. Kasami, T. Koumoto, T. Takata, and S. Lin, "The least stringent sufficient conditions on the optimality of decoded codewords," in Proc. 1995 IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sept. 1995, p. 470.
15. T. Kasami, K. Koumoto, T. Fujiwara, H. Yamamoto, Y. Desaki, and S. Lin, "Low weight subtrellises for binary linear block codes and their application," IEICE Trans. Fundamentals Electron., Commun. Comput. Sei., vol. E80-A, no. 11, pp. 2095-2103, Nov. 1997.
16. M.P. C. Fossorier, S. Lin, and J. Synders, "On maximum likelihood soft-decision syndrome decoding," IEEE Trans. Inform. Theory, vol. 44, pp. 388-398, Jan. 1998.
17. B. Masnick and J. Wolf, "On linear unequal error protection codes," IEEE Trans. Inform. Theory, vol. 13, pp. 600-607, July 1967.