• DocumentCode
    2170604
  • Title

    DC-free (d, k) constrained low density parity check (LDPC) codes

  • Author

    Song, Hongwei ; Liu, Jingfeng ; Kumar, B. V. K. Vijaya

  • Author_Institution
    Data Storage Syst. Center, Carnegie Mellon Univ., Pittsburgh, PA, USA
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    377
  • Lastpage
    379
  • Abstract
    Recently, turbo codes and low-density parity check (LDPC) codes with iterative soft decoding have been heavily investigated as potential candidates for low-SNR, high-density data storage systems. However, relatively less attention has been devoted to the investigation of (d, k) run-length limited (RLL) constrained LDPC codes, although run-length constraints are generally employed in data storage channels due to channel nonlinearities and timing recovery issues. In this paper, we propose an extended bit insertion technique to construct DC-free (d, k) constrained LDPC codes. As an example of the proposed method, we construct a DC-free (1,7) LDPC code, and report its performance in an optical storage channel.
  • Keywords
    channel coding; constraint handling; iterative decoding; optical storage; parity check codes; DC-free (d, k) constrained low density parity check codes; RLL LDPC; channel nonlinearities issues; extended bit insertion technique; iterative soft decoding; low-SNR high-density data storage systems; low-density parity check codes; optical storage channels; run-length constraints; run-length limited constrained LDPC codes; timing recovery issues; turbo codes; Concatenated codes; Data storage systems; Decision support systems; Detectors; Interference constraints; Iterative decoding; Memory; Parity check codes; Timing; Turbo codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Optical Memory and Optical Data Storage Topical Meeting, 2002. International Symposium on
  • Print_ISBN
    0-7803-7379-0
  • Type

    conf

  • DOI
    10.1109/OMODS.2002.1028672
  • Filename
    1028672