← Back to Patent Explorer
US4949200A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for encoding and mapping magnetic disk sector addresses

Assignee: Digital Equipment Corp
•
Filing: 1988-03-31
•
Granted: 1990-08-14
•
Expires: 2008-03-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Addresses corresponding to magnetic disk sectors are encoded using an error correction code (ECC), such that addresses which are in a neighborhood, that is, addresses which are mathematically or numerically close, are mapped to addresses which differ in at least D-1 bits where the ECC is a distance D code. An original n-bit sector address is separated into two segments. One segment is a "k"-bit neighborhood address segment containing the k lower order address bits identifying the location of the selected sector within a neighborhood. The second segment is an "n-k" bit higher order address segment identifying the neighborhood containing the selected sector. The k-bit neighborhood address segment is then encoded with an (n,k) distance D linear code to form an n-bit preliminary code word containing n-k redundancy (ECC) bits appended, as the most significant bits, to the k neighborhood address bits. The (n-k)-bit higher order address segment is encoded by representing the segment in Gray code. The (n-k)-bit Gray coded segment is added modulo 2 to the n-k redundancy (ECC) bits of the preliminary code word. The resulting n-bit address code word is recorded on the disk as the sector address. When a particular sector is to be accessed, the address is first encoded in the manner set forth above, and the read/write head is moved to the logical neighborhood containing the sector. The encoded address is then compared to the addresses written in the various sectors in the neighborhood. When a match within (D-2)/2 bits is found, the sector is identified as the correct sector.

Inventors

  • 👤 Lih-Jyh Weng

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 23:22
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1833; G11B27/00; G11B27/10; G11B27/19; G11B27/28; G11B27/30; G11B27/3027; G11B2220/00; G11B2220/20; G11B2220/25; G11B2220/2508

Claims Analysis

Total Claims: 55
Claim 1
Independent Claim 273 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n bits into two segments, a segment containing the k lower order bits and a segment containing the n-k higher order bits; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; F. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as a correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 2
Independent Claim 273 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n bits into two segments, a segment containing the k lower order bits and a segment containing the n-k higher order bits; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; F. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as a correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 3
Dependent Claim 70 words
The method of claim 1 wherein said encoding step further includes encoding said n-bit address code word using a (p,n) distance E linear code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits.
Claim 4
Dependent Claim 72 words
The method of claim 2 wherein said encoding step further includes encoding said n-symbol address code word using a (p,n) distance E linear code over Galois Field GF(2 m ) to produce p-n redundancy symbols and appending said redundancy symbols to said n-symbol address code word to form a p-symbol address code word such that the p-symbol address code word differs from any other p-symbol address codeword by at least E-1/2 symbols.
Claim 5
Dependent Claim 24 words
The method of claim 1 wherein said comparison step further includes adding modulo 2 said address code words and said specified address code words.
Claim 6
Independent Claim 264 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n m-bit symbols into two segments, a k lower order symbol segment and an n-k higher order symbol segment; 2. using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment in an n-symbol code word containing n-k redundancy symbols and the k address symbols; 3. representing said n-k higher order symbol segment in binary Gray code; 4. adding modulo 2 said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; F. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 7
Independent Claim 264 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n m-bit symbols into two segments, a k lower order symbol segment and an n-k higher order symbol segment; 2. using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment in an n-symbol code word containing n-k redundancy symbols and the k address symbols; 3. representing said n-k higher order symbol segment in binary Gray code; 4. adding modulo 2 said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; F. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 8
Independent Claim 271 words
An apparatus for locating data sectors on a magnetic disk during sector seeking operations comprising: A. means for encoding the addresses of the sectors to produce address code words comprising: 1. means for separating the sector address containing n bits into two segments, a k lower order bit segment and an n-k higher order bit segment; 2. means for using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; p2 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; B. means for recording said address code words in the sectors during the formatting of the disk; C. means for encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; D. means for comparing said address code word read from a disk sector with said specified address code word; E. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, means for identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 9
Independent Claim 271 words
An apparatus for locating data sectors on a magnetic disk during sector seeking operations comprising: A. means for encoding the addresses of the sectors to produce address code words comprising: 1. means for separating the sector address containing n bits into two segments, a k lower order bit segment and an n-k higher order bit segment; 2. means for using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; p2 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; B. means for recording said address code words in the sectors during the formatting of the disk; C. means for encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; D. means for comparing said address code word read from a disk sector with said specified address code word; E. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, means for identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 10
Dependent Claim 72 words
The apparatus of claim 6 wherein said encoding means further comprises means for encoding said n-bit address code word using a (p,n) distance E linear code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits.
Claim 11
Dependent Claim 29 words
The apparatus of claim 6 wherein said comparison means further includes means for step further includes adding modulo 2 said address code words and said specified address code words.
Claim 12
Independent Claim 278 words
An apparatus for locating data sectors on a magnetic disk during sector seeking operations comprising: A. means for encoding the addresses of the sectors to produce address code words comprising: 1. means for separating the sector address containing n m-bit symbols into two segments, a segment containing k lower order symbols and a segment containing n-k higher order symbols, 2. means for using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols, 3. means for representing said n-k redundancy symbol segment in binary Gray code, 4. means for adding modulo 2 said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; B. means for recording said address code words in the sectors during the formatting of the disk; C. means for reading said address code word from the sector rotating under the head; D. means for encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; F. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 13
Independent Claim 278 words
An apparatus for locating data sectors on a magnetic disk during sector seeking operations comprising: A. means for encoding the addresses of the sectors to produce address code words comprising: 1. means for separating the sector address containing n m-bit symbols into two segments, a segment containing k lower order symbols and a segment containing n-k higher order symbols, 2. means for using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols, 3. means for representing said n-k redundancy symbol segment in binary Gray code, 4. means for adding modulo 2 said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; B. means for recording said address code words in the sectors during the formatting of the disk; C. means for reading said address code word from the sector rotating under the head; D. means for encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; F. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 14
Dependent Claim 73 words
The apparatus of claim 9 wherein said encoding means further comprises means for encoding said n-symbol address code word using a (p,n) distance E linear code over Galois Field GF(2 m ) to produce p-n redundancy symbols and appending said redundancy symbols to said address code word to form a p-symbol address code word such that the p-symbol address code word differs from any other p-symbol address codeword by at least E-1/2 symbols.
Claim 15
Dependent Claim 26 words
The apparatus of claim 9 wherein said comparison means further includes means for adding modulo 2 said address code words and said specified address code words.
Claim 16
Independent Claim 147 words
A method for encoding magnetic disk data sector addresses comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n bits into two segments, a segment containing the k lower order bits and a segment containing the n-k higher order bits; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; and B. recording said address code words in the sectors during the formatting of the disk.
Claim 17
Independent Claim 147 words
A method for encoding magnetic disk data sector addresses comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n bits into two segments, a segment containing the k lower order bits and a segment containing the n-k higher order bits; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; and B. recording said address code words in the sectors during the formatting of the disk.
Claim 18
Dependent Claim 70 words
The method of claim 12 wherein said encoding step further includes encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits.
Claim 19
Dependent Claim 70 words
The method of claim 12 wherein said encoding step further includes encoding said n-symbol address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-symbol address code word to form a p-symbol address code word such that the p-symbol address code word differs from any other p-symbol address codeword by at least E-1/2 symbols.
Claim 20
Independent Claim 108 words
An apparatus for encoding magnetic disk data sector addresses comprising: A. means for encoding the addresses of the sectors to produce address code words comprising: 1. means for separating the sector address containing n bits into two segments, a k lower order bit segment and an n-k higher order bit segment; 2. means for using a distance D linear (n,k) code over Galois field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code;
Claim 21
Independent Claim 108 words
An apparatus for encoding magnetic disk data sector addresses comprising: A. means for encoding the addresses of the sectors to produce address code words comprising: 1. means for separating the sector address containing n bits into two segments, a k lower order bit segment and an n-k higher order bit segment; 2. means for using a distance D linear (n,k) code over Galois field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code;
Claim 22
Dependent Claim 43 words
means for adding said Gray coding segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; and B. means for recording said address code words in the sectors during the formatting of the disk.
Claim 23
Dependent Claim 43 words
means for adding said Gray coding segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; and B. means for recording said address code words in the sectors during the formatting of the disk.
Claim 24
Dependent Claim 71 words
The apparatus of claim 15 wherein said encoding means further comprises means for encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits.
Claim 25
Independent Claim 241 words
An apparatus for locating a sector on a magnetic disk comprising: A. means for reading an address code word from the sector rotating under the head; B. means for encoding the specified address of the sector to be located to produce an address code word comprising: 1. means for separating the sector address containing n bits into two segments, a k lower order bit segment and an n-k higher order bit segment; 2. means for using a distance D linear (n,k) code over Galois field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coding segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; C. means for comparing said specified address code word with the sector address code word read from a disk sector; D. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 26
Independent Claim 241 words
An apparatus for locating a sector on a magnetic disk comprising: A. means for reading an address code word from the sector rotating under the head; B. means for encoding the specified address of the sector to be located to produce an address code word comprising: 1. means for separating the sector address containing n bits into two segments, a k lower order bit segment and an n-k higher order bit segment; 2. means for using a distance D linear (n,k) code over Galois field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coding segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; C. means for comparing said specified address code word with the sector address code word read from a disk sector; D. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 27
Dependent Claim 26 words
The apparatus of claim 17 wherein said comparison means further includes means for adding modulo 2 said address code words and said specified address code words.
Claim 28
Dependent Claim 72 words
The apparatus of claim 17 wherein said encoding means further comprises means for encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits.
Claim 29
Independent Claim 213 words
A method of locating magnetic disk data sectors comprising the steps of: A. reading the address code word recorded in the sector rotating under the head; B. encoding the specified address of the sector to be located by: 1. separating the specified address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; C. comparing said specified address code word with the address code word read from a disk sector; and D. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 30
Independent Claim 213 words
A method of locating magnetic disk data sectors comprising the steps of: A. reading the address code word recorded in the sector rotating under the head; B. encoding the specified address of the sector to be located by: 1. separating the specified address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; C. comparing said specified address code word with the address code word read from a disk sector; and D. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 31
Dependent Claim 72 words
The apparatus of claim 20 wherein said encoding means further comprises means for encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits.
Claim 32
Dependent Claim 72 words
The apparatus of claim 20 wherein said encoding means further comprises means for encoding sand n-symbol address code word using a distance E linear (p,n) code cover Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-symbol address code word to form a p-symbol address code word such that the p-symbol address code word differs from any other p-symbol address codeword by at least E-1/2 symbols.
Claim 33
Dependent Claim 26 words
The apparatus of claim 20 wherein said comparison means further includes means for adding modulo 2 said address code words and said specified address code words.
Claim 34
Dependent Claim 26 words
The apparatus of claim 20 wherein said comparison means further includes means for adding modulo 2 said address code words and said specified address code words.
Claim 35
Independent Claim 152 words
An apparatus for encoding magnetic disk sector addresses comprising: A. means for encoding the addresses of the sectors to produce address code words by: 1. means for separating the sector address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. means for using a distance D linear code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coding segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; and B. means for recording said address code words in the sectors during the formatting of the disk.
Claim 36
Independent Claim 152 words
An apparatus for encoding magnetic disk sector addresses comprising: A. means for encoding the addresses of the sectors to produce address code words by: 1. means for separating the sector address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. means for using a distance D linear code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addresses differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coding segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; and B. means for recording said address code words in the sectors during the formatting of the disk.
Claim 37
Dependent Claim 74 words
The apparatus of claim 25 wherein said encoding means further comprises means for encoding said n-symbol address code word using a distance E linear (p,n) code over Galois Field GF(2 m ) to produce p-n redundancy symbols and appending said redundancy symbols to said n-symbol address code word to form a p-symbol address code word such that the p-symbol address code word differs from any other p-symbol address codeword by at least E-1/2 bits.
Claim 38
Independent Claim 244 words
An apparatus for locating sectors on a magnetic disk comprising: A. means for reading said address code word from the sector rotating under the head; B. encoding means for encoding the specified address of the sector to be located, said encoding means including: 1. means for separating the sector address containing n m-bits symbols into two segments, a segment containing k lower order symbols and a segment containing n-k higher order symbols; 2. means for using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k-address symbols such that any two encoded addresses differ by at least D-1/2 symbols; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; C. means for comparing said sector address code word read from a disk sector with said specified address code word; D. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, means for identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 39
Independent Claim 244 words
An apparatus for locating sectors on a magnetic disk comprising: A. means for reading said address code word from the sector rotating under the head; B. encoding means for encoding the specified address of the sector to be located, said encoding means including: 1. means for separating the sector address containing n m-bits symbols into two segments, a segment containing k lower order symbols and a segment containing n-k higher order symbols; 2. means for using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k-address symbols such that any two encoded addresses differ by at least D-1/2 symbols; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; C. means for comparing said sector address code word read from a disk sector with said specified address code word; D. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, means for identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 40
Dependent Claim 26 words
The apparatus of claim 27 wherein said comparison means further includes means for adding modulo 2 said address code words and said specified address code words.
Claim 41
Dependent Claim 74 words
The apparatus of claim 27 wherein said encoding means further comprises means for encoding said n-symbols address code word using a distance E linear (p,n) code over Galois Field GF(2 m ) to produce p-n redundancy symbols and appending said redundancy symbols to said n-symbols address code word to form a p-symbols address code word such that the p-symbols address code word differs from any other p-symbols address codeword by at least E-1/2 symbols.
Claim 42
Independent Claim 339 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words comprising: 1. separating the sector address containing n m-bit symbols into two segments, a k lower order symbol segment and an n-k higher order symbol segment, 2. using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols such that any two encoded addresses differ by at least D-1/2 symbols, 3. representing said n-k redundancy symbol segment in binary Gray code, 4. adding modulo 2 said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; 5. encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2 m ) to produce p-n redundancy symbols and appending said redundancy symbols to said n-symbol address code word to form a p-symbol address code word such that the p-symbol address code word differs from any other p-symbol address codeword by at least E-1/2 bits; and B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; and F. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 43
Independent Claim 339 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words comprising: 1. separating the sector address containing n m-bit symbols into two segments, a k lower order symbol segment and an n-k higher order symbol segment, 2. using a distance D linear (n,k) code over Galois Field GF(2 m ) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols such that any two encoded addresses differ by at least D-1/2 symbols, 3. representing said n-k redundancy symbol segment in binary Gray code, 4. adding modulo 2 said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; 5. encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2 m ) to produce p-n redundancy symbols and appending said redundancy symbols to said n-symbol address code word to form a p-symbol address code word such that the p-symbol address code word differs from any other p-symbol address codeword by at least E-1/2 bits; and B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word; and F. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 44
Independent Claim 147 words
A method for encoding magnetic disk data sector addresses comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n symbols into two segments, a segment containing the k lower order symbols and a segment containing the n-k higher order symbols; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols such that any two encoded addresses differ by at least D-1/2 symbols; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; and B. recording said address code words in the sectors during the formatting of the disk.
Claim 45
Independent Claim 147 words
A method for encoding magnetic disk data sector addresses comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n symbols into two segments, a segment containing the k lower order symbols and a segment containing the n-k higher order symbols; 2. using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols such that any two encoded addresses differ by at least D-1/2 symbols; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; and B. recording said address code words in the sectors during the formatting of the disk.
Claim 46
Independent Claim 64 words
A method of locating magnetic disk data sectors comprising the steps of: A. reading the address code word recorded in the sector rotating under the head; B. encoding the specified address of the sector to be located by: 1. separating the specified address containing n symbols into two segments, a segment containing k lower order symbols and a segment containing n-k higher order symbols;
Claim 47
Independent Claim 64 words
A method of locating magnetic disk data sectors comprising the steps of: A. reading the address code word recorded in the sector rotating under the head; B. encoding the specified address of the sector to be located by: 1. separating the specified address containing n symbols into two segments, a segment containing k lower order symbols and a segment containing n-k higher order symbols;
Claim 48
Dependent Claim 148 words
using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; C. comparing said specified address code word with the address code word read from a disk sector; and D. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 49
Dependent Claim 148 words
using a distance D linear (n,k) code over Galois Field GF(2) to encode said k-symbol segment into an n-symbol code word containing n-k redundancy symbols and the k address symbols; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order symbols of said n-symbol code word to produce an n-symbol address code word; C. comparing said specified address code word with the address code word read from a disk sector; and D. (1) if the comparison results in a number of symbols which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of symbols which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 50
Independent Claim 338 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. using a distance D linear code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addressed differ by at least D-1/2 bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; 5. encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits; B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word by adding them using modulo 2 addition; and F. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 51
Independent Claim 338 words
A method for locating data sectors on a magnetic disk during sector seeking operations comprising the steps of: A. encoding the addresses of the sectors to produce address code words by: 1. separating the sector address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. using a distance D linear code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addressed differ by at least D-1/2 bits; 3. representing said n-k redundancy symbol segment in Gray code; 4. adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; 5. encoding said n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits; B. recording said address code words in the sectors during the formatting of the disk; C. reading said address code word from the sector rotating under the head; D. encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. comparing said sector address code word read from a disk sector with said specified address code word by adding them using modulo 2 addition; and F. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, identifying the sector as the correct sector; or (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 52
Independent Claim 33 words
An apparatus for locating data sectors on a magnetic disk during sector seeking operations comprising: A. means for encoding the addresses of the sectors to produce address code words, said encoding means including:
Claim 53
Independent Claim 33 words
An apparatus for locating data sectors on a magnetic disk during sector seeking operations comprising: A. means for encoding the addresses of the sectors to produce address code words, said encoding means including:
Claim 54
Dependent Claim 326 words
means for separating the sector address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. means for using a distance D linear code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addressed differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; 5. means for encoding aid n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits; B. means for recording said address code words in the sectors during the formatting of the disk; C. means for reading said address code word from the sector rotating under the head; D. means for encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. means for comparing said sector address code word read from a disk sector with said specified address code word by adding them using modulo 2 addition; and F. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, means for identifying the sector as the correct sector; and (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.
Claim 55
Dependent Claim 326 words
means for separating the sector address containing n bits into two segments, a segment containing k lower order bits and a segment containing n-k higher order bits; 2. means for using a distance D linear code over Galois Field GF(2) to encode said k-bit segment into an n-bit code word containing n-k redundancy symbols and the k address bits such that any two encoded addressed differ by at least D-1/2 bits; 3. means for representing said n-k redundancy symbol segment in Gray code; 4. means for adding said Gray coded segment to the n-k higher order bits of said n-bit code word to produce an n-bit address code word; 5. means for encoding aid n-bit address code word using a distance E linear (p,n) code over Galois Field GF(2) to produce p-n redundancy symbols and appending said redundancy symbols to said n-bit address code word to form a p-bit address code word such that the p-bit address code word differs from any other p-bit address codeword by at least E-1/2 bits; B. means for recording said address code words in the sectors during the formatting of the disk; C. means for reading said address code word from the sector rotating under the head; D. means for encoding the specified address of the sector to be located in the same manner of step A to produce a specified address code word; E. means for comparing said sector address code word read from a disk sector with said specified address code word by adding them using modulo 2 addition; and F. (1) if the comparison results in a number of bits which differ between said address code word and said specified address code word that is less than a predetermined number, means for identifying the sector as the correct sector; and (2) if the comparison results in a number of bits which differ that is greater than said predetermined number, not identifying the sector as the correct sector.

References Cited (Backward Citations)

US4507693A Cited
US4630140A Cited
US4697212A Cited
US4564945A Cited
US4622602A Cited
JPS6218681A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-08-13 1994-02-12 1994-08-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-08-13 1998-02-12 1998-08-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-08-13 2002-02-12 2002-08-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag