Joint iterative decoding of LDPC codes for channels with memory and erasure noise

@article{Pfister2008JointID,
  title={Joint iterative decoding of LDPC codes for channels with memory and erasure noise},
  author={Henry D. Pfister and Paul H. Siegel},
  journal={IEEE Journal on Selected Areas in Communications},
  year={2008},
  volume={26}
}
This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve, under joint iterative decoding, the symmetric information rate of a class of channels with memory and erasure noise. This gives proof, for the first time, that joint iterative decoding can be information rate lossless with respect to maximum-likelihood decoding. These results build on previous capacity-achieving… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Citations

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

Threshold saturation on channels with memory via spatial coupling

2011 IEEE International Symposium on Information Theory Proceedings • 2011
View 6 Excerpts
Highly Influenced

Upper bounds on the MAP threshold of iterative decoding systems with erasure noise

2008 5th International Symposium on Turbo Codes and Related Topics • 2008
View 7 Excerpts
Highly Influenced

Design Guidelines of Low-Density Parity-Check Codes for Magnetic Recording Systems

IEEE Communications Surveys & Tutorials • 2018
View 4 Excerpts
Highly Influenced

Spatially-coupled codes approach symmetric information rate of finite-state Markov fading channels

2016 IEEE International Symposium on Information Theory (ISIT) • 2016
View 2 Excerpts

A simple proof of threshold saturation for coupled scalar recursions

2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) • 2012
View 2 Excerpts

References

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

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel • 2004
View 12 Excerpts
Highly Influenced

Asymptotic analysis of turbo codes over the binary erasure channel

C. Méasson, R. Urbanke
Proc. 12th Joint Conf. on Comm. and Coding, (Saas Fee, Switzerland), March 2002. • 2002
View 9 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…