High-throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems
Journal of VLSI Signal Processing Systems
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Capacity-achieving codes for finite-state channels with maximum-likelihood decoding
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Belief propagation with Gaussian priors for pilot-assisted communication over fading ISI channels
IEEE Transactions on Wireless Communications
Design and analysis of successive decoding with finite levels for the Markov channel
IEEE Transactions on Information Theory
Adaptive turbo equalizer with stopping rule based on LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Capacity-achieving codes for channels with memory with maximum-likelihood decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
The equivalence between Slepian-Wolf coding and channel coding under density evolution
IEEE Transactions on Communications
Density evolution for nonbinary LDPC codes under Gaussian approximation
IEEE Transactions on Information Theory
Belief propagation estimation of protein and domain interactions using the sum-product algorithm
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
Semi-analytical performance prediction methods for iterative MMSE-IC multiuser MIMO joint decoding
IEEE Transactions on Communications
Scheduling for an adaptive number of iterations in turbo equalizers combined with LDPC decoders
IEEE Transactions on Communications
Design of nonbinary LDPC codes over GF(q) for multiple-antenna transmission
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 754.96 |
We study the limits of performance of Gallager codes (low-density parity-check (LDPC) codes) over binary linear intersymbol interference (ISI) channels with additive white Gaussian noise (AWGN). Using the graph representations of the channel, the code, and the sum-product message-passing detector/decoder, we prove two error concentration theorems. Our proofs expand on previous work by handling complications introduced by the channel memory. We circumvent these problems by considering not just linear Gallager codes but also their cosets and by distinguishing between different types of message flow neighborhoods depending on the actual transmitted symbols. We compute the noise tolerance threshold using a suitably developed density evolution algorithm and verify, by simulation, that the thresholds represent accurate predictions of the performance of the iterative sum-product algorithm for finite (but large) block lengths. We also demonstrate that for high rates, the thresholds are very close to the theoretical limit of performance for Gallager codes over ISI channels. If C denotes the capacity of a binary ISI channel and if Ci.i.d. denotes the maximal achievable mutual information rate when the channel inputs are independent and identically distributed (i.i.d.) binary random variables (Ci.i.d.≤C), we prove that the maximum information rate achievable by the sum-product decoder of a Gallager (coset) code is upper-bounded by Ci.i.d.. The last topic investigated is the performance limit of the decoder if the trellis portion of the sum-product algorithm is executed only once; this demonstrates the potential for trading off the computational requirements and the performance of the decoder.