In this paper we formally analyze the interleaver and code design for QAM-based BICM transmissions using the binary reflected Gray code. We develop analytical bounds on the bit …
S Kallel, K Li - IEEE Transactions on Information Theory, 1997 - ieeexplore.ieee.org
The main drawback of sequential decoding is the variability of its decoding effort which could cause decoding erasures. We propose and analyze an efficient bidirectional …
The idea of adaptive state allocation (ASA) algorithm is used in this paper to substantially reduce the computational complexity of the maximum-likelihood sequence detection and …
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 …
LE Hguado, PG Farrell - IEEE Transactions on Information …, 1998 - ieeexplore.ieee.org
This correspondence presents sequential algorithms for soft decision decoding of linear block codes. They use a stack algorithm based on the trellis of the code. We are interested in …
IE Bocharova, M Handlery… - IEEE transactions on …, 2005 - ieeexplore.ieee.org
BEAST is a bidirectional efficient algorithm for searching trees. In this correspondence, BEAST is extended to maximum-likelihood (ML) decoding of block codes obtained via …
L Wei, H Qi - IEEE transactions on information theory, 2000 - ieeexplore.ieee.org
We derive an upper bound on the bit-error probability (BEP) in limited-search detection over a finite interference channel. A unified channel model is presented; this includes finite-length …
Bit-interleaved coded modulation (BICM) transceivers often use equally spaced constellations and a random interleaver. In this paper, we propose a new BICM design …