Asymptotic analysis of superorthogonal turbo codes

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 253-258

  Wintzell, Ola ^a,b   Lentmaier, Michael ^a   Zigangirov, Kamil Sh ^a  

^a LUND UNIVERSITY   (Sweden)

^b ERICSSON RESEARCH   (Sweden)

Author keywords

Iterative decoding; Low density convolutional codes; Low rate turbo codes; Superorthogonal convolutional codes; Superorthogonal turbo codes

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; DECODING; ITERATIVE METHODS;

SUPERORTHOGONAL CONVOLUTIONAL ENCODERS (SOCE);

TURBO CODES;

EID: 0037269010     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.806143     Document Type: Article

References (23)

1. P. Komulainen and K. Pehkonen, "Performance evaluation of super-orthogonal turbo codes in AWGN and flat Rayleigh fading channels," IEEE J. Select. Areas Commun., vol. 16, no. 2, pp. 196-205, Feb. 1998.
2. A. J. Viterbi, "Orthogonal tree codes for communication in the presence of white Gaussian noise," IEEE Trans. Commun., vol. COM-15, pp. 238-242, 1967.
3. E. Zehavi and A. J. Viterbi, "On new classes of orthogonal convolutional codes," in Proc. Bilkent Conf. New Trends in Communication, Control, and Signal Processing, Ankara, Turkey, 1990.
4. A. J. Viterbi, "Very low rate convolutional codes for maximum theoretical performance of spread-spectrum multiple-access channels," IEEE J. Select. Areas Commun., vol. 8, pp. 641-649, May 1990.
5. P. Frenger, P. Orten, and T. Ottosson, "Code-spread CDMA using maximum free distance low-rate convolutional codes," IEEE Trans. Inform. Theory, vol. 48, pp. 135-144, Jan. 2000.
6. C. Berrou and A. Glavieux, "Near optimum error-correcting coding and decoding: Turbo codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
7. W. K. Leung, K. S. Ho, and L. Ping, "Approaching low rate Shannon limit using concatenated Hadamard codes," Electron. Lett., vol. 36, no. 1, pp. 45-46, Jan. 2000.
8. L. Ping, W. K. Leung, and K. Y. Wu, "Low-rate turbo-Hadamard codes," IEEE Trans. Inform. Theory, submitted for publication.
9. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
10. K. Engdahl and K. Sh. Zigangirov, "On the theory of low-density convolutional codes I," Probl. Inform. Transm., vol. 35, no. 4, pp. 295-310, 1999.
11. D. Truhachev, M. Lentmaier, and K. Sh. Zigangirov, "Some results concerning design and decoding of turbo-codes," Probl. Inform. Transm., vol. 37, no. 3, pp. 190-205, July-Sept. 2001.
12. M. Lentmaier, D. Truhachev, and K. Sh. Zigangirov, "On the theory of low-density convolutional codes II," Probl. Inform. Transm., vol. 37, no. 4, pp. 288-306, Oct.-Dec. 2001.
13. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
14. K. Sh. Zigangirov and M. Lentmaier, "Mathematical analysis of an iterative algorithm for low-density code decoding," Probl. Inform. Transm., vol. 36, no. 4, pp. 314-324, Oct.-Dec. 2000.
15. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
16. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
17. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Univ. Linköping, Linköping, Sweden, Apr. 1996.
18. A. J. Viterbi, CDMA Principles of Spread Spectrum Communication. Reading, MA: Addison-Wesley, 1995.
19. R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
20. 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, Mar. 1974.
21. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
22. M. A. Margulis, "Explicit group-theoretic constructions for combinatorial designs with applications to expanders and concentrators," Probl. Inform. Transm., vol. 24, no. 1, pp. 39-46, 1988.
23. T. Richardson and R. Urbanke, "Thresholds for turbo codes," in Proc. 2000 IEEE Int. Symp. Inform. Theory, Sorrento, Italy, 2000, p. 317.