Patent US4564945A successfully refreshed from Google Patents.
US4564945A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Error-correction code for digital data on video disc
Assignee: Dataware Technologies Inc
•
Filing: 1983-06-20
•
Granted: 1986-01-14
•
Expires: 2003-06-20
Abstract
Abstract Data for recordation on a video disc is given multi-redundancy at block, field and group levels. Raw data is filled typically serially row by indexed row of 8-bit words with at least one and preferably 3 words being auxiliary check words derived from the remainder of the data field of the block. Block filling is completed with the addition of preferred Reed/Solomon error-correction redundancy filling two rows for column error detection and correction and two columns for row error detection and correction. Thirty blocks, so prepared, are processed to obtain two redundant blocks, completing a 32-block data field. Writing the data onto the video disc occurs with a three-dimensional diagonal interleave at the field level. After interleave each field is additionally XORd with 62 other fields to create a redundant field. This redundant field plus the 63 data fields comprise a group. The group of fields is written to the video disk so as to maximally spatially separate adjacent fields. Recording occurs via an optical master disc. Stamped replications (video discs) are made from the master disc. Data from the video discs is decoded accordingly.
Inventors
- 👤 Neal Glover
- 👤 Kermit Clausen
- 👤 Chris Mayne
- 👤 Randy Glissmann
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 20:03
CPC Classifications
H; H04; H04N; H04N5/00; H04N5/76; H04N5/91; H04N5/93; H04N5/94; H04N5/945; G; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1806; G11B20/1809; G11B7/00; G11B7/007; G11B7/013
Claims Analysis
Total Claims: 103
Claim 1
Independent Claim
204 words
A memory for storing digital data, said memory being encoded with a two-dimensional data array having error-correction code therein, said data array comprising data intervals of multi-bit binary words, said words being written in rows and columns of sequential multi-bit binary words filling less than all of the data intervals of said array; said memory for storing digital data including at least one data interval therein for at least one auxiliary check byte computed across said data array; said memory for storing digital data further having a two-dimensional data array including at least first and second row-correcting columns having means for correcting errors across rows of data; said memory for storing digital data further having a two-dimensional data array including at least first and second column-correcting rows having means for correcting errors acros columns of data; said memory readable along said two dieminsions so that each row-correcting column and each column-correcting row including coded information for the location and correction of at least one error in a column and/or one error in a row whereby upon data regeneration by said columns and rows, said regenerated data can be used in the calculation of auxiliary check syndromes to indicate whether data has been accurately regenerated.
Claim 2
Dependent Claim
204 words
A memory for storing digital data, said memory being encoded with a two-dimensional data array having error-correction code therein, said data array comprising data intervals of multi-bit binary words, said words being written in rows and columns of sequential multi-bit binary words filling less than all of the data intervals of said array; said memory for storing digital data including at least one data interval therein for at least one auxiliary check byte computed across said data array; said memory for storing digital data further having a two-dimensional data array including at least first and second row-correcting columns having means for correcting errors across rows of data; said memory for storing digital data further having a two-dimensional data array including at least first and second column-correcting rows having means for correcting errors acros columns of data; said memory readable along said two dieminsions so that each row-correcting column and each column-correcting row including coded information for the location and correction of at least one error in a column and/or one error in a row whereby upon data regeneration by said columns and rows, said regenerated data can be used in the calculation of auxiliary check syndromes to indicate whether data has been accurately regenerated.
Claim 3
Dependent Claim
31 words
The memory of claim 1 and wherein said column correction rows and said row correcting columns of said memory extend at respective identical column and row addresses linearly across said memory.
Claim 4
Dependent Claim
27 words
The memory of claims 1 and wherein said memory for said data array includes within said field three auxiliary check bytes therein computed across the data field.
Claim 5
Dependent Claim
27 words
The memory of claim 1 wherein said memory including said two-dimensional array is combined with other correspondent two-dimensional arrays in said memory to form a three-dimensional array.
Claim 6
Dependent Claim
12 words
The apparatus of claim 1 wherein said memory is an optical disc.
Claim 7
Dependent Claim
30 words
The apparatus of claim 1 wherein said binary words are interleaved so that adjacent words in a database to be stored on said memory are physically separated on said memory.
Claim 8
Dependent Claim
75 words
A process for generating a two-dimensional array comprising the steps of: placing serially multi-bit words to said two-dimensional array to less than all of the available data areas of said array; computing over the entire field of said two-dimensional array at least one auxiliary check byte; and computing and placing in remaining portions two-dimensional array column checking rows and row checking columns whereby said two-dimensional array contains two-dimensional error correction for the regeneration of data.
Claim 9
Dependent Claim
75 words
A process for generating a two-dimensional array comprising the steps of: placing serially multi-bit words to said two-dimensional array to less than all of the available data areas of said array; computing over the entire field of said two-dimensional array at least one auxiliary check byte; and computing and placing in remaining portions two-dimensional array column checking rows and row checking columns whereby said two-dimensional array contains two-dimensional error correction for the regeneration of data.
Claim 10
Dependent Claim
27 words
The invention of claim 7 and wherein said computing and placing steps includes the step of generating Reed/Solomon code in said row correcting columns and column-correcting rows.
Claim 11
Dependent Claim
38 words
The invention of claim 7 and wherein said computing over the entire field step of said auxiliary check byte includes computing and placing at least three multi-bit binary words as auxiliary check bytes to said two-dimensional data arrays.
Claim 12
Dependent Claim
161 words
A memory for storing digital data, said memory being encoded with a three-dimensional data array for receiving an error-correction protocol, said memory for receiving said data array including: a memory for receiving multi-bit binary words, said words being written in rows and columns to form successive two-dimensional data arrays, said memory at said two-dimensional data arrays being addressable sequentially to form the three-dimensional data array; said memory at said two-dimensional data arrays including column-correcting rows and row-correction columns whereby each two-dimensional data array can be addressed for error correction along vectors in two dimensions; said successive two-dimensional data arrays of said three-dimensional array in said memory including at least one two-dimensional redundant array in said memory; and said two-dimensional redundant array of said memory being disposed for individual error correction of discrete errors in the two-dimensional arrays of the three-dimensional array along correction vectors different than those provided by said row-correcting columns and said column-correcting rows of said two-dimensional data arrays.
Claim 13
Dependent Claim
161 words
A memory for storing digital data, said memory being encoded with a three-dimensional data array for receiving an error-correction protocol, said memory for receiving said data array including: a memory for receiving multi-bit binary words, said words being written in rows and columns to form successive two-dimensional data arrays, said memory at said two-dimensional data arrays being addressable sequentially to form the three-dimensional data array; said memory at said two-dimensional data arrays including column-correcting rows and row-correction columns whereby each two-dimensional data array can be addressed for error correction along vectors in two dimensions; said successive two-dimensional data arrays of said three-dimensional array in said memory including at least one two-dimensional redundant array in said memory; and said two-dimensional redundant array of said memory being disposed for individual error correction of discrete errors in the two-dimensional arrays of the three-dimensional array along correction vectors different than those provided by said row-correcting columns and said column-correcting rows of said two-dimensional data arrays.
Claim 14
Dependent Claim
17 words
The memory of claim 10 and wherein said column-correcting rows and said row-correcting columns certain Reed/Solomon code.
Claim 15
Dependent Claim
27 words
The memory of claim 10 and wherein said successive two-dimensional sata arrays of said three-dimensional data array in said memory include first and second two-dimensional redundant arrays.
Claim 16
Dependent Claim
24 words
The memory of claim 10 and wherein said correction vectors are orthogonal to one another along first, second and third directions through the memory.
Claim 17
Dependent Claim
12 words
The apparatus of claim 10 wherein said memory is an optical disc.
Claim 18
Dependent Claim
135 words
A process of generating a three-dimensional data array containing redundancy information comprising: generating at least one two-dimensional data array having rows and columns by serially placing multi-bit binary words until said array contains data; generating sequentially after said first two-dimensional data array a plurality of correspondent data arrays whereby successive two-dimensional data arrays are serially generated to form said three-dimensional data array; generating for each two-dimensional data array a plurality of column-correcting rows and row-correcting columns whereby error in each of said two-dimensional data arrays is individually addressable along two error-correcting vectors within said two-dimensional data arrays to redundantly correct any single error; and generating across the two-dimensional arrays at least one two-dimensional redundant array, whereby redundancy data from said two-dimensional redundant arrays are individually addressable to error along dimensions across said two-dimensional data arrays.
Claim 19
Dependent Claim
135 words
A process of generating a three-dimensional data array containing redundancy information comprising: generating at least one two-dimensional data array having rows and columns by serially placing multi-bit binary words until said array contains data; generating sequentially after said first two-dimensional data array a plurality of correspondent data arrays whereby successive two-dimensional data arrays are serially generated to form said three-dimensional data array; generating for each two-dimensional data array a plurality of column-correcting rows and row-correcting columns whereby error in each of said two-dimensional data arrays is individually addressable along two error-correcting vectors within said two-dimensional data arrays to redundantly correct any single error; and generating across the two-dimensional arrays at least one two-dimensional redundant array, whereby redundancy data from said two-dimensional redundant arrays are individually addressable to error along dimensions across said two-dimensional data arrays.
Claim 20
Dependent Claim
42 words
The process of claim 15 and wherein said generating of at least one two-dimensional array with rows and columns by serially placing multi-bit binary words comprises generating said rows and columns until all of said rows and columns excepting two contain data.
Claim 21
Dependent Claim
33 words
The invention of claim 15 and wherein the steps of generating sequentially after said first two-dimensional data array a plurality of correspondent data arrays includes the step of generating sequentially two-dimensional data arrays.
Claim 22
Dependent Claim
17 words
The invention of claims 15 and wherein said generating steps include the step of generating Reed/Solomon code.
Claim 23
Dependent Claim
33 words
The process of claim 15 further comprising interleaving said binary words so that adjacent words in a database to be stored in said three-dimensional data array are separated in said three-dimensional data array.
Claim 24
Dependent Claim
134 words
A process of writing a two-dimensional data array comprising the steps of: filling serially in said two-dimensional array data to an area of said array; generating and filling row correcting columns for locating and correcting error in rows of said two-dimensional data array; generating and filling column correcting rows for locating and correcting error in columns of said two-dimensional data array; whereby said two-dimensional array contains two-dimensional correction directions along said array; and serially writing to a memory media said rows and columns of said data array including said row correcting columns and said column correcting rows, said writing occurring from a sequence along directions differing from said error-correction whereby sequential errors on read back from said memory are individually addressable by differing data, including errors in said column-correcting rows and said row-correcting columns.
Claim 25
Dependent Claim
134 words
A process of writing a two-dimensional data array comprising the steps of: filling serially in said two-dimensional array data to an area of said array; generating and filling row correcting columns for locating and correcting error in rows of said two-dimensional data array; generating and filling column correcting rows for locating and correcting error in columns of said two-dimensional data array; whereby said two-dimensional array contains two-dimensional correction directions along said array; and serially writing to a memory media said rows and columns of said data array including said row correcting columns and said column correcting rows, said writing occurring from a sequence along directions differing from said error-correction whereby sequential errors on read back from said memory are individually addressable by differing data, including errors in said column-correcting rows and said row-correcting columns.
Claim 26
Dependent Claim
17 words
The invention of claim 20 and wherein said row-correcting columns and said column-correcting rows include Reed/Solomon code.
Claim 27
Dependent Claim
48 words
The invention of claim 20 and including the step of filling serially in sequential rows in said two-dimensional array to less than all of the available data areas of said arrays; and computing over the entire field of said two-dimensional array data at least one auxiliary check byte.
Claim 28
Dependent Claim
190 words
A process of generating a three-dimensional data array containing redundancy information comprising in combination: generating a plurality of two-dimensional data arrays having rows and columns by serially placing multi-bit binary words to said data array; generating for each two-dimensional data array a plurality of column correcting rows and row-correcting columns whereby error in each two-dimensional array is individually addressable along two error-correcting directions of first and second differing direction to redundantly correct any single error; generating across the two-dimensional arrays of said three-dimensional array along a third dimension a plurality of two-dimensional redundant arrays, the third dimension of generation being different in direction from the two error-correcting directions of said two-dimensional data arrays whereby redundancy data from said two-dimensional data arrays are individually addressable to any single error across the third dimension to any of said two-dimensional arrays; and writing to a memory media from said three-dimensional array along a fourth direction of said three-dimensional array, said write causing sequential error on read back from said memory media to be addressable by differing error-correction code combinations from said column correcting rows, said row correcting columns and said two-dimensional redundant arrays.
Claim 29
Dependent Claim
190 words
A process of generating a three-dimensional data array containing redundancy information comprising in combination: generating a plurality of two-dimensional data arrays having rows and columns by serially placing multi-bit binary words to said data array; generating for each two-dimensional data array a plurality of column correcting rows and row-correcting columns whereby error in each two-dimensional array is individually addressable along two error-correcting directions of first and second differing direction to redundantly correct any single error; generating across the two-dimensional arrays of said three-dimensional array along a third dimension a plurality of two-dimensional redundant arrays, the third dimension of generation being different in direction from the two error-correcting directions of said two-dimensional data arrays whereby redundancy data from said two-dimensional data arrays are individually addressable to any single error across the third dimension to any of said two-dimensional arrays; and writing to a memory media from said three-dimensional array along a fourth direction of said three-dimensional array, said write causing sequential error on read back from said memory media to be addressable by differing error-correction code combinations from said column correcting rows, said row correcting columns and said two-dimensional redundant arrays.
Claim 30
Dependent Claim
20 words
The invention of claim 23 and wherein said two-dimensional redundant arrays are aligned in parallel planes in said three-dimensional array.
Claim 31
Dependent Claim
30 words
The invention of claim 23 and wherein said write to a memory media from said three-dimensional array moves sequentially through said two-dimensional data arrays with each serial multi-bit binary word.
Claim 32
Dependent Claim
31 words
The invention of claim 23 and wherein said write to a memory media from said three-dimensional array moves sequentially through said data arrays at each of differing row and column positions.
Claim 33
Dependent Claim
178 words
A process of reading from a memory media a two-dimensional array, said two-dimensional array having error-correction code therein, said two-dimensional data array comprising: multi-bit binary words, said words being in rows and columns of sequential words filling less than all the data spaces of said array, said data array including at least one data interval therein for at least one auxiliary check byte computed across said data array and placed in said data interval; said two-dimensional array including first and second row-correcting columns and first and second column-correcting rows for locating and correcting error across said respective rows and columns; and the process of reading said two-dimensional data array comprising the steps of: computing across rows of said two-dimensional array to generate at least two columns of row syndromes, said syndromes having values to flag the presence of errors, computing across said columns to form at least two rows of column syndromes having values to flag the presence of error; and computing across said data array including said auxiliary check bytes syndromes to flag the presence of error.
Claim 34
Dependent Claim
178 words
A process of reading from a memory media a two-dimensional array, said two-dimensional array having error-correction code therein, said two-dimensional data array comprising: multi-bit binary words, said words being in rows and columns of sequential words filling less than all the data spaces of said array, said data array including at least one data interval therein for at least one auxiliary check byte computed across said data array and placed in said data interval; said two-dimensional array including first and second row-correcting columns and first and second column-correcting rows for locating and correcting error across said respective rows and columns; and the process of reading said two-dimensional data array comprising the steps of: computing across rows of said two-dimensional array to generate at least two columns of row syndromes, said syndromes having values to flag the presence of errors, computing across said columns to form at least two rows of column syndromes having values to flag the presence of error; and computing across said data array including said auxiliary check bytes syndromes to flag the presence of error.
Claim 35
Dependent Claim
41 words
The invention of claim 27 and including the steps of counting said row correction syndromes and said column correction syndromes and, starting correction in the row dimension or column dimension, whichever has the most values to flag the presence of error.
Claim 36
Dependent Claim
24 words
The invention of claim 27 and including the step of utilizing Reed/Solomon code to locate error and correct error along said rows and columns.
Claim 37
Dependent Claim
15 words
The invention of claim 29 and including the steps of iterating row and column correction.
Claim 38
Dependent Claim
28 words
The invention of claim 27 including computing and with each error correction step to update auxiliary check byte syndromes computed across said data field of said two-dimensional array.
Claim 39
Dependent Claim
16 words
The invention of claim 30 and wherein said iterating extends to three row and column iterations.
Claim 40
Dependent Claim
222 words
A process of reading from a memory media a three-dimensional data array for error-correction protocol incorporated therein, said data array including multi-bit binary words, said words being filled in rows and columns to form successive two-dimensional data arrays, said two-dimensional data arrays being addressable sequentially to form said three-dimensional data arrays; each said two-dimensional data array including at least paired column correcting rows and at least paired row-correcting columns whereby each two-dimensional data array can be addressed for discrete error correction in two-dimensions, said successive two-dimensional arrays of said three-dimensional array including at least first and second two-dimensional redundant arrays, said two-dimensional redundant arrays being disposed for individual error correction of discrete errors across the two-dimensional arrays of said three-dimensional array along directions differing from those provided by said row correcting columns and said column correcting rows, said process of reading from a memory media comprising the steps of: generating for one two-dimensional array at least two columns of syndromes, each syndrome addressed to a row of data, said syndrome having values for indicating error; generating for one array at least two rows of syndromes having values for indicating the presence of error; and generating syndromes across said two-dimensional arrays including said two-dimensional redundant arrays whereby single error may be addressed parallel to first, second and third differing directions along said arrays.
Claim 41
Dependent Claim
222 words
A process of reading from a memory media a three-dimensional data array for error-correction protocol incorporated therein, said data array including multi-bit binary words, said words being filled in rows and columns to form successive two-dimensional data arrays, said two-dimensional data arrays being addressable sequentially to form said three-dimensional data arrays; each said two-dimensional data array including at least paired column correcting rows and at least paired row-correcting columns whereby each two-dimensional data array can be addressed for discrete error correction in two-dimensions, said successive two-dimensional arrays of said three-dimensional array including at least first and second two-dimensional redundant arrays, said two-dimensional redundant arrays being disposed for individual error correction of discrete errors across the two-dimensional arrays of said three-dimensional array along directions differing from those provided by said row correcting columns and said column correcting rows, said process of reading from a memory media comprising the steps of: generating for one two-dimensional array at least two columns of syndromes, each syndrome addressed to a row of data, said syndrome having values for indicating error; generating for one array at least two rows of syndromes having values for indicating the presence of error; and generating syndromes across said two-dimensional arrays including said two-dimensional redundant arrays whereby single error may be addressed parallel to first, second and third differing directions along said arrays.
Claim 42
Dependent Claim
19 words
The invention of claim 29 and wherein said generating step further includes locating said error and correcting said error.
Claim 43
Dependent Claim
25 words
The invention of claim 29 and including the step of applying error correction on less than all of said two-dimensional arrays of said three-dimensional array.
Claim 44
Dependent Claim
27 words
The invention of claim 29 and wherein said generating of syndromes across said two-dimensional array includes syndrome generation on less than all of said two-dimensional data arrays.
Claim 45
Dependent Claim
22 words
The invention of claim 29 and wherein said generating of syndromes across said two-dimensional array includes all of said two-dimensional data arrays.
Claim 46
Dependent Claim
49 words
The invention of claim 29 and wherein said generating of syndromes step includes locating two or less two-dimensional data arrays not correctable by the column correcting rows and the row correcting columns of said arrays and after location of said arrays correcting said arrays using the two-dimensional redundant arrays.
Claim 47
Dependent Claim
190 words
A process of generating a group of three-dimensional data arrays containing redundancy information comprising in combination: generating a plurality of two-dimensional data arrays having rows and columns by serially filling data bits to said data array; generating for each two-dimensional data array a plurality of column correcting rows and row-correcting columns whereby on read back error in each two-dimensional array is individually addressable along first and second directions to redundantly correct discrete error; generating across the two-dimensional arrays of said three-dimensional arrays along a third direction a plurality of redundancy two-dimensional arrays, the third direction being different from the two error-correcting directions of said two-dimensional data arrays whereby on read back discrete errors from said two-dimensional data arrays are individually addressable to correct error through the dimension of said two-dimensional data arrays; writing to a memory media from said three-dimensional arrays along a fourth direction through said three-dimensional array, said write causing on read back sequential discrete error to be addressable by differing error-correction codes from said column correcting rows, said row correcting columns and said two-dimensional redundant data arrays; and writing said redundant three-dimensional array to said memory media.
Claim 48
Dependent Claim
190 words
A process of generating a group of three-dimensional data arrays containing redundancy information comprising in combination: generating a plurality of two-dimensional data arrays having rows and columns by serially filling data bits to said data array; generating for each two-dimensional data array a plurality of column correcting rows and row-correcting columns whereby on read back error in each two-dimensional array is individually addressable along first and second directions to redundantly correct discrete error; generating across the two-dimensional arrays of said three-dimensional arrays along a third direction a plurality of redundancy two-dimensional arrays, the third direction being different from the two error-correcting directions of said two-dimensional data arrays whereby on read back discrete errors from said two-dimensional data arrays are individually addressable to correct error through the dimension of said two-dimensional data arrays; writing to a memory media from said three-dimensional arrays along a fourth direction through said three-dimensional array, said write causing on read back sequential discrete error to be addressable by differing error-correction codes from said column correcting rows, said row correcting columns and said two-dimensional redundant data arrays; and writing said redundant three-dimensional array to said memory media.
Claim 49
Dependent Claim
16 words
The invention of claim 39 and wherein said computing step includes the step of exclusively ORing.
Claim 50
Dependent Claim
47 words
The invention of claim 33 and including the steps of locating syndrome intersection for said one array and generating syndromes for error correction across said two-dimensional arrays and said two-dimensional redundant array only at the intersection of said row and column error syndromes of said two-dimensional array.
Claim 51
Dependent Claim
19 words
The invention of claim 40 and wherein said exclusive ORing step occurs during said writing to a memory media.
Claim 52
Dependent Claim
14 words
The invention of claim 39 and wherein said memory media includes a video format.
Claim 53
Dependent Claim
83 words
A computer and memory for receiving a three-dimensional data array and an error-correcting protocol, said memory for said array including: memory for receiving multi-bit binary words, each of said words being written at the intersection of first, second and third addresses; and said computer for processing each of said words to generate first, second and third error-correction computations independently addressable by said first, second and third address whereby any data point within said three-dimensional array is addressable by first, second and third error-corrections.
Claim 54
Dependent Claim
83 words
A computer and memory for receiving a three-dimensional data array and an error-correcting protocol, said memory for said array including: memory for receiving multi-bit binary words, each of said words being written at the intersection of first, second and third addresses; and said computer for processing each of said words to generate first, second and third error-correction computations independently addressable by said first, second and third address whereby any data point within said three-dimensional array is addressable by first, second and third error-corrections.
Claim 55
Dependent Claim
199 words
An error-correction protocol for reading a three-dimensional data array, said data array having a plurality of two-dimensional data arrays having rows and columns serially filled with multi-bit binary data words, at least one auxiliary check byte computed across said data words and plurality of column correcting rows and row correcting columns aligned to said two-dimensional data array; a collection of said data arrays forming said three-dimensional data array and having a plurality of two-dimensional redundant data arrays for correcting error across said two-dimensional data arrays; the process comprising the steps of: locating a two-dimensional data array to be decoded from within said three-dimensional array; generating for the located data array only respective column syndromes and row syndromes from said data and said column-correcting rows and row connecting columns, said syndromes having values to indicate presence of error; decoding said syndromes for error in the dimension of said two-dimensional array having the most values indicating the presence of error; thereafter decoding said syndromes for error in the remaining dimension of said two-dimensional array and if all said values indicating the presence of error are eliminated, generating an auxiliary check byte syndrome, said auxiliary syndrome having a value to indicate error.
Claim 56
Dependent Claim
199 words
An error-correction protocol for reading a three-dimensional data array, said data array having a plurality of two-dimensional data arrays having rows and columns serially filled with multi-bit binary data words, at least one auxiliary check byte computed across said data words and plurality of column correcting rows and row correcting columns aligned to said two-dimensional data array; a collection of said data arrays forming said three-dimensional data array and having a plurality of two-dimensional redundant data arrays for correcting error across said two-dimensional data arrays; the process comprising the steps of: locating a two-dimensional data array to be decoded from within said three-dimensional array; generating for the located data array only respective column syndromes and row syndromes from said data and said column-correcting rows and row connecting columns, said syndromes having values to indicate presence of error; decoding said syndromes for error in the dimension of said two-dimensional array having the most values indicating the presence of error; thereafter decoding said syndromes for error in the remaining dimension of said two-dimensional array and if all said values indicating the presence of error are eliminated, generating an auxiliary check byte syndrome, said auxiliary syndrome having a value to indicate error.
Claim 57
Dependent Claim
62 words
The error-correction protocol of claim 45 and including the step of observing said two-dimensional data array during said decoding step for two rows and two or less columns with syndrome values indicating error; or two columns and two or less rows with syndrome values indicating error and performing a two erasure correction algorithm and repeating said generating an auxiliary check syndrome step.
Claim 58
Dependent Claim
87 words
The error-correction protocol of claim 45 comprising the steps of: observing said row and column syndrome values for indicating error and determining if there are precisely two rows and two or more columns with syndrome values indicating error or precisely two columns and two or more rows with syndrome values indicating error, utilizing these values to map possible locations of error; and then as to said mapped and possible locations of error performing a two erasure algorithm and repeating said step generating an auxiliary check byte syndrome.
Claim 59
Dependent Claim
29 words
The error-correction protocol of claim 47 and wherein said repeating said step generating an auxiliary check syndrome includes updating said auxiliary check syndrome as column and row corrections occur.
Claim 60
Dependent Claim
25 words
The error-correction protocol of claim 45 including performing iterations of said decoding for the located data array only until the number of iterations reaches three.
Claim 61
Dependent Claim
57 words
The error-correction protocol of claim 49 and including the step of observing said two-dimensional array after said third iteration and if only two rows and two or more columns or two columns and two or more rows with error-indicating syndrome values remain, performing a two erasure correction algorithm and repeating said step generating an auxiliary check syndrome.
Claim 62
Dependent Claim
99 words
The error-correction protocol of claim 50 including the steps of: if the step of generating an auxiliary check syndrome has a value indicating error, removing all changes to the data block and restoring said data block, and thereafter locating each site of possible error by observing check byte syndromes with error-indicating values to map possible error location and thereafter computing error-correction syndromes along vectors across said two-dimensional data arrays including said two-dimensional redundant arrays at said mapped sites only; decoding said error-correction syndromes to correct error; and, repeating said step generating an auxiliary syndrome step on said two-dimensional array.
Claim 63
Dependent Claim
143 words
The error-correction protocol of claim 51 and including the steps of: if the step of generating an auxiliary check syndrome has a value indicating error thereafter generating row and column syndromes for all of the two-dimensional arrays of said three-dimensional array; thereafter utilizing said generated syndromes to locate and correct error in said two-dimensional arrays of said three-dimensional array and performing said auxiliary check byte syndrome step on all of the said two-dimensional arrays and if after a predetermined number of iterations there are one or more two-dimensional arrays not successfully decoded then locating the error sites in said two-dimensional arrays that are not successfully decoded; generating syndromes across said data arrays at least at said located error sites including said two-dimensional redundant data arrays and utilizing said syndromes to locate and correct error and repeating said generating an auxiliary check syndrome step.
Claim 64
Dependent Claim
61 words
The error-correction protocol of claim 52 and including the steps of observing the auxiliary check syndromes for said two-dimensional data arrays and if only one or two syndromes have values in said three-dimensional data array, performing erasure correction on the two-dimensional arrays having an auxiliary check syndrome with value indicating errors and repeating said step of generating an auxiliary check syndrome.
Claim 65
Dependent Claim
27 words
The error-correction protocol of claim 53 and wherein only one two-dimensional array has auxiliary check syndrome with value indicating error and a single-erasure error correction is performed.
Claim 66
Dependent Claim
25 words
The error-correction protocol of claim 53 and wherein two-dimensional arrays have auxiliary check syndromes with value indicating error and a double-erasure error correction is performed.
Claim 67
Dependent Claim
60 words
The error-correction protocol of claim 53 and including if said auxiliary check syndrome has error-indicating value, then observing if there are more than two two-dimensional arrays not yet successfully decoded; and if said observation is true, rereading at least said two-dimensional arrays with auxiliary check syndromes having value indicating error of three-dimensional arrays and repeating the steps of claim 45.
Claim 68
Dependent Claim
33 words
The error-correction protocol of claim 53 and wherein said reread is done an odd number of times exceeding one and a majority vote is taken across all reads for each bit or byte.
Claim 69
Independent Claim
174 words
An apparatus for reading from a memory media a two-dimensional array, said two-dimensional array having error-correction code therein, said two-dimensional array comprising multi-bit binary words, said words being in rows and columns of sequential words filling less than all the data spaces of said array, said array including at least one data interval therein for at least one auxiliary check byte computed across said data array and placed in said data interval, said two-dimensional array including first and second row-correcting columns and first and second column-correcting rows for locating and correcting errors across said respective rows and columns, said apparatus comprising: means for computing across rows of said two-dimensional array to generate at least two columns of row correction syndromes, said syndromes having values to flag the presence of errors; means for computing across said columns to form at least two rows of column correction syndromes having values to flag the presence of errors; and means for computing across said data array including said auxiliary check bytes syndromes to flag the presence of errors.
Claim 70
Independent Claim
174 words
An apparatus for reading from a memory media a two-dimensional array, said two-dimensional array having error-correction code therein, said two-dimensional array comprising multi-bit binary words, said words being in rows and columns of sequential words filling less than all the data spaces of said array, said array including at least one data interval therein for at least one auxiliary check byte computed across said data array and placed in said data interval, said two-dimensional array including first and second row-correcting columns and first and second column-correcting rows for locating and correcting errors across said respective rows and columns, said apparatus comprising: means for computing across rows of said two-dimensional array to generate at least two columns of row correction syndromes, said syndromes having values to flag the presence of errors; means for computing across said columns to form at least two rows of column correction syndromes having values to flag the presence of errors; and means for computing across said data array including said auxiliary check bytes syndromes to flag the presence of errors.
Claim 71
Dependent Claim
40 words
The apparatus of claim 58 further comprising means for counting said row correction syndromes and said column correction syndromes and starting correction in the row dimension or column dimension, whichever has the most values, to flag the presence of error.
Claim 72
Dependent Claim
23 words
The apparatus of claim 58 further comprising means for utilizing Reed/Solomon code to locate error and correct error along said rows and columns.
Claim 73
Dependent Claim
14 words
The apparatus of claim 60 further comprising means for iterating row and column correction.
Claim 74
Dependent Claim
15 words
The apparatus of claim 61 wherein said iterating extends to three row and column iterations.
Claim 75
Dependent Claim
30 words
The apparatus of claim 58 further comprising means for computing with each error correction step to update auxiliary check byte syndromes computed across said data field of said two-dimensional array.
Claim 76
Dependent Claim
13 words
The apparatus of claim 58 wherein said memory media ia an optical disc.
Claim 77
Independent Claim
216 words
An apparatus for reading from memory media a three-dimensional data array for error-correction protocol incorporated therein, said data array including multi-bit binary words, said words being filled in rows and columns to form successive two-dimensional data arrays, said two-dimensional data arrays being addressable sequentially to form said three-dimensional data arrays; each said two-dimensional data array including at least paired column-correcting rows and at least paired row-correcting columns whereby each two-dimensional data array can be addressed for discrete error correction in two dimensions, said successive two-dimensional arrays of said three-dimensional array including at least first and second two-dimensional redundant arrays, said two-dimensional redundant arrays being disposed for individual error correction of discrete errors across the two-dimensional arrays of said three-dimensional array along directions differing from those provided by said row-correcting columns and said column-correcting rows, said apparatus comprising: means for generating for one two-dimensional array at least two columns of syndromes, each syndrome addressed to a row of data, said syndrome having values for indicating error; means for generating for one array at least two rows of syndromes having values for indicating the presence of error; and means for generating syndromes across said two-dimensional arrays including said two-dimensional redundant arrays whereby single error may be addressed parallel to first, second and third differing directions along said arrays.
Claim 78
Independent Claim
216 words
An apparatus for reading from memory media a three-dimensional data array for error-correction protocol incorporated therein, said data array including multi-bit binary words, said words being filled in rows and columns to form successive two-dimensional data arrays, said two-dimensional data arrays being addressable sequentially to form said three-dimensional data arrays; each said two-dimensional data array including at least paired column-correcting rows and at least paired row-correcting columns whereby each two-dimensional data array can be addressed for discrete error correction in two dimensions, said successive two-dimensional arrays of said three-dimensional array including at least first and second two-dimensional redundant arrays, said two-dimensional redundant arrays being disposed for individual error correction of discrete errors across the two-dimensional arrays of said three-dimensional array along directions differing from those provided by said row-correcting columns and said column-correcting rows, said apparatus comprising: means for generating for one two-dimensional array at least two columns of syndromes, each syndrome addressed to a row of data, said syndrome having values for indicating error; means for generating for one array at least two rows of syndromes having values for indicating the presence of error; and means for generating syndromes across said two-dimensional arrays including said two-dimensional redundant arrays whereby single error may be addressed parallel to first, second and third differing directions along said arrays.
Claim 79
Dependent Claim
21 words
The apparatus of claim 65 wherein said first generating means further includes means for locating said error and correcting said error.
Claim 80
Dependent Claim
24 words
The apparatus of claim 65 further comprising means for applying error correction on less than all of said two-dimensional arrays of said three-dimensional array.
Claim 81
Dependent Claim
24 words
The apparatus of claim 65 wherein said third generating means includes means for generating syndromes on less than all of said two-dimensional data arrays.
Claim 82
Dependent Claim
22 words
The apparatus of claim 65 wherein said third generating means includes means for generating syndromes on all of said two-dimensional data arrays.
Claim 83
Dependent Claim
47 words
The apparatus of claim 65 wherein said third generating means includes means for locating two or less two-dimensional data arrays not correctable by the column-correcting rows and the row-correcting columns of said arrays and, after location of said arrays, correcting said arrays using the two-dimensional redundant arrays.
Claim 84
Dependent Claim
215 words
A processor for decoding a data array comprising: temporary memory means for storing said data array; an arithmetic logic unit; a plurality of latches for storing memory addresses; and permanent memory means for storing a program adapted to control said temporary memory means, arithmetic logic unit and latches to decode a two-dimensional data array having error-correction code therein, said data array comprising data intervals of multi-bit binary words, said words being written in rows and columns of sequential multi-bit binary words filling less than all of the data intervals of said array; said data array including at least one data interval therein for at least one auxiliary check byte computed across the data array; said two-dimensional data array including at least first and second row-correcting columns having means for correcting errors across rows of data; said two-dimensional data array including at least first and second column-correcting rows having means for correcting errors across columns of data; each row-correcting column and each column-correcting row including coded information for the location and correction of at least one error in a column and/or one error in a row whereby upon data regeneration by said columns and rows, said regenerated data can be used in the calculation of auxiliary check syndromes to indicate whether data has been acurately regenerated.
Claim 85
Dependent Claim
215 words
A processor for decoding a data array comprising: temporary memory means for storing said data array; an arithmetic logic unit; a plurality of latches for storing memory addresses; and permanent memory means for storing a program adapted to control said temporary memory means, arithmetic logic unit and latches to decode a two-dimensional data array having error-correction code therein, said data array comprising data intervals of multi-bit binary words, said words being written in rows and columns of sequential multi-bit binary words filling less than all of the data intervals of said array; said data array including at least one data interval therein for at least one auxiliary check byte computed across the data array; said two-dimensional data array including at least first and second row-correcting columns having means for correcting errors across rows of data; said two-dimensional data array including at least first and second column-correcting rows having means for correcting errors across columns of data; each row-correcting column and each column-correcting row including coded information for the location and correction of at least one error in a column and/or one error in a row whereby upon data regeneration by said columns and rows, said regenerated data can be used in the calculation of auxiliary check syndromes to indicate whether data has been acurately regenerated.
Claim 86
Dependent Claim
16 words
The processor of claim 71 wherein said column-correcting rows and said row-correcting columns contain Reed/Solomon code.
Claim 87
Dependent Claim
25 words
The processor of claim 71 wherein said column-correcting rows and said row-correcting columns extend at respective identical column and row address linearly across said array.
Claim 88
Dependent Claim
20 words
The processor of claim 71 wherein said data array includes three auxiliary check bytes therein computed across the data array.
Claim 89
Dependent Claim
21 words
The processor of claim 71 wherein said two-dimensional array is combined with other correspondent two-dimensional arrays to form a three-dimensional array.
Claim 90
Dependent Claim
19 words
The processor of claim 71 wherein said row-correcting columns and said column-correcting rows can regenerate said auxiliary check bytes.
Claim 91
Dependent Claim
176 words
A processor for decoding a data array comprising: temporary memory means for storing said data array; an arithmetic logic unit; a plurality of latches for storing memory addresses; and permanent memory means for storing a program adapted to control said temporary memory means, arithmetic logic unit and latches to decode a three-dimensional data array with an error-correction protocol, said data array including multi-bit binary words, said words being written in rows and columns to form successive two-dimensional data arrays, said two-dimensional data arrays being addressable sequentially to form the three-dimensional data array; said two-dimensional data arrays including column-correcting rows and row-correcting columns whereby each two-dimensional data array can be addressed for error correction along vectors in two dimensions; said successive two-dimensional data arrays of said three-dimensional array including at least one two-dimensional redundant array; and said two-dimensional redundant array being disposed for individual error correction of discrete errors in the two-dimensional arrays of the three-dimensional array along correction vectors different than those provided by said row-correcting columns and said column-correcting rows of said two-dimensional data arrays.
Claim 92
Dependent Claim
176 words
A processor for decoding a data array comprising: temporary memory means for storing said data array; an arithmetic logic unit; a plurality of latches for storing memory addresses; and permanent memory means for storing a program adapted to control said temporary memory means, arithmetic logic unit and latches to decode a three-dimensional data array with an error-correction protocol, said data array including multi-bit binary words, said words being written in rows and columns to form successive two-dimensional data arrays, said two-dimensional data arrays being addressable sequentially to form the three-dimensional data array; said two-dimensional data arrays including column-correcting rows and row-correcting columns whereby each two-dimensional data array can be addressed for error correction along vectors in two dimensions; said successive two-dimensional data arrays of said three-dimensional array including at least one two-dimensional redundant array; and said two-dimensional redundant array being disposed for individual error correction of discrete errors in the two-dimensional arrays of the three-dimensional array along correction vectors different than those provided by said row-correcting columns and said column-correcting rows of said two-dimensional data arrays.
Claim 93
Dependent Claim
16 words
The processor of claim 77 wherein said column-correcting rows and said row-correcting columns contain Reed/Solomon code.
Claim 94
Dependent Claim
23 words
The processor of claim 77 wherein said successive two-dimensional data arrays of said three-dimensional data array include first and second two-dimensional redundant arrays.
Claim 95
Dependent Claim
20 words
The processor of claim 77 wherein said correction vectors are orthogonal to one another along first, second and third directions.
Claim 96
Independent Claim
137 words
An apparatus for writing a two-dimensional data array to a memory comprising: means for serially placing multi-bit binary words in said two-dimensional array data; means for generating and filling row correcting columns for locating and correcting error in rows of said two-dimensional data array; means for generating and filling column correcting rows for locating and correcting error in columns of said two-dimensional data array; whereby said two-dimensional array contains two-dimensional correction directions along said array; and means for serially writing to a memory media said rows and columns of said data array including said row-correcting columns and said column-correcting rows, said writing occurring from a sequence along directions differing from said error-correction whereby sequential errors on read back from said memory are individually addressable by differing data, including errors in said column-correcting rows and said row-correcting columns.
Claim 97
Independent Claim
137 words
An apparatus for writing a two-dimensional data array to a memory comprising: means for serially placing multi-bit binary words in said two-dimensional array data; means for generating and filling row correcting columns for locating and correcting error in rows of said two-dimensional data array; means for generating and filling column correcting rows for locating and correcting error in columns of said two-dimensional data array; whereby said two-dimensional array contains two-dimensional correction directions along said array; and means for serially writing to a memory media said rows and columns of said data array including said row-correcting columns and said column-correcting rows, said writing occurring from a sequence along directions differing from said error-correction whereby sequential errors on read back from said memory are individually addressable by differing data, including errors in said column-correcting rows and said row-correcting columns.
Claim 98
Dependent Claim
16 words
The invention of claim 81 wherein said row-correcting columns and said column-correcting rows include Reed/Solomon code.
Claim 99
Dependent Claim
49 words
The invention of claim 81 further comprising: means for filling serially in sequential rows in said two-dimensional array to less than all of the available data areas of said arrays; and means for computing over the entire field of said two-dimensional array data at least one auxiliary check byte.
Claim 100
Independent Claim
198 words
An apparatus for writing a three-dimensional array containing redundancy information to a memory media comprising in combination: means for generating a plurality of two-dimensional data arrays having rows and columns by serially placing multi-bit binary words to said data array; means for generating for each two-dimensional data array a plurality of column-correcting rows and row-correcting columns whereby error in each two-dimensional array is individually addressable along two error-correcting directions of first and second differing directions to redundantly correct any single error; means for generating across the two-dimensional arrays of said three-dimensional array along a third dimension of plurality of two-dimensional redundant arrays, the third dimension of generation being different in direction from the two error-correcting directions of said two-dimensional data arrays whereby redundancy data from said two-dimensional data arrays are individually addressable to any single error across the third dimension to any of said two-dimensional arrays; and means for writing to a memory media from said three-dimensional array along a fourth direction of said three-dimensional array, said write causing sequential error on read back from said memory media to be addressable by differing error-correction code combinations from said column-correcting rows, said row-correcting columns and said two-dimensional redundant arrays.
Claim 101
Independent Claim
198 words
An apparatus for writing a three-dimensional array containing redundancy information to a memory media comprising in combination: means for generating a plurality of two-dimensional data arrays having rows and columns by serially placing multi-bit binary words to said data array; means for generating for each two-dimensional data array a plurality of column-correcting rows and row-correcting columns whereby error in each two-dimensional array is individually addressable along two error-correcting directions of first and second differing directions to redundantly correct any single error; means for generating across the two-dimensional arrays of said three-dimensional array along a third dimension of plurality of two-dimensional redundant arrays, the third dimension of generation being different in direction from the two error-correcting directions of said two-dimensional data arrays whereby redundancy data from said two-dimensional data arrays are individually addressable to any single error across the third dimension to any of said two-dimensional arrays; and means for writing to a memory media from said three-dimensional array along a fourth direction of said three-dimensional array, said write causing sequential error on read back from said memory media to be addressable by differing error-correction code combinations from said column-correcting rows, said row-correcting columns and said two-dimensional redundant arrays.
Claim 102
Dependent Claim
19 words
The invention of claim 84 wherein said two-dimensional redundant arrays are aligned in parallel planes in said three-dimensional array.
Claim 103
Dependent Claim
31 words
The invention of claim 84 wherein said means for writing to a memory media from said three-dimensional array moves sequentially through said two-dimensional data arrays with each serial multi-bit binary word.
References Cited (Backward Citations)
US3200374A
Cited
US4052698A
Cited
US4336612A
Cited
US4277844A
Cited
US4309721A
Cited
US4467373A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-01-13 | 1989-07-15 | 1990-01-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-01-13 | 1993-07-15 | 1994-01-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-01-13 | 1997-07-15 | 1998-01-14 | $7700.00 | Window Closed / Lapsed |