Method and apparatus for implementing maximum transition run codes
AssigneeRegents of the University of Minnesota
InventorsJaekyun Moon, Barrett J. Brickner
Life of this patent
Estimating the term…
Loading patent…
AssigneeRegents of the University of Minnesota
InventorsJaekyun Moon, Barrett J. Brickner
Estimating the term…
Apparatus and method for coding to improve the minimum distance properties of sequence detectors operating at high densities in storage systems is presented. The coding scheme of the present invention is referred to as maximum transition run (MTR) code and eliminates data patterns producing long runs of consecutive transitions while imposing the usual k constraint necessary for timing recovery. The code has a distance gaining property similar to an existing (1,k) runlength-limited (RLL) code, but can be implemented with considerably higher code rates. When the MTR code is used with fixed delay tree search (FDTS) or high order partial response maximum likelihood (PRML) detectors, the bit error rate performance improves significantly over existing combinations of codes and detectors.
Apparatus for encoding m-bit binary datawords into n-bit binary codewords, in a recorded waveform, where m and n are preselected positive integers such that n is greater than m, comprising:
A method for encoding m-bit binary datawords into n-bit binary codewords in a recorded waveform, where m and n are preselected positive integers such that n is greater than m, comprising the steps of:
Dependencies are inferred from the claim text.