By Topic

Low density parity check (LDPC) codes for optical data storage

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
$31 $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)
Bhagavatula, V. ; Data Storage Syst. Center, Carnegie Mellon Univ., Pittsburgh, PA, USA ; Hongwei Song ; Jingfeng Liu

Low-density parity check (LDPC codes, first introduced by Gallager (1962), are error-correcting codes based on very sparse parity check matrices. Recently, in the wake of excellent performance of turbo codes, LDPC codes were rediscovered as another category of random codes approaching the Shannon capacity limit with practical decoding complexity. Extensive investigation of the applications of turbo codes and LDPC codes for data storage channels has been reported. While LDPC codes can be iteratively decoded using the sum-product algorithm with moderate complexity, the memory required to specify the nonzero elements in the random parity check matrix can be a major challenge for hardware implementation. Construction of good LDPC codes with structure is particularly desired in data storage channels to facilitate low complexity implementation. We address this issue by introducing a class of low complexity structured LDPC codes which are useful for optical data storage.

Published in:

Optical Memory and Optical Data Storage Topical Meeting, 2002. International Symposium on

Date of Conference: