Performance bounds for turbo-coded modulation systems

We apply the standard union bound to turbo-coded modulation systems with maximum-likelihood decoding. To illustrate the methodology, we explicitly derive the bounds for the 2-bits/s/Hz 16 QAM system. Generalization of this bound to other turbo-coded modulation systems is straightforward. As in the case of the standard union bound for turbo codes, we expect these bounds to be useful for rather large values of signal-to-noise ratios, i.e., signal-to-noise ratios for which the code rate is smaller than the corresponding cutoff rate. The bound is based on "uniform interleaving" just as its counterpart for standard turbo coding. The derived bound provides a tool for comparing coded modulation schemes having different component codes, interleaver lengths, mappings, etc., using maximum-likelihood decoding. It is also useful in studying the effectiveness of various suboptimal decoding algorithms. The bounding technique is also applicable to other coded-modulation schemes such as serially concatenated coded modulation.

[1]  Mark Rice,et al.  Bandwidth Efficient Turbo Coding For High Speed Mobile Satellite Communications , 1997 .

[2]  F. Pollara,et al.  Parallel concatenated trellis coded modulation , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[3]  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.

[4]  Patrick Robertson,et al.  Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[5]  Dariush Divsalar,et al.  Transfer function bounds on the performance of turbo codes Pasadena , 1995 .

[6]  Jack K. Wolf,et al.  On the performance evaluation of trellis codes , 1987, IEEE Trans. Inf. Theory.

[7]  Dariush Divsalar,et al.  Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[8]  P. Robertson,et al.  A novel bandwidth efficient coding scheme employing turbo codes , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[9]  A. Glavieux,et al.  Turbo-codes and high spectral efficiency modulation , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[10]  Masoud Salehi,et al.  Turbo codes and turbo coded modulation systems: analysis and performance bounds , 1998 .

[11]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[12]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[13]  Claude Berrou,et al.  A low complexity soft-output Viterbi decoder architecture , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[14]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.