Suboptimum Decoding of Decomposable Block Codes

IEEE Transactions on Information Theory

Volumn 40, Issue 5, 1994, Pages 1392-1405

  Takata, Toyoo ^a   Yamashita, Yuji ^a   Kasami, Tadao ^a   Fujiwara, Toru ^b   Lin, Shu ^c  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c UNIVERSITY OF HAWAII   (United States)

Author keywords

closest coset decoding; Decomposable codes; multistage decoding

Indexed keywords

CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; ERROR ANALYSIS; MODULATION; NUMERICAL METHODS; PERFORMANCE;

CLOSEST COSET DECODING; DECOMPOSABLE CODES; HARD DECISION DECODING; MULTISTAGE DECODING; SOFT DECISION DECODING;

BLOCK CODES;

EID: 0028515038     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.333856     Document Type: Article

References (19)

1. H. Imai and S. Hirakawa, “A new multilevel coding method using error correcting codes,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 371-376, May 1977.
2. V. V. Ginzburg, “Multidimensional signals for a continuous channel,” Problemy Peredachi Informatsii, vol. 20, no. 1, pp. 28-46,1984.
3. S. I. Sayegh, “A class of optimum block codes in signal space,” IEEE Trans. Commun., vol. COM-30, pp. 1043-1045, Oct. 1986.
4. A. R. Calderbank, “Multilevel codes and multistage decoding,” IEEE Trans. Commun., vol. 37, pp. 222-229, Mar. 1989.
5. S. Ujita, T. Takata, T. Fujiwara, T. Kasami, and S. Lin, “A multi-stage decoding for block modulation codes and its error probability analysis,” in Proc. 12th Symp. Inform. Theory, Applicat., Inuyama, Japan, Dec. 6-9, 1989, pp. 225-230.
6. T. Takata, S. Ujita, T. Kasami, and S. Lin, “Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis,” IEEE Trans. Inform. Theory, vol. 39, pp. 1204-1218, July 1993.
7. F. Hemmati, “Closet coset decoding of \\\\\\\\u\\\\\\\\u +v| codes,” IEEE J. Selected Areas Commun., vol. 7, pp. 982-988, Aug. 1989.
8. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 55-67, Jan. 1982.
9. V. A. Zinoviev, “Generalized concatenated code,” Problemy Peredachi Informatsii, vol. 12, no. 1, pp. 5-15, 1976.
10. F J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
11. G. D. Forney, Jr., “Coset codes—Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 1152-1187, Sept. 1988.
12. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
13. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On multilevel block modulation codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 965-975, July 1991.
14. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On structural complexity of the L-section minimal trellis diagrams for binary linear block codes,” IEICE Trans. Fundament. Electron., Commun., Comput. Sci., vol. E76-A, no. 9, pp. 1411-1421, Sept. 1993.
15. T. Kasami, T. Fujiwara, T. Takata, K. Tomita, and S. Lin, “Evaluation of the block error probability of block modulation codes by the maximum-likelihood decoding for AWGN channel,” in Proc. 15th Symp. Inform. Theory, Applicat., Minakami, Japan, Sept. 1992, pp. 161-164.
16. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
17. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “Representation of codewords of a cyclic code by boolean polynomials and its application to trellis diagram construction,” in Proc. 12th Symp. Inform. Theory, Applicat., Inuyama, Japan, Dec. 1989, pp. 19-24.
18. —, “Trellis diagram construction for some BCH codes,” in Proc. 1990 Int. Symp. Inform. Theory, Applicat., Honolulu, HI, Nov. 1990, pp. 139-142.
19. —, “On complexity of trellis structure of linear block codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, May 1993.