On Designing Good LDPC Codes for Markov Channels

@article{Eckford2007OnDG,
  title={On Designing Good LDPC Codes for Markov Channels},
  author={Andrew W. Eckford and Frank R. Kschischang and Subbarayan Pasupathy},
  journal={IEEE Transactions on Information Theory},
  year={2007},
  volume={53},
  pages={5-21}
}
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… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS
23 Citations
17 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Similar Papers

Loading similar papers…