×

Bandwidth-efficient turbo coding over Rayleigh fading channels. (English) Zbl 1009.68617

Summary: Introduced in 1993, turbo codes can achieve high coding gains close to the Shannon limit. In order to design power and bandwidth-efficient coding schemes, several approaches have been introduced to combine high coding rate turbo codes with multilevel modulations. The coding systems thus obtained have been shown to display near-capacity performance over additive white Gaussian noise (AWGN) channels. For communications over fading channels requiring large coding gain and high bandwidth efficiency, it is also interesting to study bit error rate (BER) performance of turbo codes combined with high order rectangular QAM modulations. To this end, we investigate, in this paper, error performance of several bandwidth-efficient schemes designed using the bit-interleaved coded modulation approach that has proven potentially very attractive when powerful codes, such as turbo codes, are employed. The structure of these coding schemes, termed ‘bit-interleaved turbo-coded modulations’ (BITCMs), is presented in a detailed manner and their BER performance is investigated for spectral efficiencies ranging from 2 to 7 bit/s/Hz. Computer simulation results indicate that BITCMs can achieve near-capacity performance over Rayleigh fading channels, for all spectral efficiencies considered throughout the paper. It is also shown that the combination of turbo coding and rectangular QAM modulation with Gray mapping constitutes inherently a very powerful association, since coding and modulation functions are both optimized for operation in the same signal-to-noise ratio region. This means that no BER improvement is obtainable by employing any other signal constellation in place of the rectangular ones. Finally, the actual influence of the interleaving and mapping functions on error performance of BITCM schemes is discussed.

MSC:

68U99 Computing methodologies and applications
68P30 Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A14 Modulation and demodulation in information and communication theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Near Shannon limit error-correcting coding and decoding: turbo-codes. IEEE ICC’93, Geneva, Switzerland, 1993; 1064-1070.
[2] Hall, IEEE Journal on Selected Areas in Communications 16 pp 160– (1998)
[3] Turbo codes and high spectral efficiency modulation. IEEE ICC’94, New Orleans, U.S.A., 1994; 645-649.
[4] Bandwidth-efficient turbo coding for high speed mobile satellite communications. International Symposium on Turbo Codes and Related Topics, Brest, France, 1997; 119-126.
[5] Caire, IEEE Transactions on Information Theory 44 pp 927– (1998)
[6] Ungerboeck, IEEE Transactions on Information Theory 28 pp 56– (1982)
[7] Parallel concatenated trellis-coded modulation. IEEE ICC’96, Dallas, U.S.A., 1996; 974-978.
[8] Robertson, IEEE Journal on Selected Areas in Communications 16 pp 206– (1998)
[9] Turbo codes and turbo-coded modulation: analysis and performance bounds. Ph.D. dissertation, Northeastern University, Boston, U.S.A., 1998.
[10] Açikel, IEEE Transactions on Communications 47 pp 1315– (1999)
[11] Bit-interleaved turbo-coded modulations for mobile communications. EUSIPCO 2000, Tampere, Finland, 2000; 87-90.
[12] Benedetto, IEEE Transactions on Information Theory 42 pp 409– (1996)
[13] On the design of bit-interleaved turbo-coded modulations. IEEE Information Theory Workshop 2001, Cairns, Australia, 2001; 73-75.
[14] Thomas, IEEE Transactions on Communications 22 pp 168– (1974)
[15] Foschini, IEEE Transactions on Communications 22 pp 28– (1974)
[16] Forney, IEEE Journal on Selected Areas in Communications 2 pp 632– (1984)
[17] Dong, IEEE Transactions on Communications 47 pp 703– (1999)
[18] DSpace Pty Ltd. M4 ?Gold Brick? satellite Modem. www.dspace.com.au/goldbrick.htm.
[19] Iterative Satellite Transceiver. Institute for Telecommunications Research Seminar, University of South Australia, Adelaide, Australia, 2001. www.itr.unisa.edu.au/?adrian/tc.html.
[20] Tarokh, IEEE Transactions on Information Theory 44 pp 744– (1998)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.