US4908826A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Stored data error correction system
Assignee: Quantum Corp
•
Filing: 1988-01-05
•
Granted: 1990-03-13
•
Expires: 2008-01-05
Abstract
Abstract In a multi-track digital recording medium, data blocks on different tracks are algebraically combined to generate an error correction code (ECC) stored in an ECC block on one of the tracks. Unrecoverable errors due to horizontal and vertical clustering of dropouts on magnetic tape, for example, are reduced by XOR-ing data blocks along a diagonal path traversing several tracks to form the ECC.
Inventors
- 👤 Friedrich R. Hertrich
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 01:51
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1833
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
153 words
A method of generating an error correction code (ECC) for parallel track data recording on a recording medium in which several adjacent tracks are defined, each track including a series of blocks of recorded information arranged in a repeating alternating sequence of a group of data blocks and at least one associated ECC block, comprising defining an ECC entity having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and algebraically combining data destined for a first set of data blocks on one track within said ECC entity with data destined for a second set of other blocks on other tracks within said ECC entity to form an ECC for an ECC block within said ECC entity on said one track, whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
Claim 2
Independent Claim
153 words
A method of generating an error correction code (ECC) for parallel track data recording on a recording medium in which several adjacent tracks are defined, each track including a series of blocks of recorded information arranged in a repeating alternating sequence of a group of data blocks and at least one associated ECC block, comprising defining an ECC entity having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and algebraically combining data destined for a first set of data blocks on one track within said ECC entity with data destined for a second set of other blocks on other tracks within said ECC entity to form an ECC for an ECC block within said ECC entity on said one track, whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
Claim 3
Dependent Claim
18 words
The method of claim 1, wherein no two of said other data blocks are on the same track.
Claim 4
Dependent Claim
20 words
The method of claim 1, wherein said other data blocks are diagonally space on neighboring tracks within said ECC entity.
Claim 5
Dependent Claim
33 words
The method of claim 1, wherein the step of combining said data blocks includes XORing data in said first and second set of data blocks in said ECC entity to form said ECC.
Claim 6
Dependent Claim
20 words
The method of claim 1, wherein said other blocks include one block from each other track within said ECC entity.
Claim 7
Dependent Claim
29 words
The method of claim 1, wherein said ECC entity forms an n x n matrix having n tracks each with at least n-1 data blocks and 1 ECC block.
Claim 8
Dependent Claim
78 words
The method of claim 6, wherein said ECC is determined by the algorithm: ##EQU10## where E t is the ECC for track t and the tracks are numbered from 1 to n, respectively, b is the block number, the blocks being numbered from 1 to n-1, respectively, the ECC block being the nth block in the ECC entity, mod n designating arithmetic within the wraparound number set comprised of a repeating sequence of integers from 1 to n.
Claim 9
Dependent Claim
61 words
The method of claim 1, wherein each track in said ECC entity has an ECC block, further comprising performing said algebraic combination so that a combination of all the ECC blocks in the ECC entity produces a known fixed result, whereby a single missing or defective ECC block can be reconstructed from the parity relationship between all of the ECC blocks.
Claim 10
Dependent Claim
144 words
A recording medium with prerecorded digital data in a format including an error correction facility, comprising a plurality of adjacent tracks defined in said recording medium, each track including a series of blocks of recorded information arranged in a series of data blocks and at least one associated ECC block, and an ECC entity defined in said medium having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and an ECC recorded in an ECC block on one track being an algebraic combination of data in a first set of data blocks on said one track with data in a second set of other blocks on other tracks of said recording medium, whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
Claim 11
Dependent Claim
144 words
A recording medium with prerecorded digital data in a format including an error correction facility, comprising a plurality of adjacent tracks defined in said recording medium, each track including a series of blocks of recorded information arranged in a series of data blocks and at least one associated ECC block, and an ECC entity defined in said medium having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and an ECC recorded in an ECC block on one track being an algebraic combination of data in a first set of data blocks on said one track with data in a second set of other blocks on other tracks of said recording medium, whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
Claim 12
Dependent Claim
18 words
The medium of claim 9, wherein no two of said other data blocks are on the same track.
Claim 13
Dependent Claim
16 words
The medium of claim 9, wherein said other data blocks are diagonally spaced on neighboring tracks.
Claim 14
Dependent Claim
22 words
The medium of claim 9, wherein said ECC is formed by XOR-ing data in said first and second sets of data blocks.
Claim 15
Dependent Claim
20 words
The medium of claim 9, wherein said other blocks include one block from each other track within an ECC entity.
Claim 16
Dependent Claim
34 words
The medium of claim 9, wherein the tracks and blocks corresponding to said ECC form an n x n matrix having n tracks each with at least n-1 data blocks and one ECC block.
Claim 17
Dependent Claim
78 words
The medium of claim 14, wherein the ECC is determined by the algorithm: ##EQU11## where E t is the ECC for track t and the tracks are numbered from 1 to n, respectively, b is the block number, the blocks being numbered from 1 to n-1, respectively, the ECC block being the nth block in the ECC entity, mod n designating arithmetic within the wraparound number set comprised of a repeating sequence of integers from 1 to n.
Claim 18
Independent Claim
251 words
A method of generating an error correction code (ECC) for parallel track data recording on a recording medium in which several adjacent tracks are defined, each track including a series of blocks of recorded information arranged in a repeating alternating sequence of a group of data blocks and at least one associated ECC block, comprising defining an ECC entity having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and algebraically combining data destined for a first set of data blocks on one track within said ECC entity with data destined for a second set of other blocks on other tracks within said ECC entity to form an ECC for an ECC block within said ECC entity on said one track, wherein said ECC entity forms an n x n matrix having n tracks each with at least n-1 data blocks and 1 ECC block, wherein said ECC is determined by the algorithm: ##EQU12## ##EQU13## where E t is the ECC for track t and the tracks are numbered from 1 to n, respectively, b is the block number, the blocks being numbered from 1 to n-1, respectively, the ECC block being the nth block in the ECC entity, mod n designating arithmetic within the wraparound number set comprised of a repeating sequence of integers from 1 to n. whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
Claim 19
Independent Claim
251 words
A method of generating an error correction code (ECC) for parallel track data recording on a recording medium in which several adjacent tracks are defined, each track including a series of blocks of recorded information arranged in a repeating alternating sequence of a group of data blocks and at least one associated ECC block, comprising defining an ECC entity having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and algebraically combining data destined for a first set of data blocks on one track within said ECC entity with data destined for a second set of other blocks on other tracks within said ECC entity to form an ECC for an ECC block within said ECC entity on said one track, wherein said ECC entity forms an n x n matrix having n tracks each with at least n-1 data blocks and 1 ECC block, wherein said ECC is determined by the algorithm: ##EQU12## ##EQU13## where E t is the ECC for track t and the tracks are numbered from 1 to n, respectively, b is the block number, the blocks being numbered from 1 to n-1, respectively, the ECC block being the nth block in the ECC entity, mod n designating arithmetic within the wraparound number set comprised of a repeating sequence of integers from 1 to n. whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
Claim 20
Dependent Claim
245 words
A recording medium with precorded digital data in a format including an error correction facility, comprising a plurality of adjacent tracks defined in said recording medium, each track including a series of blocks of recorded information arranged in a series of data blocks and at least one associated ECC block, and an ECC entity defined in said medium having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and an ECC recorded in an ECC block on one track being an algebraic combination of data in a first set of data blocks on said one track with data in a second set of other blocks on other tracks of said recording medium, wherein the tracks and blocks corresponding to said ECC form an n ×n matrix having n tracks each with at least n-1 data blocks and one ECC block, wherein the ECC is determined by the algorithm: ##EQU14## where E t is the ECC for track t and the tracks are numbered from 1 to n, respectively, b is the block number, the blocks being numbered from 1 to n-1, respectively, the ECC block being the nth block in the ECC entity, mod n designating arithmetic within the wraparound number set comprised of a repeating sequence of integers from 1 to n. whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
Claim 21
Dependent Claim
245 words
A recording medium with precorded digital data in a format including an error correction facility, comprising a plurality of adjacent tracks defined in said recording medium, each track including a series of blocks of recorded information arranged in a series of data blocks and at least one associated ECC block, and an ECC entity defined in said medium having a predetermined width encompassing several adjacent tracks and a predetermined length encompassing several consecutive data blocks in each track, and an ECC recorded in an ECC block on one track being an algebraic combination of data in a first set of data blocks on said one track with data in a second set of other blocks on other tracks of said recording medium, wherein the tracks and blocks corresponding to said ECC form an n ×n matrix having n tracks each with at least n-1 data blocks and one ECC block, wherein the ECC is determined by the algorithm: ##EQU14## where E t is the ECC for track t and the tracks are numbered from 1 to n, respectively, b is the block number, the blocks being numbered from 1 to n-1, respectively, the ECC block being the nth block in the ECC entity, mod n designating arithmetic within the wraparound number set comprised of a repeating sequence of integers from 1 to n. whereby the data in any single missing or defective one of said first or second set of blocks can be algebraically reconstructed.
References Cited (Backward Citations)
US3697948A
Cited
GB2011138A
Cited
GB2016178A
Cited
US4292684A
Cited
JPS576419A
Cited
US4435807A
Cited
US4564945A
Cited
EP0191410A2
Cited
US4716567A
Cited
EP0198702A2
Cited
US4715036A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-03-12 | 1993-09-11 | 1994-03-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-03-12 | 1997-09-11 | 1998-03-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-03-12 | 2001-09-11 | 2002-03-13 | $7700.00 | Window Closed / Lapsed |