By Topic

Reduced-complexity decoding of high-rate LDPC codes over partial-response channels

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

3 Author(s)
Zhiliang Qin ; Data Storage Institute, Singapore, 117608 ; Kui Cai ; Songhua Zhang

In this paper, we consider high-rate low-density parity-check (LDPC) codes for magnetic recording systems. We propose an efficient approach to reduce the computational complexity of the sum-product algorithm (SPA) for LDPC decoding by restricting the check operation to a small subset of input messages. Furthermore, the first-order MacLaurin Series is used to simplify the core operation and an attenuation factor is introduced to improve bit-error-rate (BER) performance by scaling down log-likelihood ratio (LLR) reliabilities in the decoding process. Simulation results show that the proposed decoder can obtain a noticeable performance gain over the conventional SPA at high signal-to-noise ratios (SNR) when used in turbo equalization schemes; while achieving a significantly lower computational complexity.

Published in:

Communication Systems (ICCS), 2010 IEEE International Conference on

Date of Conference:

17-19 Nov. 2010