USRE34003E - Method and apparatus for encoding and mapping magnetic disk sector addresses - Google Patents

Method and apparatus for encoding and mapping magnetic disk sector addresses Download PDF

Info

Publication number
USRE34003E
USRE34003E US07/592,908 US59290890A USRE34003E US RE34003 E USRE34003 E US RE34003E US 59290890 A US59290890 A US 59290890A US RE34003 E USRE34003 E US RE34003E
Authority
US
United States
Prior art keywords
code word
sector
address code
address
bit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US07/592,908
Inventor
Lih-Jyh Weng
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Maxtor Corp
Original Assignee
Digital Equipment Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US07/176,093 external-priority patent/US4949200A/en
Application filed by Digital Equipment Corp filed Critical Digital Equipment Corp
Priority to US07/592,908 priority Critical patent/USRE34003E/en
Application granted granted Critical
Publication of USRE34003E publication Critical patent/USRE34003E/en
Assigned to QUANTUM CORPORATION reassignment QUANTUM CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: DIGITAL EQUIPMENT CORPORATION
Assigned to CANADIAN IMPERIAL BANK OF COMMERCE, AS ADMINISTRATIVE AGENT reassignment CANADIAN IMPERIAL BANK OF COMMERCE, AS ADMINISTRATIVE AGENT SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: QUANTUM CORPORATION
Assigned to CANADIAN IMPERIAL BANK, AS ADMINISTRATIVE AGENT reassignment CANADIAN IMPERIAL BANK, AS ADMINISTRATIVE AGENT RELEASE Assignors: QUANTUM CORPORATION
Assigned to MAXTOR CORPORATION reassignment MAXTOR CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: QUANTUM CORPORATION
Anticipated expiration legal-status Critical
Assigned to JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT AND FIRST PRIORITY REPRESENTATIVE, WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATERAL AGENT AND SECOND PRIORITY REPRESENTATIVE reassignment JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT AND FIRST PRIORITY REPRESENTATIVE SECURITY AGREEMENT Assignors: MAXTOR CORPORATION, SEAGATE TECHNOLOGY INTERNATIONAL, SEAGATE TECHNOLOGY LLC
Assigned to MAXTOR CORPORATION, SEAGATE TECHNOLOGY INTERNATIONAL, SEAGATE TECHNOLOGY HDD HOLDINGS, SEAGATE TECHNOLOGY LLC reassignment MAXTOR CORPORATION RELEASE Assignors: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Assigned to SEAGATE TECHNOLOGY INTERNATIONAL, EVAULT INC. (F/K/A I365 INC.), SEAGATE TECHNOLOGY US HOLDINGS, INC., SEAGATE TECHNOLOGY LLC reassignment SEAGATE TECHNOLOGY INTERNATIONAL TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS Assignors: WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATERAL AGENT AND SECOND PRIORITY REPRESENTATIVE
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/12—Formatting, e.g. arrangement of data block or words on the record carriers
    • G11B20/1217—Formatting, e.g. arrangement of data block or words on the record carriers on discs
    • G11B20/1252—Formatting, e.g. arrangement of data block or words on the record carriers on discs for discontinuous data, e.g. digital information signals, computer programme data
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
    • G11B20/1833—Error detection or correction; Testing, e.g. of drop-outs by adding special lists or symbols to the coded information
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
    • G11B27/10—Indexing; Addressing; Timing or synchronising; Measuring tape travel
    • G11B27/19—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier
    • G11B27/28—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording
    • G11B27/30—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording on the same track as the main recording
    • G11B27/3027—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording on the same track as the main recording used signal is digitally coded
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B2220/00—Record carriers by type
    • G11B2220/20—Disc-shaped record carriers
    • G11B2220/25—Disc-shaped record carriers characterised in that the disc is based on a specific recording technology
    • G11B2220/2508—Magnetic discs

Definitions

  • This invention relates to computer systems in general and more particularly to methods for locating stored data on a magnetic disk.
  • Computer systems often use peripheral storage devices, such as rotating magnetic disks, to store data.
  • the data is stored on the disks in circuit tracks.
  • Each track is divided into a number of sectors usually consisting of a fixed number of bytes, that is, eight-bit symbols.
  • Each sector in turn, consists of two sections, a header section and a data section.
  • the sector is uniquely identified by address symbols which are recorded in the header section of the sector when the disk is formatted.
  • a disk drive has one or more read/write heads which must be positioned over sectors to perform storage or retrieval ("write” or “read”) operations in those sectors.
  • Each read/write head is associated with one surface, or a portion of the surface, of a disk.
  • the radial positioning of the heads is typically controlled by a single head positioner.
  • the head positioner moves the heads radially to (approximately) position the appropriate head over the track containing the identified sector.
  • Disk rotation then moves the successive sectors in the selected track under the head.
  • the selected head must read each sector address as it moves by and determine whether or not the sector is the correct sector. This determination must be made by the time the end of the address portion of the sector has reached the read/write head. That is, if the drive is to perform a read or write operation in a sector, it must be ready to do so when the data portion of the sector, which closely follows the address portion, rotates under the head.
  • the drive In order to determine if a sector is the correct sector, the drive reads the sector address from the disk and then compares it with the specified address of the sector in which data is to be read or written. If the addresses match, the data will be read from or written to the sector.
  • the sector may be mistakenly identified as another sector.
  • the address may, for example, be identified as sector 101 because of the errors, and the read or write operation that is to occur at sector 101 will be performed in the wrong sector.
  • the sector addresses In order to avoid misinterpreting the address of a sector, the sector addresses must be written on the disk in such a way that even with a number of errors in a retrieved address, that is, the address as it is read from the disk, the sector will be correctly identified.
  • the address is recorded several times, in succession.
  • the specified sector address is compared with each copy of the address stored in the sector, and if some minimum number of retrieved addresses match the specified address the sector is determined to be the correct sector. Thus, if one of the copies of the address contains an error, the sector will still be identifiable.
  • ECC error correction code
  • the retrieved address is compared symbol by symbol with the desired address, after that address has been encoded. If the retrieved address matches the encoded address, or differs by less than some number of symbols, the sector is identified as the correct sector.
  • the present invention is directed to an improvement over the foregoing system in which encoded addresses are provided with greater address protection against error than is otherwise achieved with the same number of redundancy (ECC) symbols.
  • ECC redundancy
  • an n-bit sector address is encoded using an error correction code such that the address is recorded without adding extra bits, that is, an n-bit encoded address is recorded.
  • an n-bit encoded address can be correctly identified in spite of some specified number of errors, depending on the distance structure of the error correction code, without increasing the number of bits in the address.
  • the invention leaves more disk space available for recording data than the encoding system discussed above, which records the address plus some number of multi-bit redundancy symbols.
  • the invention which is an improvement over the previously discussed encoding system, takes advantage of the fact that the approximate position of the read/write heads relative to the disk surfaces is typically known, to within a relatively small number of contiguous tracks.
  • the contiguous tracks, and the sectors within the tracks, constitute a "logical neighborhood".
  • a header address contains high order bits identifying the logical neighborhood of a sector. Thus two locations with addresses having the same higher order bits are logically close, i.e. within the same neighborhood.
  • the lower order address bits identify the location of the desired sector within the appropriate neighborhood. It is the lower order address bits which must be ascertained during read and write operations.
  • the invention encodes the n-bit address such that addresses which are in a neighborhood, that is, addresses which are mathematically or numericaly close, are mapped to
  • ECC is a distance D code.
  • the ECC used depends on the selected distance D and the selected size of the neighborhood. Encoded addresses which are not in the same neighborhood may differ in fewer than D-1 bits.
  • each original n-bit sector address is separated into two segments.
  • One segment is a "k"-bit neighborhood address segment containing the k lower order, that is, least significant, address bits. These bits identify the location of the selected sector within a neighborhood.
  • the second segment is an "n-k” bit higher order address segment containing the most significant sector address bits. These bits identify 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.
  • ECC redundancy
  • 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, that is, exclusive OR'd, to the n-k redundancy (ECC) bits of the preliminary code word, thus retaining the n-bit length of the address code word.
  • ECC redundancy
  • 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, as discussed in reference to the previous encoding scheme, 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.
  • the encoded n-bit addresses are further encoded into p-bit addresses.
  • the p-bit addresses contain the n address bits plus p-n redundancy bits.
  • the p-n redundancy bits protect the sector addresses against errors, regardless of the neighborhoods in which the sectors are situated. Encoding the previously encoded n-bit addresses using a (p,n) distance "E" linear code ensures that all the sector addresses will be at least a distance E apart and all addresses within a logical neighborhood will be at least a distance D-1 apart, where D-1>E.
  • FIG. 1 is a functional block diagram constructed in accordance with the invention.
  • an n-bit sector address identifying one of 2 n sectors, is separated into two segments.
  • the first is a k-bit neighborhood address segment containing the k lower order bits, that is, the bits identifying the location of the sector within the appropriate cylinder and/or track.
  • the second segment is an (n-k)-bit address segment containing the higher order bits, that is, the bits identifying the cylinder and/or track containing the sector [Step 10].
  • the k-bit neighborhood address segment is encoded into an n-bit preliminary code word, C i , using an (n,k) linear systematic code with a distance D [Step 12].
  • the preliminary code word C i thus contains n-k redundancy bits as the higher order bits and the k neighborhood address bits as the lower order bits.
  • the particular (n,k) linear code used to encode the k-bit segment depends on the distance D selected and also on the selected size of a neighborhood.
  • a neighborhood consists of a group of sectors where the absolute difference of two sector addresses is less than 2 k . If the location of the read/write head is known to within a 2 k sector accuracy, a particular sector can be correctly identified, even if it contains up to (D-2)/2 errors. Thus the size of the neighborhood is selected based on the known accuracy of the head positioner.
  • the n-k higher order bits are encoded into an (n-k)-bit segment which is the original (n-k)-bit segment represented in Gray code [Step 14].
  • the encoding is performed by: (i) shifting the (n-k)-bit segment one bit to the right, that is, dropping the least significant bit; (ii) appending a ZERO-bit as the most significant bit to form an (n-k)-bit segment, A; and (iii) exclusive OR'ing the original (n-k)-bit segment to the segment A to form the Gray coded segment.
  • the segment A is then added to the original (n-k)-bit address segment to form the Gray coded segment:
  • Gray coding ensures that any two addresses which differ numerically by a value of one will differ in only one bit.
  • the selected size of a neighborhood ensures that the higher order segments of any two sector addresses in a neighborhood will differ by at most a value of one.
  • any two Gray coded segments associated with sectors within a neighborhood are either identical or, because of the Gray coding, differ in at most one bit.
  • the Gray coded segment is exclusive OR'd to the n-k high order bits of the preliminary code word C i to form an address code word, C R [Step 15]. This changes the distance between any two neighborhood code words by at most one bit, that is, to a minimum distance of D-1, because of the distance structure of the Gray code. If the (n-k)-bit address segments were not Gray coded before adding them to the preliminary code words C i , the distance structure of the encoded addresses would change significantly due to the multi-bit differences between the numerically close segments.
  • the address code word, C R is then recorded as the sector address [Step 16].
  • C i and the Gray coded segment are added to produce the address code word, C R , which is recorded as the sector address:
  • the desired sector can be correctly identified even if it contains (D-2)/2 errors. This distance feature is achieved without adding additional bits to the n-bit sector address.
  • the address is encoded in the manner set forth above, and the encoded address is compared, that is, to the addresses read from the disk. If there are less than (D-2)/2 differences between the two addresses, the sector is the correct sector.
  • Encoded sector addresses C R can be translated into the original n-bit address by inverse mapping.
  • First the k least significant bits of C R which are the same as the k least significant bits of the original address, are encoded using the same (n,k) linear distance D code to form the corresponding preliminary code word C i .
  • Next the preliminary code word C i is added to the code word C R to obtain an n-bit word which has k all-ZERO least significant bits and n-k Gray coded bits.
  • w n-k is calculated by: (i) using the most significant bit w 1 , as the most significant bit, a 1 , of the original address; (ii) adding a 1 to w 2 , the next most significant bit, to calculate the next address bit, a 2 ; and (iii) repeating steps (i)-(ii) for each of the n-k bits.
  • Inverse mapping which takes a relatively long time, is done only during "start-up" procedure to determine the position of the read/write head. It cannot be performed in the short time it takes for a sector address to rotate under the head during read or write operations.
  • a second embodiment of the invention further encodes the n-bit code word C R into a "p"-bit code word, C P , containing n information bits and p-n redundancy bits, using an (n,p) distance E linear code.
  • the p-bit code word C P is then recorded as the sector address.
  • each sector address regardless of the neighborhood, is at least a distance of E from any other address.
  • each address is at least a distance D-1 from any other neighborhood address.
  • greater distance or error protection, (D-1)>E is achieved than is otherwise achieved using the same number of redundancy bits.
  • the inverse mapping of the p-bit address C P into the original n-bit address is the same as the inverse mapping scheme discussed above, except that the p-bit code word C P is first decoded using conventional means to recover the n-bit code word C R .
  • Sector addresses consisting of n multi-bit symbols can be similarly encoded over GF(2 m ) using the (n,k) and (p,n) codes.
  • the Gray code encoding is performed in the binary field GF(2), however, the distance structure of the Gray code is retained in GF(2 m ), that is, encoded adjacent high order (n-k) symbol address segments will differ by at most one symbol.
  • Each of the address encoding schemes discussed above offer error protection to an n-symbol sector address using a minimum number of error protection symbols. Thus more disk storage space is left free for data storage. This is particularly important as the density of data recording is repeatedly increased to allow more data to be recorded on a given size disk.

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.

Description

FIELD OF INVENTION
This invention relates to computer systems in general and more particularly to methods for locating stored data on a magnetic disk.
DESCRIPTION OF THE PRIOR ART
Computer systems often use peripheral storage devices, such as rotating magnetic disks, to store data. The data is stored on the disks in circuit tracks. Each track is divided into a number of sectors usually consisting of a fixed number of bytes, that is, eight-bit symbols. Each sector, in turn, consists of two sections, a header section and a data section. The sector is uniquely identified by address symbols which are recorded in the header section of the sector when the disk is formatted.
A disk drive has one or more read/write heads which must be positioned over sectors to perform storage or retrieval ("write" or "read") operations in those sectors. Each read/write head is associated with one surface, or a portion of the surface, of a disk. The radial positioning of the heads is typically controlled by a single head positioner. Thus when a read or write operation is to be performed in a particular sector, the head positioner moves the heads radially to (approximately) position the appropriate head over the track containing the identified sector. Disk rotation then moves the successive sectors in the selected track under the head.
The selected head must read each sector address as it moves by and determine whether or not the sector is the correct sector. This determination must be made by the time the end of the address portion of the sector has reached the read/write head. That is, if the drive is to perform a read or write operation in a sector, it must be ready to do so when the data portion of the sector, which closely follows the address portion, rotates under the head.
In order to determine if a sector is the correct sector, the drive reads the sector address from the disk and then compares it with the specified address of the sector in which data is to be read or written. If the addresses match, the data will be read from or written to the sector.
If an address as read from a sector contains any errors, the sector may be mistakenly identified as another sector. Thus when the head is actually located over sector 100, the address may, for example, be identified as sector 101 because of the errors, and the read or write operation that is to occur at sector 101 will be performed in the wrong sector. In order to avoid misinterpreting the address of a sector, the sector addresses must be written on the disk in such a way that even with a number of errors in a retrieved address, that is, the address as it is read from the disk, the sector will be correctly identified.
In a prior method for coping with errors in a sector address, the address is recorded several times, in succession. The specified sector address is compared with each copy of the address stored in the sector, and if some minimum number of retrieved addresses match the specified address the sector is determined to be the correct sector. Thus, if one of the copies of the address contains an error, the sector will still be identifiable.
This arrangement is feasible only if the system error rate is fairly low. Otherwise, an unduly large number of copies of the address will be required in each sector to provide, with a reasonable degree of certainty, some minimum number of error-free copies.
One way to eliminate the recording of multiple copies of the address is to encode the sector address using an error correction code (ECC) as set forth in co-pending application Ser. No. 07/070,689 to co-inventors Lih-Jyh Weng and Bernardo Rub entitled "Method and Apparatus for Encoding Magnetic Disk Sector Addresses." The encoded address, which contains t multi-bit address symbols plus a number of redundancy (ECC) symbols, is recorded in the address portion of the sector header. The storage space required for the sector address is thus reduced from that required for multiple copies of the t-symbol address, and a sector address can be correctly identified even though it contains some number of errors, depending on the structure of the particular error correction code.
Specifically, to determine if the sector rotating under the head is the desired sector the retrieved address is compared symbol by symbol with the desired address, after that address has been encoded. If the retrieved address matches the encoded address, or differs by less than some number of symbols, the sector is identified as the correct sector. The advantage of this system over typical error correction encoding systems is that it is not necessary to correct the errors to identify the sector as the correct sector.
The present invention is directed to an improvement over the foregoing system in which encoded addresses are provided with greater address protection against error than is otherwise achieved with the same number of redundancy (ECC) symbols.
SUMMARY
In accordance with the a first embodiment of the present invention an n-bit sector address is encoded using an error correction code such that the address is recorded without adding extra bits, that is, an n-bit encoded address is recorded. Thus the n-bit encoded address can be correctly identified in spite of some specified number of errors, depending on the distance structure of the error correction code, without increasing the number of bits in the address. The invention leaves more disk space available for recording data than the encoding system discussed above, which records the address plus some number of multi-bit redundancy symbols.
The invention, which is an improvement over the previously discussed encoding system, takes advantage of the fact that the approximate position of the read/write heads relative to the disk surfaces is typically known, to within a relatively small number of contiguous tracks. The contiguous tracks, and the sectors within the tracks, constitute a "logical neighborhood".
A header address contains high order bits identifying the logical neighborhood of a sector. Thus two locations with addresses having the same higher order bits are logically close, i.e. within the same neighborhood. The lower order address bits identify the location of the desired sector within the appropriate neighborhood. It is the lower order address bits which must be ascertained during read and write operations.
The invention encodes the n-bit address such that addresses which are in a neighborhood, that is, addresses which are mathematically or numericaly close, are mapped to
addresses while differ in at least D-1 bits where the ECC is a distance D code. The ECC used depends on the selected distance D and the selected size of the neighborhood. Encoded addresses which are not in the same neighborhood may differ in fewer than D-1 bits.
In brief summary, each original n-bit sector address is separated into two segments. One segment is a "k"-bit neighborhood address segment containing the k lower order, that is, least significant, address bits. These bits identify the location of the selected sector within a neighborhood. The second segment is an "n-k" bit higher order address segment containing the most significant sector address bits. These bits identify 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, that is, exclusive OR'd, to the n-k redundancy (ECC) bits of the preliminary code word, thus retaining the n-bit length of the address code word. The resulting address code word is then 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, as discussed in reference to the previous encoding scheme, 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.
In another embodiment the encoded n-bit addresses are further encoded into p-bit addresses. The p-bit addresses contain the n address bits plus p-n redundancy bits. The p-n redundancy bits protect the sector addresses against errors, regardless of the neighborhoods in which the sectors are situated. Encoding the previously encoded n-bit addresses using a (p,n) distance "E" linear code ensures that all the sector addresses will be at least a distance E apart and all addresses within a logical neighborhood will be at least a distance D-1 apart, where D-1>E. Any sector address with fewer than (E-1)/2 errors, regardless of what neighborhood the sector is in, can be correctly identified, and addresses can be correctly identified within a known neighborhood even if they contain up to (D-2)/2 errors, i.e. D>E. Thus the invention provides greater address protection against errors than is otherwise achieved with the same number of redundancy bits.
DESCRIPTION OF THE DRAWINGS
This invention is pointed out with particularity in the appended claims. The above and further advantages of this invention may be better understood by referring to the following description taken in conjunction with the accompanying in which:
FIG. 1 is a functional block diagram constructed in accordance with the invention.
DETAILED DESCRIPTION
It should be understood that all addition, subtraction and multiplication operations performed during the encoding and comparison processes are Galois Field operations and the Galois Fields are of the form GF(2m).
With reference to FIG. 1, an n-bit sector address, identifying one of 2n sectors, is separated into two segments. The first is a k-bit neighborhood address segment containing the k lower order bits, that is, the bits identifying the location of the sector within the appropriate cylinder and/or track. The second segment is an (n-k)-bit address segment containing the higher order bits, that is, the bits identifying the cylinder and/or track containing the sector [Step 10]. The k-bit neighborhood address segment is encoded into an n-bit preliminary code word, Ci, using an (n,k) linear systematic code with a distance D [Step 12]. The preliminary code word Ci thus contains n-k redundancy bits as the higher order bits and the k neighborhood address bits as the lower order bits.
The particular (n,k) linear code used to encode the k-bit segment depends on the distance D selected and also on the selected size of a neighborhood. A neighborhood consists of a group of sectors where the absolute difference of two sector addresses is less than 2k. If the location of the read/write head is known to within a 2k sector accuracy, a particular sector can be correctly identified, even if it contains up to (D-2)/2 errors. Thus the size of the neighborhood is selected based on the known accuracy of the head positioner.
As an example of the encoding scheme, a seven-bit (n=7) sector address S, S=0101011, is separated into a three bit (k=3) neighborhood address segment 011 and a four bit higher order address segment 0101. The three-bit segment 011 is then encoded by conventional means, using a linear (7,3) code with a selected minimum distance of four (D=4), into a seven-bit preliminary code word, Ci =1001011.
The n-k higher order bits are encoded into an (n-k)-bit segment which is the original (n-k)-bit segment represented in Gray code [Step 14]. The encoding is performed by: (i) shifting the (n-k)-bit segment one bit to the right, that is, dropping the least significant bit; (ii) appending a ZERO-bit as the most significant bit to form an (n-k)-bit segment, A; and (iii) exclusive OR'ing the original (n-k)-bit segment to the segment A to form the Gray coded segment. In the example, the four-bit sequence 0101 is shifted one bit to the right and a ZERO bit is appended to form the segment A=0010. The segment A is then added to the original (n-k)-bit address segment to form the Gray coded segment:
0101+0010=0111
Gray coding ensures that any two addresses which differ numerically by a value of one will differ in only one bit. The selected size of a neighborhood ensures that the higher order segments of any two sector addresses in a neighborhood will differ by at most a value of one. Thus any two Gray coded segments associated with sectors within a neighborhood are either identical or, because of the Gray coding, differ in at most one bit.
The Gray coded segment is exclusive OR'd to the n-k high order bits of the preliminary code word Ci to form an address code word, CR [Step 15]. This changes the distance between any two neighborhood code words by at most one bit, that is, to a minimum distance of D-1, because of the distance structure of the Gray code. If the (n-k)-bit address segments were not Gray coded before adding them to the preliminary code words Ci, the distance structure of the encoded addresses would change significantly due to the multi-bit differences between the numerically close segments.
The address code word, CR, is then recorded as the sector address [Step 16]. Thus in the example preliminary code word Ci and the Gray coded segment are added to produce the address code word, CR, which is recorded as the sector address:
1001011+0111000=1110011=C.sub.R
If the position of the read/write head is known to be within 2k sectors of the desired sector, eight sectors in this example, the desired sector can be correctly identified even if it contains (D-2)/2 errors. This distance feature is achieved without adding additional bits to the n-bit sector address.
In order to access an identified sector, the address is encoded in the manner set forth above, and the encoded address is compared, that is, to the addresses read from the disk. If there are less than (D-2)/2 differences between the two addresses, the sector is the correct sector.
Encoded sector addresses CR can be translated into the original n-bit address by inverse mapping. First the k least significant bits of CR, which are the same as the k least significant bits of the original address, are encoded using the same (n,k) linear distance D code to form the corresponding preliminary code word Ci. Next the preliminary code word Ci is added to the code word CR to obtain an n-bit word which has k all-ZERO least significant bits and n-k Gray coded bits. Then the inverse Gray code for the n-k most significant bits w1, w2, w3 . . . wn-k is calculated by: (i) using the most significant bit w1, as the most significant bit, a1, of the original address; (ii) adding a1 to w2, the next most significant bit, to calculate the next address bit, a2 ; and (iii) repeating steps (i)-(ii) for each of the n-k bits.
Thus code word CR =1110011 is inversely mapped by encoding the three least significant bits 011 using the (7,3) distance four code into preliminary code word C1 =1001011. Next CR is added to Ci 
1110011+1001011=0111000
resulting in the Gray coded word. Then the inverse Gray code of the four most significant bits is calculated:
w.sub.1 =0
w.sub.2 =0+1=1
w.sub.3 +1+1=0
w.sub.4 =0+1=1
and the result is appended, as the n-k most significant bits, to the k least significant bits of CR to obtain the original address 0101011. Inverse mapping, which takes a relatively long time, is done only during "start-up" procedure to determine the position of the read/write head. It cannot be performed in the short time it takes for a sector address to rotate under the head during read or write operations.
A second embodiment of the invention further encodes the n-bit code word CR into a "p"-bit code word, CP, containing n information bits and p-n redundancy bits, using an (n,p) distance E linear code. The p-bit code word CP is then recorded as the sector address. Thus each sector address, regardless of the neighborhood, is at least a distance of E from any other address. In addition, for sectors within a 2k neighborhood, each address is at least a distance D-1 from any other neighborhood address. Thus greater distance or error protection, (D-1)>E, is achieved than is otherwise achieved using the same number of redundancy bits.
The inverse mapping of the p-bit address CP into the original n-bit address is the same as the inverse mapping scheme discussed above, except that the p-bit code word CP is first decoded using conventional means to recover the n-bit code word CR.
Sector addresses consisting of n multi-bit symbols can be similarly encoded over GF(2m) using the (n,k) and (p,n) codes. The Gray code encoding is performed in the binary field GF(2), however, the distance structure of the Gray code is retained in GF(2m), that is, encoded adjacent high order (n-k) symbol address segments will differ by at most one symbol.
Each of the address encoding schemes discussed above offer error protection to an n-symbol sector address using a minimum number of error protection symbols. Thus more disk storage space is left free for data storage. This is particularly important as the density of data recording is repeatedly increased to allow more data to be recorded on a given size disk.
The foregoing description has been limited to two specific embodiments of this invention. It will be apparent, however, that variations and modifications may be made to the invention, with the attainment of some or all of the advantages of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.

Claims (42)

What is claimed as new and desired to be secured by Letters Patent of the United States is:
1. 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.]. .Iadd.such that any two n-bit code words corresponding to sectors within a 2k neighborhood differ in at least D bits.Iaddend.;
3. representing said n-k .[.redundancy symbol.]. .Iadd.higher order bit .Iaddend.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.Iadd., said n-bit address code word differing from any n-bit address code word corresponding to a sector which is within a 2k neighborhood of said sector in at least D-1 bits.Iaddend.;
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.Iadd., said sector being within a 2k neighborhood of the sector to be located.Iaddend.;
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.
2. 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 .Iadd.and differs from any other p-bit address code word in a 2k neighborhood of said sector in at least D-1 bits, where D-1.E. .Iaddend. .[.
3. 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(2m) 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..].
4. The method of claim 1 wherein said comparison step further includes adding modulo 2 said address code words and said specified address code words.
5. 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(2m) 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.Iadd., said sector being within a 2mk neighborhood of the sector to be located.Iaddend.;
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.
6. 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; .].
.Iadd.such that any two n-bit code words corresponding to sectors within a 2k neighborhood differ in at least D bits.Iaddend. bits,
3. means for representing said n-k .[.redundancy symbol.]. .Iadd.higher order bit .Iaddend.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 .Iadd.which is within a 2k neighborhood of the sector to be located .Iaddend.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.
7. 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.]. .Iadd.in .Iaddend.at least E .[.-1/2.]. bits .Iadd.and differs from any other p-bit address code word in a 2k neighborhood of said sector by at least D-1 bits, where D-1.E. .Iaddend.
8. 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.
9. 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(2m) 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.]. .Iadd.higher order .Iaddend.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.Iadd., said sector being within a 2mk neighborhood of the sector to be located.Iaddend.;
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.
10. 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(2m) 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 symbols .Iadd.and differs from any other p-symbol address code word in a 2mk neighborhood of said sector by at least D-1 symbols, where D-1>E. .Iaddend.
11. 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.
12. 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.]. .Iadd.such that any two n-bit code words corresponding to sectors within a 2k neighborhood differ in at least D bits; .Iaddend.
3. representing said n-k .[.redundancy symbol.]. .Iadd.higher order bit .Iaddend.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.
13. 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. .[.14. The method of claim 12 wherein said encoding step further includes encoding said n-symbol address codes 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 such that the p-symbol address code word differs from any other p-symbol address
codeword by at least E-1/2 symbols..]. 15. 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.]. .Iadd.such that any two n-bit code words corresponding to sectors within a 2k neighborhood differ in at least D bits; .Iaddend.
3. means for representing said n-k .[.redundancy symbol.]. .Iadd.higher order bit .Iaddend.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; and
B. means for recording said address code words in the sectors during the
formatting of the disk. 16. 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(s) 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. 17. 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.]. .Iadd.such that any two n-bit code words corresponding to sectors within a 2k neighborhood differ in at least D bits; .Iaddend.
3. means for representing said n-k .[.redundancy symbol.]. .Iadd.higher order bit .Iaddend.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;
C. means for comparing said specified address code word with the sector address code word read from a disk sector, .Iadd.said disk sector being within a 2k neighborhood of the sector be to located; .Iaddend.
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. 18. 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. 19. 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 bits .Iadd.and differs from any other p-bit address code word in a 2k neighborhood of said sector by at
least D-1 bits, where D-1>E. .Iaddend. 20. 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.]. .Iadd.higher order bit .Iaddend.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.Iadd., said sector being within a 2k neighborhood of the sector to be located; .Iaddend.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. 21. The method of claim 20 wherein said encoding step further comprises 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 bits .Iadd.and differs from any other p-bit address code word in a 2k neighborhood of said sector by at least D-1 bits, where D-1>E. .Iaddend. .[.22. 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(2m) 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..]. 23. 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. .[.24. 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..]. 25. 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. 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(2m) to encode said k-.[.bit.]. .Iadd.symbol .Iaddend.segment into an n-.[.bit.]. .Iadd.symbol .Iaddend.code word containing n-k redundancy symbols and the k address .[.bits.]. .Iadd.symbols.Iaddend.;
3. means for representing said n-k higher order .[.bit.]. .Iadd.symbol .Iaddend.segment in Gray code;
4. means for adding said Gray coded segment to the n-k higher order .[.bits.]. .Iadd.symbols .Iaddend.of said n-.[.bit.]. .Iadd.symbol .Iaddend.code word to produce an n-.[.bit.]. .Iadd.symbol .Iaddend.address code word; and
B. means for recording said address code words in the sectors during the
formatting of the disk. 26. The apparatus of claim 25 wherein said encoding means further comprises means for encoding said n-.[.bit.]. .Iadd.symbol .Iaddend.address code word using a distance E linear (p,n) code over Galois Field GF(.Iadd.2.Iaddend.m) to produce p-n redundancy symbols and appending said redundancy symbols to said .[.n-bit.]. .Iadd.n-symbols .Iaddend.address code word to form a p-.[.bit.]. .Iadd.symbol .Iaddend.address code word such that the p-.[.bit.]. .Iadd.symbol .Iaddend.address code word differs from any other p-bit address codeword in at least E .[.bits.]. .Iadd.symbols and differs from any other p-symbol address code word in a 2mk neighborhood of
said sector by at least D-1 symbols, where D-1>E. .Iaddend. 27. 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.]. .Iadd.m-bit .Iaddend.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(2m) 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.]. .Iadd.such that any two n-symbol code words corresponding to sectors within a 2mk neighborhood differ in at least D symbols; .Iaddend.
3. means for representing said n-k .[.redundancy.]. .Iadd.higher order .Iaddend.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 .Iadd.which is within a 2mk neighborhood of said sector to be located .Iaddend.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. 28. 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. 29. The apparatus of claim 27 wherein said encoding .[.means.]. .Iadd.step .Iaddend.further comprises means for encoding said .[.n-symbols.]. .Iadd.n-symbol .Iaddend.address code word using a distance E linear (p,n) code over Galois Field GF(2m) to produce p-n redundancy symbols and appending said redundancy symbols to said .[.n-symbols.]. .Iadd.n-symbol .Iaddend.address code word to form a .[.p-symbols.]. .Iadd.p-symbol .Iaddend.address code word such that the .[.p-symbols.]. symbols .Iadd.p-symbol .Iaddend.address code word differs from any other .[.p-symbols.]. .Iadd.p-symbol .Iaddend.address codeword by at least E.[.-1/2.]. symbols .Iadd.and differs from any other p-symbol address code word in a 2mk neighborhood of said sector by at least D-1 symbols, where D-1 E.
.Iaddend. 30. 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(2m) 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.]. .Iadd.such that any two n-symbol code words corresponding to sectors within a 2mk neighborhood differ in at least D symbols.Iaddend.,
3. representing said n-k .[.redundancy.]. .Iadd.higher order .Iaddend.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.]. .Iadd.n-symbol .Iaddend.address code word using a distance E linear (p,n) code over Galois Field GF(2m) 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.]. .Iadd.symbols and differs from any other p-symbol address code word in a 2mk neighborhood of said sector by at least D-1 symbols, D-1 .E.Iaddend.; 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.Iadd., said sector being within a 2mk neighborhood of the sector to be located; .Iaddend.
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. 31. 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(2m) 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.]. .Iadd.such that any two n-symbol code words corresponding to sectors within a 2mk neighborhood differ in at least D symbols.Iaddend.;
3. representing said n-k .[.redundancy.]..Iadd.higher order .Iaddend.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. 32. 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.Iadd., said sector being within a 2mk neighborhood of the sector to be located; .Iaddend.
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;
2. using a distance D linear (n,k) code over Galois Field GF(2m) 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.]. .Iadd.higher order .Iaddend.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. 33. 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.]. .Iadd.such that any two n-bit code words corresponding to sectors within a 2k neighborhood differ in at least D bits; .Iaddend.
3. representing said n-k .[.redundancy symbol.]. .Iadd.higher order bit .Iaddend.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 .Iadd.and differs from any other p-bit address code word in a 2k neighborhood of said sector by at least D-1 bits, where D-1.E..Iaddend.;
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.Iadd., said sector being within a 2k neighborhood of the sector to be located.Iaddend.;
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. 34. 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:
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 addressed differ by at least D-1/2 bits.]. .Iadd.such that any two n-bit code words corresponding to sectors within a 2k neighborhood differ in at least D bits.Iaddend.;
3. means for representing said n-k .[.redundancy symbol.]. .Iadd.higher order bit .Iaddend.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.]. .Iadd.said .Iaddend.n-bit address code word using a distance E linear (p,n) code over Galois Field GF(3) 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.Iadd., said sector being within a 2k neighborhood of the sector to be located; .Iaddend.
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. .Iadd.35. 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;
3. representing said n-k higher order bit 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, said sector being within a 2k neighborhood of the sector to be located;
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 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..Iaddend. .Iadd.36. The method of claim 35 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..Iaddend. .Iadd.37. 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 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(2m) 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 higher order 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;
5. encoding said n-symbol address code word using a (p,n) distance E linear code over Galois Field GF(2m) 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;
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, said sector being within a 2mk neighborhood of the sector to be located;
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..Iaddend. .Iadd.38. 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;
3. means for representing said n-k higher order bit 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 which is within a 2k neighborhood of the sector to be located 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..Iaddend. .Iadd.39. The apparatus of claim 38 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..Iaddend. .Iadd.40. 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;
3. means for representing said n-k higher order bit 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;
C. means for comparing said specified address code word with the sector address code word read from a disk sector, said disk sector being within a 2k neighborhood of the sector be to located;
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..Iaddend. .Iadd.41. The apparatus of claim 40 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..Iaddend. .Iadd.42. 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(2m) 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 higher order 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..Iaddend. .Iadd.43. 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. 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;
3. means for representing said n-k higher order bit 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; and
B. means for recording said address code words in the sectors during the formatting of the disk..Iaddend. .Iadd.44. The method of claim 5, 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(2m) 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 symbols..Iaddend. .Iadd.45. The method of claim 31 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(2m) 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 symbols..Iaddend.
US07/592,908 1988-03-31 1990-10-04 Method and apparatus for encoding and mapping magnetic disk sector addresses Expired - Lifetime USRE34003E (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US07/592,908 USRE34003E (en) 1988-03-31 1990-10-04 Method and apparatus for encoding and mapping magnetic disk sector addresses

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US07/176,093 US4949200A (en) 1988-03-31 1988-03-31 Method and apparatus for encoding and mapping magnetic disk sector addresses
US07/592,908 USRE34003E (en) 1988-03-31 1990-10-04 Method and apparatus for encoding and mapping magnetic disk sector addresses

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US07/176,093 Reissue US4949200A (en) 1988-03-31 1988-03-31 Method and apparatus for encoding and mapping magnetic disk sector addresses

Publications (1)

Publication Number Publication Date
USRE34003E true USRE34003E (en) 1992-07-21

Family

ID=26871857

Family Applications (1)

Application Number Title Priority Date Filing Date
US07/592,908 Expired - Lifetime USRE34003E (en) 1988-03-31 1990-10-04 Method and apparatus for encoding and mapping magnetic disk sector addresses

Country Status (1)

Country Link
US (1) USRE34003E (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5442638A (en) * 1994-01-10 1995-08-15 International Business Machines Corporation Apparatus and method for recording over defects in storage media
EP0676762A2 (en) * 1994-04-05 1995-10-11 Quantum Corporation Header verification using a multiple sector history
WO1995034859A1 (en) * 1994-06-16 1995-12-21 Quantum Corporation Robust and redundant physical block identification scheme for data storage devices
US5488701A (en) * 1994-11-17 1996-01-30 International Business Machines Corporation In log sparing for log structured arrays
US5629915A (en) * 1994-12-14 1997-05-13 Mori; Ryoichi Digital signal conversion enabling to find unauthorized change of the signal
US5828508A (en) * 1996-10-17 1998-10-27 Maxtor Corporation Technique for reducing overhead in a data storage system
US20030087694A1 (en) * 1999-06-17 2003-05-08 Leonard Storch System for machine reading and processing information from gaming chips
US20050127708A1 (en) * 2002-08-14 2005-06-16 Wolfgang Richter Retracting mechanism for use with both hard and hybrid retractable tops for vehicles

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4151571A (en) * 1976-03-31 1979-04-24 Compagnie Internationale Pour L'informatique Cii-Honeywell Bull (Societe Anonyme) Method of writing addresses on a magnetic recording medium
JPS58177537A (en) * 1982-04-08 1983-10-18 Matsushita Electric Ind Co Ltd Optical disk
EP0109551A2 (en) * 1982-10-21 1984-05-30 The Stypher Corporation Apparatus for decoding video address code signals
JPS59163124A (en) * 1983-03-04 1984-09-14 株式会社　フジパツクシステム Sealing device for cylindrical bag in bagging packer
US4507693A (en) * 1981-04-20 1985-03-26 Hitachi, Ltd. Control apparatus for rotation type storage device
JPS60157770A (en) * 1984-01-27 1985-08-19 Sharp Corp Magnetic recording and reproducing device
EP0164891A1 (en) * 1984-05-16 1985-12-18 Sony Corporation Methods of and apparatus for use in decoding digital data
US4564945A (en) * 1983-06-20 1986-01-14 Reference Technology, Inc. Error-correction code for digital data on video disc
US4622602A (en) * 1984-05-31 1986-11-11 Sony Corporation System for recording and/or reproducing digital data
US4630140A (en) * 1983-04-08 1986-12-16 Matsushita Electric Industrial Co., Ltd. Data recording/reproducing apparatus
JPS6218681A (en) * 1985-07-16 1987-01-27 Sharp Corp Video disc player
US4661956A (en) * 1984-03-02 1987-04-28 Hitachi, Ltd. Method of correcting errors of digital signals in the recording and reproduction of digital signals
US4697212A (en) * 1983-06-18 1987-09-29 Sony Corporation Method and apparatus for recording a digital information signal
EP0248536A2 (en) * 1986-05-31 1987-12-09 Sony Corporation Methods of and apparatus for seeking a target address on a record medium

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4151571A (en) * 1976-03-31 1979-04-24 Compagnie Internationale Pour L'informatique Cii-Honeywell Bull (Societe Anonyme) Method of writing addresses on a magnetic recording medium
US4507693A (en) * 1981-04-20 1985-03-26 Hitachi, Ltd. Control apparatus for rotation type storage device
JPS58177537A (en) * 1982-04-08 1983-10-18 Matsushita Electric Ind Co Ltd Optical disk
EP0109551A2 (en) * 1982-10-21 1984-05-30 The Stypher Corporation Apparatus for decoding video address code signals
JPS59163124A (en) * 1983-03-04 1984-09-14 株式会社　フジパツクシステム Sealing device for cylindrical bag in bagging packer
US4630140A (en) * 1983-04-08 1986-12-16 Matsushita Electric Industrial Co., Ltd. Data recording/reproducing apparatus
US4697212A (en) * 1983-06-18 1987-09-29 Sony Corporation Method and apparatus for recording a digital information signal
US4564945A (en) * 1983-06-20 1986-01-14 Reference Technology, Inc. Error-correction code for digital data on video disc
JPS60157770A (en) * 1984-01-27 1985-08-19 Sharp Corp Magnetic recording and reproducing device
US4661956A (en) * 1984-03-02 1987-04-28 Hitachi, Ltd. Method of correcting errors of digital signals in the recording and reproduction of digital signals
EP0164891A1 (en) * 1984-05-16 1985-12-18 Sony Corporation Methods of and apparatus for use in decoding digital data
US4622602A (en) * 1984-05-31 1986-11-11 Sony Corporation System for recording and/or reproducing digital data
JPS6218681A (en) * 1985-07-16 1987-01-27 Sharp Corp Video disc player
EP0248536A2 (en) * 1986-05-31 1987-12-09 Sony Corporation Methods of and apparatus for seeking a target address on a record medium

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5442638A (en) * 1994-01-10 1995-08-15 International Business Machines Corporation Apparatus and method for recording over defects in storage media
US5568627A (en) * 1994-04-05 1996-10-22 Quantum Corporation Header verification in a disk drive using sector histories for improved format efficiency
EP0676762A2 (en) * 1994-04-05 1995-10-11 Quantum Corporation Header verification using a multiple sector history
EP0676762A3 (en) * 1994-04-05 1996-04-03 Quantum Corp Header verification using a multiple sector history.
WO1995034859A1 (en) * 1994-06-16 1995-12-21 Quantum Corporation Robust and redundant physical block identification scheme for data storage devices
US5521929A (en) * 1994-06-16 1996-05-28 Quantom Corporation Robust and redundant physical block identification scheme for data storage devices
US5488701A (en) * 1994-11-17 1996-01-30 International Business Machines Corporation In log sparing for log structured arrays
US5629915A (en) * 1994-12-14 1997-05-13 Mori; Ryoichi Digital signal conversion enabling to find unauthorized change of the signal
US5828508A (en) * 1996-10-17 1998-10-27 Maxtor Corporation Technique for reducing overhead in a data storage system
US20030087694A1 (en) * 1999-06-17 2003-05-08 Leonard Storch System for machine reading and processing information from gaming chips
US7124947B2 (en) 1999-06-17 2006-10-24 Cias, Inc. Self-clocking n,k code word without start or stop
US7753781B2 (en) 1999-06-17 2010-07-13 Cias, Inc. System for machine reading and processing information from gaming chips
US20050127708A1 (en) * 2002-08-14 2005-06-16 Wolfgang Richter Retracting mechanism for use with both hard and hybrid retractable tops for vehicles
US7377574B2 (en) * 2002-08-14 2008-05-27 Wilhelm Karmann Gmbh Retracting mechanism for use with both hard and hybrid retractable tops for vehicles

Similar Documents

Publication Publication Date Title
US4949200A (en) Method and apparatus for encoding and mapping magnetic disk sector addresses
US4271519A (en) Address mark generation and decoding method
US7099095B1 (en) Track identification codewords having multiple bit error correction capability and generalized gray code property
US4949342A (en) Code error detecting method
JP3405712B2 (en) Data recovery method and data storage device
JP4709485B2 (en) On-drive integrated sector format RAID error correction code system and method
US6367047B1 (en) Multi-level error detection and correction technique for data storage recording device
US4847705A (en) Method and apparatus for encoding magnetic disk sector addresses
US5265104A (en) Data storage system including redundant storage devices
JP2005500730A (en) Improved coding when information is provided to the decoder
USRE34003E (en) Method and apparatus for encoding and mapping magnetic disk sector addresses
US4914535A (en) Synchronization for stored data
US4989211A (en) Sector mis-synchronization detection method
US6769088B1 (en) Sector-coding technique for reduced read-after-write operations
US7131052B2 (en) Algebraic decoder and method for correcting an arbitrary mixture of burst and random errors
US6587977B1 (en) o,k,m,/m recording code
JP4191043B2 (en) Simple decoding method and apparatus
JPH11297000A (en) Data generating method and data generating device
US5521929A (en) Robust and redundant physical block identification scheme for data storage devices
US6694473B1 (en) Parallel signal decoding method
US20090310240A1 (en) Coding technique for correcting media defect-related errors and random errors
KR20040094436A (en) Method of joint decoding of possibly mutilated code words
EP1609245A1 (en) Method of storing information on an optical disc

Legal Events

Date Code Title Description
FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: QUANTUM CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:DIGITAL EQUIPMENT CORPORATION;REEL/FRAME:007166/0018

Effective date: 19941003

Owner name: CANADIAN IMPERIAL BANK OF COMMERCE, AS ADMINIST

Free format text: SECURITY INTEREST;ASSIGNOR:QUANTUM CORPORATION;REEL/FRAME:007152/0815

Effective date: 19941003

AS Assignment

Owner name: CANADIAN IMPERIAL BANK, AS ADMINISTRATIVE AGENT, N

Free format text: RELEASE;ASSIGNOR:QUANTUM CORPORATION;REEL/FRAME:008744/0904

Effective date: 19970818

FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12

AS Assignment

Owner name: MAXTOR CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:QUANTUM CORPORATION;REEL/FRAME:012653/0726

Effective date: 20010724

AS Assignment

Owner name: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT

Free format text: SECURITY AGREEMENT;ASSIGNORS:MAXTOR CORPORATION;SEAGATE TECHNOLOGY LLC;SEAGATE TECHNOLOGY INTERNATIONAL;REEL/FRAME:022757/0017

Effective date: 20090507

Owner name: WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATE

Free format text: SECURITY AGREEMENT;ASSIGNORS:MAXTOR CORPORATION;SEAGATE TECHNOLOGY LLC;SEAGATE TECHNOLOGY INTERNATIONAL;REEL/FRAME:022757/0017

Effective date: 20090507

AS Assignment

Owner name: SEAGATE TECHNOLOGY LLC, CALIFORNIA

Free format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:025662/0001

Effective date: 20110114

Owner name: SEAGATE TECHNOLOGY INTERNATIONAL, CALIFORNIA

Free format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:025662/0001

Effective date: 20110114

Owner name: SEAGATE TECHNOLOGY HDD HOLDINGS, CALIFORNIA

Free format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:025662/0001

Effective date: 20110114

Owner name: MAXTOR CORPORATION, CALIFORNIA

Free format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:025662/0001

Effective date: 20110114

AS Assignment

Owner name: SEAGATE TECHNOLOGY INTERNATIONAL, CAYMAN ISLANDS

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATERAL AGENT AND SECOND PRIORITY REPRESENTATIVE;REEL/FRAME:030833/0001

Effective date: 20130312

Owner name: EVAULT INC. (F/K/A I365 INC.), CALIFORNIA

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATERAL AGENT AND SECOND PRIORITY REPRESENTATIVE;REEL/FRAME:030833/0001

Effective date: 20130312

Owner name: SEAGATE TECHNOLOGY LLC, CALIFORNIA

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATERAL AGENT AND SECOND PRIORITY REPRESENTATIVE;REEL/FRAME:030833/0001

Effective date: 20130312

Owner name: SEAGATE TECHNOLOGY US HOLDINGS, INC., CALIFORNIA

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATERAL AGENT AND SECOND PRIORITY REPRESENTATIVE;REEL/FRAME:030833/0001

Effective date: 20130312