New low-complexity turbo-like codes

We discuss the design of new low-complexity turbo-like codes based on a multiple parallel concatenation of 4-state and 2-state constituent codes. The new code designs take advantage of the big-numerator/little-denominator principle along with specially designed interleavers to outperform previously designed turbo codes over the entire range of signal-to-noise ratios. Puncturing at the encoder is used to produce low-complexity codes with excellent performance at code rates of 1/2 and 1/3. The multiple parallel concatenation and puncturing results in turbo-like encoders which are either partially systematic or completely nonsystematic. Comparisons with the proposed 8-state turbo coding standard and with other low-complexity alternative code designs are included.

[1]  Daniel J. Costello,et al.  Contradicting a myth: good turbo codes with large memory order , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[2]  Daniel J. Costello,et al.  A note on asymmetric turbo-codes , 1999, IEEE Communications Letters.

[3]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[4]  Li Ping.  Turbo-SPC codes , 2001, IEEE Trans. Commun..

[5]  D. J. Costello,et al.  Turbo codes with recursive nonsystematic quick-look-in constituent codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[6]  Dariush Divsalar,et al.  Low Complexity Turbo-like Codes , 2000 .

[7]  Daniel J. Costello,et al.  Iterative decoding of non-systematic turbo-codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[8]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[9]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.