Decoding LDPC convolutional codes on Markov channels
EURASIP Journal on Wireless Communications and Networking
Density Evolution Analysis of Robustness for LDPC Codes over the Gilbert-Elliott Channel
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
A channel representation method for the study of hybrid retransmission-based error control
IEEE Transactions on Communications
On reliable communications over channels impaired by bursty impulse noise
IEEE Transactions on Communications
Design and analysis of successive decoding with finite levels for the Markov channel
IEEE Transactions on Information Theory
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
On the design of irregular LDPC code ensembles for BIAWGN channels
IEEE Transactions on Communications
| Hi-index | 754.90 |
This paper presents a reduced-complexity approximate density evolution (DE) scheme for low-density parity-check (LDPC) codes in channels with memory in the form of a hidden Markov chain. This approximation is used to design degree sequences representing some of the best known LDPC code ensembles for the Gilbert-Elliott channel, and example optimizations are also given for other Markov channels. The problem of approximating the channel estimation is addressed by obtaining a specially constructed message-passing schedule in which the channel messages all approach their stable densities. It is shown that this new schedule is much easier to approximate than the standard schedule, but has the same ultimate performance in the limits of long block length and many decoding iterations. This result is extended to show that all message-passing schedules that satisfy mild conditions will have the same threshold under density evolution