Title :
Performance bounds for turbo-coded modulation systems
Author :
Duman, Tolga M. ; Salehi, Masoud
Author_Institution :
Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA
fDate :
4/1/1999 12:00:00 AM
Abstract :
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
Keywords :
concatenated codes; interleaved codes; maximum likelihood decoding; modulation coding; quadrature amplitude modulation; turbo codes; 16 QAM system; SNR; channel coding; code rate; component codes; cutoff rate; interleaver lengths; lower bound; mappings; maximum-likelihood decoding; performance bounds; serially concatenated coded modulation; signal-to-noise ratios; standard union bound; suboptimal decoding algorithms; turbo codes; turbo-coded modulation systems; uniform interleaving; upper bound; Bandwidth; Code standards; Concatenated codes; Convolutional codes; Iterative decoding; Maximum likelihood decoding; Modulation coding; Signal to noise ratio; Telecommunication computing; Turbo codes;
Journal_Title :
Communications, IEEE Transactions on