On BICM Receivers for TCM Transmission

Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be significantly improved when the interleaver takes a trivial form (BICM-T), i.e., when it does not interleave the bits at all. In this paper, we give a form...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2011-10, Vol.59 (10), p.2692-2702
Main Authors: Alvarado, A., Szczecinski, L., Agrell, E.
Format: Article
Language:English
Subjects:
Applied sciences
Approximation
Asymptotic properties
Binary Reflected Gray Code
Bit-interleaved Coded Modulation
Channels
Coded Modulation
Codes
Coding, codes
Convolutional Codes
Decoding
Exact sciences and technology
Gain
Hamming weight
Information, signal and communications theory
Interleaver
Measurement
Modulation
Modulation, demodulation
Noise levels
Optimization
Pulse Amplitude Modulation
Quadrature Amplitude Modulation
Radiocommunications
Receivers
Set Partitioning
Signal and communications theory
Studies
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Transmitters
Transmitters. Receivers
Trellis Coded Modulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be significantly improved when the interleaver takes a trivial form (BICM-T), i.e., when it does not interleave the bits at all. In this paper, we give a formal explanation for these results and show that BICM-T is, in fact, the combination of a TCM transmitter and a BICM receiver. To predict the performance of BICM-T, a new type of distance spectrum for convolutional codes is introduced, analytical bounds based on this spectrum are developed, and asymptotic approximations are presented. It is shown that the free Hamming distance of the code is not the relevant optimization criterion for BICM-T. Asymptotically optimal convolutional codes for different constraint lengths are tabulated and BICM-T is shown to offer asymptotic gains of about 2 dB over traditional BICM designs based on random interleavers. The asymptotic gains over uncoded transmission are found to be the same as those obtained by Ungerboeck's one-dimensional trellis-coded modulation (1D-TCM), and therefore, in nonfading channels, BICM-T is shown to be as good as 1D-TCM.
ISSN:0090-6778
1558-0857
1558-0857
DOI:10.1109/TCOMM.2011.091411.100505