Run-length Limited Codes with Free Distance Properties: Construction and Soft-Decision Decoding

Abstract

In this work, we have constructed RLL codes that can be used effectively with an outer LDPC code in the standard concatenation configuration. The main idea in the construction is the use of a two-state trellis representation for the sequences satisfying a (d, k) constraint. The constructed RLL codes have a free distance of 2 on this two-state trellis. This enables the use of a low-complexity, 2-state BCJR algorithm for soft-decoding the RLL codes in an iterative decoder. The method can be generalized to construct codes for other constraints as well.

Topics

    4 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)