Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
140 words
A method for coding binary symbol strings into ternary symbol strings and for synchronously recording said ternary symbol strings onto a magnetic medium such that clocked recovery of the recorded signal may be subsequently made using peak position and polarity detection, comprising the steps of: (a) mapping a binary symbol string into a direction-constrained run length limited (RLL) ternary symbol string; (b) transforming the ternary symbol string into a clocked multilevel recording signal, said recording signal including signal levels in the range -a<0<+a, transitions between levels being made as either full-steps (+a to -a, -a to +a), or half-steps (0 to ±a or ±a to 0), consecutively occurring half-steps being limited to pairs of like polarity (+a, +a; -a, -a), half-steps of alternate polarity (+a, -a; -a, +a) being excluded; and (c) imprinting a magnetic medium with the recording signal.
Claim 2
Independent Claim
140 words
A method for coding binary symbol strings into ternary symbol strings and for synchronously recording said ternary symbol strings onto a magnetic medium such that clocked recovery of the recorded signal may be subsequently made using peak position and polarity detection, comprising the steps of: (a) mapping a binary symbol string into a direction-constrained run length limited (RLL) ternary symbol string; (b) transforming the ternary symbol string into a clocked multilevel recording signal, said recording signal including signal levels in the range -a<0<+a, transitions between levels being made as either full-steps (+a to -a, -a to +a), or half-steps (0 to ±a or ±a to 0), consecutively occurring half-steps being limited to pairs of like polarity (+a, +a; -a, -a), half-steps of alternate polarity (+a, -a; -a, +a) being excluded; and (c) imprinting a magnetic medium with the recording signal.
Claim 3
Dependent Claim
44 words
A method according to claim 1, wherein the mapping step includes the steps of: (a) k-bit blocking of a binary symbol string; and (b) converting the blocked symbol string into a run length limited direction-constrained n>k-bit blocked ternary symbol string at a predetermined rate.
Claim 4
Dependent Claim
94 words
In a high-density, high-data rate, nonsaturated magnetic recording environment of signals consisting of (d,k) run length limited, directionconstrained, ternary symbol encodings of binaray symbol strings using peak position and polarity detection for the readback thereof, a method for binary symbol string recovery comprising the steps of: (a) reading back the recorded signals and detecting therefrom the presence of magnitude peaks and their polarities; (b) converting the detected peak polarities into ternary code symbols, the conversion including a maximum delay of (k+1) clock times; and (c) mapping the ternary code symbols into binary symbol strings.
Claim 5
Dependent Claim
94 words
In a high-density, high-data rate, nonsaturated magnetic recording environment of signals consisting of (d,k) run length limited, directionconstrained, ternary symbol encodings of binaray symbol strings using peak position and polarity detection for the readback thereof, a method for binary symbol string recovery comprising the steps of: (a) reading back the recorded signals and detecting therefrom the presence of magnitude peaks and their polarities; (b) converting the detected peak polarities into ternary code symbols, the conversion including a maximum delay of (k+1) clock times; and (c) mapping the ternary code symbols into binary symbol strings.
Claim 6
Dependent Claim
45 words
A method according to claim 3, wherein in step (b) the delay is used to permit context decoding of halfsteps, and further wherein in step (c) the number of ternary symbol lookahead blocks is a function of the (d,k) constraint and the code rate (k/n).
Claim 7
Dependent Claim
43 words
A method according to claim 3, wherein the mapping step includes the step of blocking the ternary symbols into length n and obtaining k<n length binary symbols by way of table lookup and a lookahead of a predetermined number of ternary symbol blocks.