Constraint gain

In digital storage systems where the input to the noisy channel is required to satisfy a modulation constraint, the constrained code and error-control code (ECC) are typically designed and decoded independently. The achievable rate for this situation is evaluated as the rate of average intersection of the constraint and the ECC. The gap from the capacity of the noisy constrained channel is called the constraint gain, which represents the potential improvement in combining the design and decoding of the constrained code and the ECC. The constraint gain is computed for various constraints over the binary-input additive white Gaussian noise (AWGN) channel (BIAWGNC) as well as over intersymbol interference (ISI) channels. Finally, it is shown that an infinite cascade of reverse concatenation with independent decoding of constraint and ECC has a capacity equal to the rate of average intersection.

[1]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[2]  Paul H. Siegel,et al.  Codes for Digital Recorders , 1998, IEEE Trans. Inf. Theory.

[3]  Hans-Andrea Loeliger,et al.  Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.

[4]  Pascal O. Vontobel,et al.  An upper bound on the capacity of channels with memory and constraint input , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[5]  Adriaan J. de Lind van Wijngaarden,et al.  Maximum runlength-limited codes with error control capabilities , 2001, IEEE J. Sel. Areas Commun..

[6]  John M. Cioffi,et al.  Constrained coding techniques for soft iterative decoders , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[7]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[8]  A. Patapoutian,et al.  The (d,k) Subcode Of A Linear Block Code , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[9]  Schouhamer Immink,et al.  Codes for mass data storage systems , 2004 .

[10]  L.B. Milstein,et al.  On the Cutoff Rate of a Discrete Memoryless Channel with (d, k)-Constrained Input Sequences , 1992, IEEE J. Sel. Areas Commun..

[11]  Chris Heegard,et al.  On the capacity of the noisy runlength channel , 1991, IEEE Trans. Inf. Theory.

[12]  Aleksandar Kavcic.  On the capacity of Markov sources over noisy channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[13]  Claude E. Shannon,et al.  A Mathematical Theory of Communications , 1948 .

[14]  A. Robert Calderbank,et al.  A Modified Concatenated Coding Scheme, with Applications to Magnetic Data Storage , 1998, IEEE Trans. Inf. Theory.

[15]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[16]  Brian H. Marcus,et al.  Finite-State Modulation Codes for Data Storage , 2004 .

[17]  G. Langdon,et al.  Enumerative Modulation Coding with Arbitrary Constraints and Post- Modulation Error Correction Coding and Data Storage Systems, 5.4 Reduction of Edge Eeect in Error Propagation , 2022 .

[18]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[19]  Jack K. Wolf,et al.  On runlength codes , 1988, IEEE Trans. Inf. Theory.

[20]  Jan L. Fan,et al.  Constrained coding and soft iterative decoding , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[21]  Brian H. Marcus,et al.  Constrained systems with unconstrained positions , 2002, IEEE Trans. Inf. Theory.

[22]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[23]  Kees A. Schouhamer Immink.  A practical method for approaching the channel capacity of constrained channels , 1997, IEEE Trans. Inf. Theory.

[24]  Masud Mansuripur,et al.  Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems , 1991, Other Conferences.