scispace - formally typeset
Journal ArticleDOI

Trellis-coded modulation with bit interleaving and iterative decoding

Reads0
Chats0
TLDR
It is shown that convolutional codes with good Hamming-distance property can provide both high diversity order and large free Euclidean distance for BICM-ID, which provides a simple mechanism for variable-rate transmission.
Abstract
This paper considers bit-interleaved coded modulation (BICM) for bandwidth-efficient transmission using software radios. A simple iterative decoding (ID) method with hard-decision feedback is suggested to achieve better performance. The paper shows that convolutional codes with good Hamming-distance property can provide both high diversity order and large free Euclidean distance for BICM-ID. The method offers a common framework for coded modulation over channels with a variety of fading statistics. In addition, BICM-ID allows an efficient combination of punctured convolutional codes and multiphase/level modulation, and therefore provides a simple mechanism for variable-rate transmission.

read more

Citations
More filters
Journal ArticleDOI

Analysis and design of symbol mappers for iteratively decoded BICM

TL;DR: It is shown that an interleaving gain is achievable for BICM at high signal-to-noise ratio (SNR) and the design rules on the symbol mapper for optimal asymptotic performance at high SNR are derived and a new symbol mappers, called the maximum squared Euclidean weight (MSEW), is proposed.
Journal ArticleDOI

Space-time bit-interleaved coded modulation for OFDM systems

TL;DR: Bit-interleaved coded coded modulation gives good diversity gains with higher order modulation schemes using well-known binary convolutional codes on a single transmit and receive antenna link, and orthogonal frequency division multiplexing (OFDM), wideband transmission can be achieved over frequency-selective fading radio channels without adaptive equalizers.
Journal ArticleDOI

Turbo frequency domain equalization for single-carrier broadband wireless systems

TL;DR: The turbo principle applied jointly to FDE, channel decoding and channel estimation is considered and it is shown that they can provide performance comparable to the time-domain turbo equalization methods but with lower complexity.
Journal ArticleDOI

Performance of trellis-coded CPM with iterative demodulation and decoding

TL;DR: A coherent receiver that performs iterative demodulation and decoding is shown to provide good bit error performance and a noncoherent iterative receiver is proposed and shown to perform close to the coherent Iterative receiver.
Journal ArticleDOI

EXIT Charts for System Design and Analysis

TL;DR: This tutorial elaborate on the concept of EXIT charts using three iteratively decoded prototype systems as design examples, and illustrates further applications ofEXIT charts, including near-capacity designs, the idea of irregular codes and the design of modulation schemes.
References
More filters
Proceedings ArticleDOI

Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1

TL;DR: In this article, a new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed.
Journal ArticleDOI

Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
Journal ArticleDOI

Channel coding with multilevel/phase signals

TL;DR: A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance.
Related Papers (5)