Reduced-Complexity Decoding of Q-ary LDPC Codes for Magnetic Recording

@inproceedings{Song2001ReducedComplexityDO,
  title={Reduced-Complexity Decoding of Q-ary LDPC Codes for Magnetic Recording},
  author={Hongxin Song and J. R. Cruz},
  year={2001}
}
Binary low-density parity-check (LDPC) codes perform very well on magnetic recording channels (MRCs) with additive white Gaussian noise (AWGN). However, an MRC is subject to other impairments, such as media defects and thermal asperities. Binary LDPC codes may not be able to cope with these impairments without the help of a Reed–Solomon code. A better form of coding may be -ary LDPC codes, which have been shown to outperform binary LDPC codes and Reed–Solomon codes on the AWGN channel. In this… CONTINUE READING
Highly Influential
This paper has highly influenced 21 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 232 citations. REVIEW CITATIONS

Citations

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

232 Citations

02040'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 232 citations based on the available data.

See our FAQ for additional information.

References

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

Constrained coding and soft iterative decoding for storage

  • J. L. Fan
  • Ph.D. dissertation, Stanford Univ., Stanford, CA…
  • 1999
1 Excerpt

Error-correction using low-density parity-check codes

  • M. C. Davey
  • Ph.D. dissertation, Univ. Cambridge, Cambridge, U…
  • 1999
3 Excerpts

The performance of generalized maximum transition run trellis codes

  • W. G. Bliss, S. She, L. C. Sundell
  • IEEE Trans. Magn. , vol. 34, pp. 85–90, Jan…
  • 1998
1 Excerpt

Oklahoma, Norman, in 2002, all in electrical engineering. He is now with Marvell Semiconductor, Inc., working on signal processing for communications

  • J. Bergmans
  • Digital Baseband Transmission and Recording
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…