High-rate RLL encoding
AssigneeInternational Business Machines Corporation
InventorsRoy D. Cideciyan, Evangelos S. Eleftheriou, Thomas Mittelholzer, Paul J. Seger, Keisuke Tanaka
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsRoy D. Cideciyan, Evangelos S. Eleftheriou, Thomas Mittelholzer, Paul J. Seger, Keisuke Tanaka
Estimating the term…
An unencoded m-bit data input sequence is divided into a block of n bits and a block of m−n bits. The block of n bits is divided into a first set of n+1 encoded bits, wherein at least one of P1 subblocks of the first set satisfies a G, M and I constraints. The first set of n+1 encoded bits is mapped into a second set of n+1 encoded bits wherein at least one of P2 subblocks of the second set gives rise to at least Q1 transitions after 1/(1+D2) precoding. A second set of n+1 encoded bits is divided into P3 encoded subblocks and the P3 encoded subblocks are interleaved among (m−n)/s unencoded symbols so as to form a (m+1)-bit output sequence codeword which is then stored on a data storage medium.
A method for encoding a data input sequence of m bits into an output sequence codeword of m+1 bits, where m is an integer multiple of 16, the method comprising the steps of:
The method of clam 2, further comprising:
A system for encoding a data input sequence of m bits into an output sequence codeword of m+1 bits, where m is an integer multiple of 16, comprising:
An encoder for encoding a data input sequence of m bits into an output sequence codeword of m+1 bits, where m is an integer multiple of an ECC symbol size s, comprising:
Dependencies are inferred from the claim text.