By Topic

Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hongxin Song ; Sch. of Electr. & Comput. Eng., Univ. of Oklahoma, Norman, OK, USA ; J. R. Cruz

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 Q-ary LDPC codes, which have been shown to outperform binary LDPC codes and Reed-Solomon codes on the AWGN channel. In this paper, we report on our investigation of Q-ary LDPC coded MRCs, both with AWGN and with burst impairments, and we present a new reduced-complexity decoding algorithm for Q-ary LDPC codes. We show that Q-ary LDPC codes outperform binary LDPC codes in the presence of burst impairments.

Published in:

IEEE Transactions on Magnetics  (Volume:39 ,  Issue: 2 )