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

Reduced-Complexity Receiver Structures for Space–Time Bit-Interleaved Coded Modulation Systems

TL;DR: A family of flexible bandwidth-efficient ST coding schemes which combine space-time (ST) coding and bit-interleaved coded modulation schemes in a narrowband flat-fading channel and single-carrier modems are studied.
Journal ArticleDOI

Data Detection Algorithms for BICM Alternate-Relaying Cooperative Systems With Multiple-Antenna Destination

TL;DR: The interference signal, resulting from the concurrent transmission of the source and one of the relays, is exploited as a beneficial resource to develop an optimal data detection algorithm, which can be implemented by parallel demappers based on a family of Bahl, Cocke, Jelinek, and Raviv algorithms.
Journal ArticleDOI

Self-Concatenated Code Design and its Application in Power-Efficient Cooperative Communications

TL;DR: The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented and the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date are identified.
Journal ArticleDOI

Bit-interleaved turbo equalization over static frequency-selective channels: constellation mapping impact

TL;DR: The asymptotic performance is first pointed out, emphasizing the fundamental role played by the constellation mapping, and this specific feature is then further analyzed using the extrinsic information-transfer chart technique, leading to an efficient optimization tool, showing that bit-interleaved TE can outperform its symbol- interleaved counterpart.
Proceedings ArticleDOI

Bit interleaved coded modulation with space time block codes for OFDM systems

TL;DR: It is shown and quantify both analytically and via simulations that, for frequency selective fading channels, BICM-STBC-OFDM systems can fully and successfully exploit frequency and space diversity to the maximum available extent.
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)