Iterative maximum-likelihood trellis decoding for block codes

IEEE Transactions on Communications

Volumn 47, Issue 3, 1999, Pages 338-342

  Luna, Amjad A ^b   Fontaine, Frédéric M ^b   Wicker, Stephen B ^a,b  

^a IEEE   (United States)

^b Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LIST VITERBI ALGORITHM; SOFT DECISION DECODING;

ALGORITHMS; BLOCK CODES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; TRELLIS CODES;

DECODING;

EID: 0032624269     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.752810     Document Type: Article

References (22)

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, vol. IT-20, pp. 284-287, 1974.
2. D. Chase, "A class of algorithms for decoding block codes with channel measurement information," IEEE Trans. Inform. Theory, vol. IT-18, pp. 170-181, 1972.
3. S. Dolinar, L. Ekroot, A. Kiely, W. Lin, and R. J. McEliece, "The permutation trellis complexity of linear block codes," in Proc. 32nd Allerton Conf. on Comm., Control, and Computing, Monticello, IL., Sept. 1994, pp. 60-74.
4. A. Lafourcade-Jumenbo and A. Vardy, "Lower bounds on trellis complexity of block codes," IEEE Trans. Inform. Theory, vol. IT-41, pp. 1938-1954, 1995.
5. T. Kaneko, T. Nishijima, and S. Hirasawa, "An improved soft decision maximum likelihood decoding algorithm using hard decision bounded distance decoding," IEEE Trans. Inform. Theory, vol. 43, pp. 1314-1319, July 1997.
6. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes," IEEE Trans. Inform. Theory, vol. IT-39, pp. 242-245, 1993.
7. F. R. Kschischang and G. B. Horn, "A heuristic for ordering a linear block code to minimize trellis state complexity," in Proc. 32nd Allerton Conference on Comm., Control, and Computing, Monticello, IL., Sept. 1994. pp. 75-84.
8. S. Lin, T. Kasami, T. Fujiwara, and M. Fossorier, Trellises and Trellis-Based Decoding Algorithms for Block Codes. Boston, MA: Kluwer, 1998.
9. J. L. Massey, "Foundations and methods of channel coding," in Proc. Int. Conf. on Information Theory and Systems, NTG-Fachberichte, 1978, vol. 65, pp. 148-157.
10. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, 1996.
11. _, "The Viterbi decoding complexity of linear block codes," presented at the IEEE Int. Symp. on Information Theory, Trondheim, Norway, 1994.
12. 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. 34, pp. 1049-1053, 1988.
13. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
14. N. Seshadri and C.-E. W. Sundberg, "List Viterbi decoding algorithms with applications," IEEE Trans. Commun., vol. 42, pp. 313-323, Feb./Mar./Apr. 1994.
15. F. K. Soong and E. F. Huang, "A tree-trellis based fast search algorithm for finding the N best sentence hypotheses in continuous speech recognition," in Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, 1991, pp. 313-323.
16. T. L. Tapp, X. Wang, and S. B. Wicker, "Soft decision hybrid-ARQ error control for mobile data networks," in Proc. Int. Conf. on Communication Technology, Beijing, China, 1996, pp. 756-759.
17. A. Vardy and Y. Be'ery, "Maximum likelihood soft decision decoding of BCH codes," IEEE Trans. Inform. Theory, vol. IT-40, pp. 546-554, 1994.
18. A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, 1967.
19. X. Wang, "Trellis dased decoders and neural network implementations," Ph.D. dissertation, Georgia Inst. of Technology, Atlanta, Mar. 1996.
20. X. Wang and S. B. Wicker, "Soft trellis decoders for some BCH codes," in Proc. Int. Symp. on Information Theory and its Applications, 1996, pp. 700-703.
21. S. B. Wicker, Error Control Systems for Digital Communications and Storage. Engelwood Cliffs: Prentice Hall, 1995.
22. J. K. Wolf, '"Efficient maximum likelihood decoding of linear block codes," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, Jan. 1978.