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
Proceedings ArticleDOI

Blind separation of the single-channel mixed signal based on BICM-ID

TL;DR: An algorithm based on bit-interleaved code modulation iterative decoder (BICM-ID) scheme is proposed in the paper which joints demapping and decoding and can recover multi-path source signals from a single-channel mixed signal.

Exploiting diversity in wireless channels with bit-interleaved coded modulation and iterative decoding (BICM-ID)

Huu Nghi Tran
TL;DR: This dissertation studies a state-of-the-art bandwidth-efficient coded modulation technique, known as bit interleaved coded modulation with iterative decoding (BICMID), together with various diversity techniques to dramatically improve the performance of digital communication systems over wireless channels.
Proceedings ArticleDOI

Performance of coded residual arithmetic differential MPSK modulation

TL;DR: R residual arithmetic codes for channel coding are proposed and it is shown that the arithmetic codes can achieve similar or better bit error rate (BER) performance than convolutional codes of the same rate and asymptotic coding gain at t = 1, 2 error correcting capability with minimal complexity.
Patent

Wireless communication system and method using SISO decoder

TL;DR: In this article, a priori output probabilities produced by a probability generator (34) are combined and then input to a SISO decoder (111), where the combined a posteriori output probability (115) produced by the decoder are split and then fed back to the probability generator.
Proceedings ArticleDOI

Performance Analysis and Early Stopping Criterion for PA-BICM-ID Over Frequency-Selective Rayleigh Fading Channel

TL;DR: It is shown that PA-BICM-ID outperforms optimally-labelled BICM -ID over frequency-selective Rayleigh fading channel and the application of early-stopping techniques, in order to break iterative decoding procedure once it is believed that the complete data frame can be correctly estimated.
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)