Browse > Article

Design of Recursive Systematic Convolutional Codes for Turbo Codes Based on the Distance Spectrum Properties  

Kim, Dae-Son (연세대학교 전기전자공학과 부호 및 정보이론 연구실)
Song, Hong-Yeop (연세대학교 전기전자공학과 부호 및 정보이론 연구실)
Lee, Dong-Hahk (SK텔레콤 Access망개발팀)
Yu, Jae-Hwang (SK텔레콤 Access망개발팀)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.33, no.2C, 2008 , pp. 155-160 More about this Journal
Abstract
In this letter, we propose a new design of recursive systematic convolutional (RSC) codes based on the distance spectrum properties which can maximize the performance. Good constituent RSC codes of code rate 1/2 are searched by computer and presented in a table. Their performances are shown by computer simulation. New designed codes shows faster convergences according to iterative decoding and good performances.
Keywords
Turbo codes; Effective free distance; Concatenated codes;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Benedetto, G. Montorsi, "Design of parallel concatenated convolutional codes," IEEE Trans. Commun., Vol.44, Issue 5, pp. 591-600, May 1996   DOI   ScienceOn
2 J. W. Lee and R. E. Blahut, "Generalized EXIT Chart and BER Analysis of Finite-length Turbo Codes," IEEE Globecom 03, Vol.4, pp.2067-2072, Dec. 2003
3 D. Divsalar and R. J. McEliece, R.J, "Effective free distance of turbo codes," Electronics Letters, Vol.32, Issue 5, pp.445-446, 1996   DOI   ScienceOn
4 S. ten Brink, "Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes," IEEE Trans. Commun., Vol. 49, No. 10, pp.1727-1737, Oct. 2001   DOI   ScienceOn
5 J. Yuan, B. Vucetic, and W. Feng, "Combined turbo codes and interleaver design," IEEE Trans. Commun., Vol.47, Issue 4, pp.484-487, April 1999   DOI   ScienceOn
6 Fan Jiang, M.R. Becker, and L. C. Perez, "Time-varying turbo codes," IEEE Commun. Letters, Vol.8, Issue 8, Aug. 2004, pp.529 - 531   DOI   ScienceOn
7 P.C. Massey, O. Y. Takeshita, and D. J. Costello Jr, "Contradicting a myth: good turbo codes with large memory order," in Proceedings IEEE International Symposium on Information Theory,. pp.122, 25-30 June 2000
8 A. Perotti and S. Benedetto, "A new upper bound on the minimum distance of turbo codes," IEEE Trans. Inform. Theory, Vol.50, Issue 12, pp.2985-2997, Dec. 2004   DOI   ScienceOn
9 S. Benedetto, G. Montorsi, "Unveiling Turbo Codes : Some Results on Parallel Concatenated Coding Schemes," IEEE Trans. Commun., Vol. 42, No.2, pp.409-428, Mar. 1996
10 C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: turbo-codes," IEEE Trans. Commun., Vol.44, Issue 10, pp.1261-1271, Oct. 1996   DOI   ScienceOn
11 S. Benedetto, R. Garello and G. Montorsi, "A search for good convolutional codes to be used in the construction of turbo codes," IEEE Trans. Commun., Vol.46, Issue 9, pp.1101-1105, Sept. 1998   DOI   ScienceOn