10-07-2014 дата публикации
Номер: US20140191887A1
An array f(n) is received for n=1, . . . , N where N is a length of a codeword. An array g(n) is received for n=1, . . . , N where N is a length of a codeword. Input data is encoded to satisfy an MTR constraint and a RLL constraint using the array f(n) and the array g(n). 1. A system , comprising: receive, for n=1, . . . , N where N is a length of a codeword, an array f(n); and', 'receive, for n=1, . . . , N where N is a length of a codeword, an array g(n); and, 'an interface configured toa processor configured to encode input data to satisfy an MTR constraint and a RLL constraint using the array f(n) and the array g(n).2. The system of claim 1 , wherein f(n) is associated with a number of paths through a zstate claim 1 , in a trellis claim 1 , which is associated with a run of zeros of run length 1 and g(n) is associated with a number of paths through a tstate claim 1 , in the trellis claim 1 , which is associated with a run of ones of run length 1.3. A system claim 1 , comprising: receive, for n=1, . . . , N where N is a length of a codeword, an array f(n); and', 'receive, for n=1, . . . , N where N is a length of a codeword, an array g(n); and, 'an interface configured toa processor configured to decode a codeword using the array f(n) and the array g(n) to obtain user data.4. The system of claim 3 , wherein f(n) is associated with a number of paths through a zstate claim 3 , in a trellis claim 3 , which is associated with a run of zeros of run length 1 and g(n) is associated with a number of paths through a tstate claim 3 , in the trellis claim 3 , which is associated with a run of ones of run length 1.5. A system claim 3 , comprising:a processor; and determine, for a number N, a number of codewords of length N which satisfy a RLL constraint and a MTR constraint;', 'determine, based on the number of codewords, a number M for which a plurality of input data of length M can be uniquely mapped to a codeword; and', 'create a plurality of associations between the ...
Подробнее