Patent US4796110A successfully refreshed from Google Patents.
US4796110A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for encoding and storing digital information on magnetic tape
Assignee: Archive Corp
•
Filing: 1986-02-18
•
Granted: 1989-01-03
•
Expires: 2006-02-18
Abstract
Abstract The specification discloses a system and method for storing digital information on a magnetic tape wherein redundant information is generated and also stored so that subsequently unreadable portions of the tape can be regenerated based on the readable portions. The tape is formatted to include a plurality of sequentially arranged blocks, each including a plurality of generally identical data sectors and error-correction sectors. The placement of the data sectors and the associated error-correction sectors within a common block facilitates, and increases the speed of, tape writes and reads. Preferably, a Reed-Solomon code is utilized to generate the redundant information in the error-correction sectors as a preferred balance between recoverability, tape overhead, and speed of encoding.
Inventors
- 👤 Edward N. Glass
- 👤 Wayne Stark
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 14:36
CPC Classifications
G; G11; G11B; G11B5/00; G11B5/02; G11B5/09; G11B20/00; G11B20/10; G11B20/18; G11B20/1806; G11B20/1809; G11B20/12; G11B20/1201; G11B20/1202; G11B20/1205; G11B2220/00; G11B2220/90
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
152 words
A method of storing digital data words on a tape in a manner permitting recovery from erasures of certain stored data words, the method comprising: formatting the data words into a plurality of data sectors each having the same number of data words, each of the data words having no more than eight bits; formatting the data sectors into groups each having the same number of sectors; generating for each data sector group at least one error-correction sector of error-correction words each corresponding to one of the data words in each of the data sectors in the group, each error-correction word having no more than eight bits, said generating step including utilizing a Reed-Solomon code having a generator polynomial of g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256); and writing all data sectors and all error-correction sectors sequentially in any order on the tape as a block.
Claim 2
Independent Claim
152 words
A method of storing digital data words on a tape in a manner permitting recovery from erasures of certain stored data words, the method comprising: formatting the data words into a plurality of data sectors each having the same number of data words, each of the data words having no more than eight bits; formatting the data sectors into groups each having the same number of sectors; generating for each data sector group at least one error-correction sector of error-correction words each corresponding to one of the data words in each of the data sectors in the group, each error-correction word having no more than eight bits, said generating step including utilizing a Reed-Solomon code having a generator polynomial of g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256); and writing all data sectors and all error-correction sectors sequentially in any order on the tape as a block.
Claim 3
Dependent Claim
27 words
A method as defined in claim 1 wherein said writing step includes writing all of the error-correction sectors within each block at one end of the block.
Claim 4
Dependent Claim
30 words
A method as defined in claim 1 wherein said generating step includes generating sufficient error-correction sectors for each group in a manner to enable recovery from two erased data words.
Claim 5
Dependent Claim
29 words
A method as defined in claim 1 wherein: said formatting step includes formatting the data words into sixteen data sectors; and said generating step includes generating two error-correction sectors.
Claim 6
Dependent Claim
13 words
A method as defined in claim 1 wherein the tape comprises magnetic tape.
Claim 7
Independent Claim
125 words
A method of storing data words on a magnetic tape comprising: arranging the data words into a plurality of sectors each having the same number of words, each data word including no more than eight bits; generating at least one error-correction sector of error-correction words having said same number of words, each error-correction word corresponding to one word in each of the data sectors, each error-correction word including no more than eight bits, said generating step including the utilization of a Reed-Solomon coding scheme, the generator polynomial for the Reed-Solomon code being g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256); and writing the data sectors and the error-correction sectors on the magnetic tape sequentially in any order as a block.
Claim 8
Independent Claim
125 words
A method of storing data words on a magnetic tape comprising: arranging the data words into a plurality of sectors each having the same number of words, each data word including no more than eight bits; generating at least one error-correction sector of error-correction words having said same number of words, each error-correction word corresponding to one word in each of the data sectors, each error-correction word including no more than eight bits, said generating step including the utilization of a Reed-Solomon coding scheme, the generator polynomial for the Reed-Solomon code being g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256); and writing the data sectors and the error-correction sectors on the magnetic tape sequentially in any order as a block.
Claim 9
Dependent Claim
26 words
A method as defined in claim 6 wherein all of said steps are repetitively performed to create a plurality of the blocks on the magnetic tape.
Claim 10
Dependent Claim
24 words
A method as defined in claim 7 wherein said writing step includes writing all of the error-correction sectors at one end of the block.
Claim 11
Dependent Claim
32 words
A method as defined in claim 8 wherein said generating step includes generating error-correction sectors of sufficient quantity and quality to permit recovery from erasure of at least two corresponding data words.
Claim 12
Dependent Claim
28 words
A method as defined in claim 8 wherein: said formatting step includes formatting the data into sixteen data sectors; and said generating step includes generating two error-correction sectors.
Claim 13
Dependent Claim
20 words
A method as defined in claim 6 wherein said generating step includes generating the error-correction words using a look-up table.
Claim 14
Dependent Claim
168 words
A magnetic tape having digital information recorded thereon, said tape comprising: a plurality of tracks each extending substantially the full length of the tape; a plurality of sequentially arranged blocks on each of said tracks, each of said blocks including a plurality of sequentially arranged sectors, each of said sectors including a plurality of sequentially arranged digital words; and selected ones of said sectors within each block being data sectors and including only data words, others of said sectors within each block being error-correction sectors including only error-correction words each corresponding to one data word in each of said data sectors, each of the data words and the error-correction words including no more than eight bits, said corresponding error-correction words and data words being related by a Reed-Solomon code so that an erasure of one of the corresponding words can be restored based on the unerased words, the generator polynomial for the Reed-Solomon code being g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256).
Claim 15
Dependent Claim
168 words
A magnetic tape having digital information recorded thereon, said tape comprising: a plurality of tracks each extending substantially the full length of the tape; a plurality of sequentially arranged blocks on each of said tracks, each of said blocks including a plurality of sequentially arranged sectors, each of said sectors including a plurality of sequentially arranged digital words; and selected ones of said sectors within each block being data sectors and including only data words, others of said sectors within each block being error-correction sectors including only error-correction words each corresponding to one data word in each of said data sectors, each of the data words and the error-correction words including no more than eight bits, said corresponding error-correction words and data words being related by a Reed-Solomon code so that an erasure of one of the corresponding words can be restored based on the unerased words, the generator polynomial for the Reed-Solomon code being g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256).
Claim 16
Dependent Claim
24 words
A magnetic tape as defined in claim 12 wherein all error-correction sectors within each block are arranged sequentially at one end of the block.
Claim 17
Dependent Claim
26 words
A magnetic tape as defined in claim 12 wherein the corresponding error-correction and data words are related so that two of said erasures can be restored.
Claim 18
Dependent Claim
19 words
A magnetic tape as defined in claim 12 wherein each block includes sixteen data sectors and two error-correction sectors.
Claim 19
Dependent Claim
138 words
A tape having digital information recorded thereon, said tape comprising a plurality of sequentially arranged block areas each including a plurality of sector areas each including a plurality of digital words, selected ones of said sector areas each having a given number of data words stored thereon, the others of said sector areas each having the given number of error-correction words stored thereon, each of the data words and the error-correction words including no more than eight bits, each error-correction word corresponding to one data word in each of said sector areas, the error-correction words having been generated from the corresponding data words using a Reed-Solomon code enabling restoration of erasure of at least one data word, the generator polynomial for the Reed-Solomon code is g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256).
Claim 20
Dependent Claim
138 words
A tape having digital information recorded thereon, said tape comprising a plurality of sequentially arranged block areas each including a plurality of sector areas each including a plurality of digital words, selected ones of said sector areas each having a given number of data words stored thereon, the others of said sector areas each having the given number of error-correction words stored thereon, each of the data words and the error-correction words including no more than eight bits, each error-correction word corresponding to one data word in each of said sector areas, the error-correction words having been generated from the corresponding data words using a Reed-Solomon code enabling restoration of erasure of at least one data word, the generator polynomial for the Reed-Solomon code is g(x)=x 2 +q 69 x+1 where q is a primitive root of GF(256).
Claim 21
Dependent Claim
13 words
A tape as defined in claim 16 wherein said tape comprises magnetic tape.
Claim 22
Dependent Claim
37 words
A tape as defined in claim 16 wherein the sectors within each block are sequentially ordered on the tape, and further wherein the error-correction sector areas within each block are arranged at one end of the block.
Claim 23
Dependent Claim
20 words
A tape as defined in claim 16 wherein each block includes sixteen data sector areas and two error-correction sector areas.
Claim 24
Dependent Claim
25 words
A tape as defined in claim 16 wherein the data and error-correction words are generated enabling recovery from erasure of at least two data words.
References Cited (Backward Citations)
US3745528A
Cited
US3911402A
Cited
US4413339A
Cited
US4468712A
Cited
US4472750A
Cited
US4593394A
Cited
US4607367A
Cited
US4637021A
Cited
US4646303A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-01-03 | 1992-07-04 | 1993-01-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-01-03 | 1996-07-04 | 1997-01-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-01-03 | 2000-07-04 | 2001-01-03 | $7700.00 | Window Closed / Lapsed |