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

Abstract—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 paper, we report on our investigation of-ary LDPC coded MRCs, both with AWGN and with burst impairments, and we present a new reduced-complexity decoding algorithm for-ary LDPC codes. We show that-ary LDPC codes outperform binary LDPC codes in the presence of burst impairments. Index Terms—Belief propagation, iterative decoding, low-den-sity parity-check (LDPC) codes, magnetic recording. I