Ingmar Land Information and Coding Theory Lab University of Kiel, Germany e-mail: il@tf.uni-kiel.de http://www.tf.uni-kiel.de/ict Slim Chaoui Institute for Communications Technology Darmstadt University of Technology, Germany e-mail: slim@nesi.tu-darmstadt.de http://www.nesi.e-technik.tu-darmstadt.de Abstract | Two classes of concatenated codes of rate 1/2 and medium code lengths (600, 2000) are considered: convolutional coupled codes and partially systematic turbo codes. As opposed to the classical turbo code (Berrou, Glavieux), which is a systematic code, coupled codes contain no systematic bits and partially systematic turbo codes only some systematic bits. These codes can still be iteratively decoded and they show even better distance properties. This leads to better error rate performances in a wide range of signal-to-noise ratios, especially in the “flattening region”. The two code classes and their performances are presented and compared.
[1]
Daniel J. Costello,et al.
A distance spectrum interpretation of turbo codes
,
1996,
IEEE Trans. Inf. Theory.
[2]
Sergio Benedetto,et al.
Unveiling turbo codes: some results on parallel concatenated coding schemes
,
1996,
IEEE Trans. Inf. Theory.
[3]
Peter A. Hoeher,et al.
Using the mean reliability as a design and stopping criterion for turbo codes
,
2001,
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).
[4]
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.
[5]
Peter Adam Hoeher,et al.
Partially Systematic Rate 1/2 Turbo Codes
,
2000
.