Method and apparatus for implementing PRML codes with maximum ones

• US 5,196,849 A
• Filed: 01/31/1992
• Issued: 03/23/1993
• Est. Priority Date: 01/31/1992
• Status: Expired due to Term

• Current Assignee: Hitachi Global Storage Technologies Netherlands BV (Western Digital Corporation)
• Original Assignee: International Business Machines Corporation
• Inventors: Galbraith, Richard L.
• Primary Examiner(s): Pellinen, A. D.
• Assistant Examiner(s): Young, Brian K.
• Application Number:
  US07/829,796
• Time in Patent Office: 417 Days
• Field of Search: 341/59, 341/50, 341/58, 341/119, 341/133, 341/135, 341/136, 371/95, 371/43, 371/44, 371/55, 375/18, 375/34
• US Class Current: 341/59
• CPC Class Codes: G11B 20/1426 conversion to or from block codes or representations thereof
• CPC Class Codes: G11B 2020/1434 8 to 9 modulation
• CPC Class Codes: H03M 5/145 Conversion to or from block codes or representations thereof

Abstract

Apparatus and methods are provided for encoding a predefined number of bits of binary data into codewords having a predefined number of bits for a partial-response maximum-liklihood (PRML) data channel in a direct access storage device (DASD). Rate 8/9 block codes having maximum ones and run length constraints (0,8,12,∞) and (0,8,6,∞) provide timing and gain control and reduced susceptibility to misequalization effects in PRML channels.

Claims

1. A method for encoding a predefined number of bits of binary data into codewords having a predefined number of bits for a partial-response maximum-likelihood (PRML) data channel in a direct access storage device (DASD) comprising the steps of:

receiving the binary data; and

generating sequences of codewords responsive to the received binary data;

each of said generated codewords being included within a predetermined set of codewords, said codeword set having a maximum number of binary ones;

said generated sequences of codewords having less than a first predetermined number of consecutive zeros;

said generated sequences of codewords including two subsequences, one of said subsequences including odd bit positions and another of said subsequences including even bit positions, said subsequences having less than a second predetermined number of consecutive zeros.

2. A method as recited in claim 1 wherein 8-bits of binary data are encoded into 9-bit codewords and said predetermined set of codewords includes 256 codewords and at least 253 codewords have at least 5 ones and wherein said step of generating sequences of codewords includes the steps of:

calculating the sum of said 8-bits of binary data;

comparing the calculated sum with 4;

defining an intermediate variable responsive to said compared values.

3. A method as recited in claim 2 further includes the steps of:

defining the intermediate variable equal to zero responsive to the calculated sum less than 4;

defining the intermediate variable equal to one responsive to the calculated sum greater than or equal to 4.

4. A method as recited in claim 3 wherein said first predetermined number equals 8 and wherein said second predetermined number equals 12 and further includes the steps of:

combining the defined intermediate variable and each of said 8-bits by an exclusive nor operation to define 8 of the 9-bit codeword; and

defining another codeword bit equal to the defined intermediate variable.

5. A method as recited in claim 3 wherein said first predetermined number equals 8 and wherein said second predetermined number equals 6 and further includes the steps of:

defining a second intermediate variable as a function of said 8-bits of binary data;

combining the defined intermediate variable and each of said 8-bits by an exclusive or operation;

defining 8 of the 9-bit codeword as a function of said combined bits and said second intermediate variable; and

combining the defined intermediate variable and the second intermediate variable by an exclusive or operation to define another codeword bit.

6. A method as recited in claim 1 wherein said generated sequences of codewords provide greater power density in the center of the PRML channel bandwidth and less power at the bandwidth edges whereby susceptibility to misequalization is reduced.

7. Apparatus for encoding a predefined number of bits of binary data into codewords having a predefined number of bits for a partial-response maximum-likelihood (PRML) data channel in a direct access storage device (DASD) comprising:

means for receiving the binary data; and

means coupled to said receiving means for generating sequences of codewords responsive to the received binary data;

each of said generated codewords being includes within a predetermined set of codewords, said codeword set having a maximum number of binary ones;

said generated sequences of codewords having less than a first predetermined number of consecutive zeroes;

said generated sequences of codewords including two subsequences, one of said subsequences including odd bit positions and another of said subsequences including even bit positions, said subsequences having less than a second predetermined number of consecutive zeroes.

8. Apparatus as recited claim 7 wherein 8-bits of binary data are encoded into 9-bit codewords and wherein said means for generating sequences of codewords includes means for defining an intermediate variable equal to either one or zero responsive to each received 8-bits of binary data.

9. Apparatus as recited claim 8 wherein said first predetermined number equals 8 and wherein said second predetermined number equals 12 and further includes:

means for combining the defined intermediate variable and each of said 8-bits by an exclusive nor operation to define 8 of the 9-bit codeword; and

means for defining another codeword bit equal to the defined intermediate variable.

10. Apparatus as recited claim 8 wherein said first predetermined number equals 8 and wherein said second predetermined number equals 6 and further includes:

means for defining a second intermediate variable as a function of said 8-bits of binary data;

means for combining the defined intermediate variable and each of said 8-bits by an exclusive or operation;

means for defining 8 of the 9-bit codeword as a function of said combined bits and said second intermediate variable; and

means for combining the defined intermediate variable and the second intermediate variable by an exclusive or operation to define another codeword bit.

11. Apparatus as recited claim 9 further includes decoder means for decoding said generated sequences of codewords.

12. Apparatus as recited claim 11 wherein said decoder means includes means for combining each of the defined 8 of the 9-bit codeword with said other codeword bit by an exclusive nor operation to produce the binary data.

13. Apparatus as recited claim 10 further includes decoder means for decoding said generated sequences of codewords.

14. Apparatus as recited claim 13 wherein said decoder means includes means for combining each of the defined 8 of the 9-bit codeword with said other codeword bit by an exclusive nor operation and means for combining said combined bits with said second intermediate value to produce the binary data.

15. Apparatus as recited claim 8 wherein said first predetermined number equals 8 and wherein said second predetermined number equals 12 and wherein said encoding apparatus includes a plurality of gating means for producing the codewords.

16. Apparatus as recited claim 8 wherein said first predetermined number equals 8 and wherein said second predetermined number equals 6 and wherein said encoding apparatus includes a plurality of gating means for producing the codewords.