Rate 16/17 (d=0,G=6/I=7) modulation code for a magnetic recording channel

Claim 2

Within a magnetic recording channel, a method for encoding a sequence of 16 bit digital data words into a sequence of 17 bit codewords in consonance with predetermined minimum zero run length (d), predetermined maximum zero run length (G) and maximum interleave zero run length (I) coding constraints for recording upon a magnetic medium, comprising the steps of: dividing the 16 bit data word into an 8-bit A byte: a1, a2, a3, a4, a5, a6, a7, a8; and an 8-bit B byte b1, b2, b3, b4, b5, b6, b7, b8, separately testing the A and B bytes for violation of coding constraints, generating P and Q code bytes from the A and B bytes and inserting a center bit C of value one or zero between the P and Q code bytes to form the 17 bit codeword, where C=0 indicates the presence of a coding violation in one or both of the A and B bytes, and where Enc 1 (A byte), Enc 2 (B byte) and Enc 3 (A,B bytes) are distinct functions each of which mapping into a coded byte that can be concatenated with C=0 and another validly coded byte to create the 17 bit codeword in accordance with the predetermined coding constraints.

Claim 3

The encoding method set forth in claim 1 wherein C is determined in accordance with the following: ______________________________________ Violation in A Violation in B C P Byte Q Byte ______________________________________ No No 1 Pass A byte Pass B byte Yes No 0 Enc.sub.1 (A byte) Pass B byte No Yes 0 Enc.sub.2 (B byte) Pass A byte Yes Yes 0 Enc.sub.3 (A byte) Enc.sub.3 (B byte). ______________________________________

Claim 4

The encoding method set forth in claim 1 wherein the predetermined coding constraints comprise (d=0, G=6/I=7) such that each codeword is guaranteed to begin or end with fewer than four consecutive zeros; each codeword is guaranteed to begin or end with fewer than four consecutive zeros in bits with even subscripts (i.e. bits P 2 , P 4 , P 6 , P 8 or Q 2 , Q 4 , Q 6 , Q 8 ); each codeword is guaranteed to begin or end with fewer than four consecutive zeros in bits with odd subscripts (i.e. bits P 1 , P 3 , P 5 , P 7 or Q 1 , Q 3 , Q 5 , Q 7 ); and, all runs of consecutive zeros within a codeword are shorter than seven bits long.

Claim 5

The encoding method set forth in claim 1 wherein the step of dividing the 16 bit data word is carried out by defining bit positions of the A and B bytes symmetrically about the center bit C to have a form of p1, p2, p3, p4, p5, p6, p7, p8, C, q8, q7, q6, q5, q4, q3, q2, q1.

Claim 6

The encoding method set forth in claim 1 comprising the further step of precoding the sequence of 17 bit codewords in accordance with a predetermined precoding function for partial response signaling.

Claim 7

The encoding method set forth in claim 1 wherein the magnetic recording channel is a partial response class IV, maximum likelihood synchronous sampling data detection channel and wherein the predetermined precoding function is 1/(1+D 2 )).

Claim 8

The encoding method set forth in claim 4 wherein the encoding functions Enc 1 (A byte), Enc 2 (B byte) and Enc 3 (A,B bytes) are in accordance with the following logical relationships: c=!AV & !BV; p1=a1 & (c+c2+c3)+b1 & (c41+c42)+c43+c44; p2=a2 & (c+c34+c35)+a3 & (c21+c22+c3+c32)+b3 & (c41+c42)+c23+c33+c43+c24+c36+c44; p3=a3 & (c+c34+c35)+!a3 & (c21+c22+c31+c32)+!b3 & (c41+c42)+c23+c33+c43+c24+c36+c44; p4=a4 & (c+c34+c35)+c22+c32+c33+c42+c24+c36+c44; p5=a5 & (c+c23+c33+c34)+b5 & c43+c21+c22+c31+c32+c35+c41+c42; p6=a6 & (c+c21+c22+c23+c33+c34+c35)+b6 & c43+c31+c32+c41+c42+c36+c44; p7=a7 & (c+c2 c31+c32+c33)+b7 & (c42+c42+c43)+c34+c35+c24+c36; p8=a8 & (c+c23+c31+c32+c33+c34+c35)+b8 & c43+c21+c22+c41+c42; wherein: q1=b1 & (c+c2+c5)+a1 & c4; q2=b2 & (c+c2+c54+c55+c56)+b3 & (c51+c52); q3=b3 & (c+c2+c54+c55+c56)+!b3 & (c51+c52)+a3 & c4+c53; q4=b4 & (c+c2+c54+c55+c56)+ba4 & c4+c52+c53; q5=b5 & (c+c2+c53+c54)+a5 & c4+c51+c52+c55; q6=b6 & (c+c2+c53+c54+c55+c56)+a6 & c4+c51+c52; q7=b7 & (c+c2+c51+c52+c53+c56)+a7 & c4+c54+c55; q8=b8 & (c+c2+c51+c52+c53+c54+c55)+a8 & c4; where, as=!a1 & !a2 & !a3 & !a4; ae=!a2 & !a4 & !a6 & !a8; ao=!a1 & !a3 & !a5 & !a7; an=!a5 & !a6 & !a7 & !a8; aft=a1 & a2 & a3 & a4 & a5 & a6 & a7 & a8; bs=!b1 & !b2 & !b3 & !b4; be=!b2 & !b4 & !b6 & !b8; bo=!b1 & !b3 & !b5 & !b7; bn=!b5 & !b6 & !b7 & !b8; bff=b1 & b2 & b3 & b4 & b5 & b6 & b7 & b8; AV=as+ae+aff; BV=bs+be+bff; av=as+ae+ao+an+aff; bv=bs+be+bo+bn+bff; c21=ae & !a5 & !bv; c22=a3 & a5 & !bv; c23=as & !ae & !bv; c24=aft & !bv; c2=c21+c22+c23+c24; c31=ae & !a5 & bv; c32=ae & a5 & bv; c33=as & !ae & bv; c34=ao & !as & !ae & BV; c35=an & !ao & !as & !ae & BV; c36=aff & bv; c3=c31+c32+c33+c34+c35+c36; c41=be & !bv & !av; c42=be & b5 & !av c43=bs & !be & !av; c44=bff & !av; c4=c41+c42+c43+c44; c51=be & !bv & av; c52=be & b5 & av; c53=bs & !be & av; c54=bo & !bs & !be & av; c55=bn & !bo & !bs & !be & av; c56=bff & av; c5=c51+c52+c53+c54+c55+c56.

Claim 9

The encoding method set forth in claim 1 comprising the further step of decoding the sequence of 17 bit codewords by the steps of: testing the C bit to determine if C equals 1, and if so, decoding by mapping the P byte of the codeword directly to the A byte and the Q byte of the codeword directly to the B byte, if the C bit equals zero, testing the P byte of the codeword to determine encoding of the A byte, encoding of the B byte, or encoding of the A and B bytes, and if the P byte results from a set of bytes created from encoding a violation in the A byte, then decoding in accordance with A=InvEnc 1 (P) and B=Q, where InvEnc 1 (P) is the inverse of Enc 1 (P), if there was a violation in the B byte, then decoding in accordance with A=Q and B=InvEnc 2 (P), where InvEnc 2 (p) is the inverse of Enc 2 (p), if there were violations in the A and B bytes, then decoding in accordance with A=InvEnc 3 (P) and B=InvEnc 3 (Q), where InvEnc 3 (P) and InvEnc 3 (Q) are inverses respectively of Enc 3 (P) and Enc 3 (Q), and removing the C bit, in order to put out decoded 16 bit digital data words.