Patent US2648151A successfully refreshed from Google Patents.
EP0129324A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Error-correction code for digital data on video discs
Assignee: REFERENCE Tech Inc
•
Filing: 1984-05-15
•
Granted: —
•
Expires: 2004-05-15
Abstract
Abstract Data for recordation on a video disc is given multi- redundancy at block, field and group levels. Data and error-correction redundancy is preferably written in a format of 32 rows by 32 columns (32x32) of 8-bit words. Raw data is filled typically serially row by indexed row to a 30x30 interval 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. The data fill rows and columns zero through 29 and the error-correction redundancy filling rows and columns 30 through 31. 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 (1686 tracks between fields). Recording occurs via an optical master disc. Stamped replications (video discs) are made from the master disc. Two fields occupy a 360-degree revolution (track) of the stamped video discs with 54.000 tracks on a disc side. Thus approximately 3 gigabytes are placed on a single disc side When data is read from the video disc disinterleaving occurs enroute to a field formatted RAM memory. The particular block having the desired information is identified and error-correction decoding of the desired block first occurs with generation of the Reed/Solomon syndromesfor all rows and columns. Nonzero syndromes indicate error. Starting with the dimension (row or column) having the most nonzero syndrome values, column and row or alternatively row and column Reed/Solomon error detection and correction algorithms are employed interactively up to three times. Upon all zero check syndromes being encountered, either before or after the Reed/Solomon iterations, auxiliary check syndromes derived from the corrected block data are examined for a zero value, which if achieved renders the block immediately available without processing adjacent blocks. Upon either the Reed/Solomon iterations to the third level occurring with nonzero syndromes still remaining (uncorrectable error) or remaining errors detected by the auxiliary check syndromes (indicating miscorrection), the Reed/Solomon algorithm is applied from the field or z-axis dimension. One or two entire blocks can be corrected by this step. If more than two blocks are not capable of regeneration, all fields of a group (spaced every 843rd track on the optical disc), save the field containing error are block level processed, field level processed and XORd to a field sized RAM to regenerate the defective field.
Inventors
- 👤 Neal Glover
- 👤 Kermit Clausen
- 👤 Chris Mayne
- 👤 Randy Glissmann
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-01 11:29
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: 66
Claim 1
Independent Claim
166 words
A two-dimensional data array having error-correction code therein, said data array comprising data intervals of multi-hit 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 field; said two-dimensional data array including at least first and second row correction 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 ana/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
166 words
A two-dimensional data array having error-correction code therein, said data array comprising data intervals of multi-hit 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 field; said two-dimensional data array including at least first and second row correction 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 ana/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
17 words
The invention of claim 1 and wherein said column-correcting rows and said row-correcting columns contain Reed/Solomon code.
Claim 4
Dependent Claim
30 words
3 . The invention of claim 1 and wherein said column correcting rows and said row correcting columns extend at respective identical column and rcw addresses linearly across said array.
Claim 5
Dependent Claim
26 words
4 . The invention of claim 1 and wherei- said data array includes within said field three auxiliary check bytes therein computed across the data field.
Claim 6
Dependent Claim
21 words
The invention of claim 1 wherein said two-dimensional array is combined with other correspondent two-dimensional arrays to form a three-dimensional array.
Claim 7
Dependent Claim
22 words
The invention of claim 1 and wherein said row correcting columns and said column correcting rows can regenerate said auxiliary check bytes.
Claim 8
Dependent Claim
78 words
A process for generating a two-dimensional array comprising the steps of: placing serially multi-bit binary 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 of said 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
78 words
A process for generating a two-dimensional array comprising the steps of: placing serially multi-bit binary 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 of said 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
29 words
8 . 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
128 words
A three-dimensional data array for receiving 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 13
Dependent Claim
128 words
A three-dimensional data array for receiving 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 14
Dependent Claim
17 words
The invention of claim 10 and wherein said column-correcting rows and said row-correcting columns contain Reed/Solomon code.
Claim 15
Dependent Claim
24 words
The invention of claim 10 and wherein said successive two-dimensional data arrays of said three-dimensional data array include first and second two-dimensional redundant arrays.
Claim 16
Dependent Claim
21 words
The invention of claim 10 and wherein said correction vectors are orthogonal to one another along first, second and third directions.
Claim 17
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 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
44 words
. 15. The process of claim 14 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 20
Dependent Claim
33 words
The invention of claim 14 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 21
Dependent Claim
17 words
The invention of claim 14 and wherein said generating steps include the step of generating Reed/Solomon code.
Claim 22
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 23
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 24
Dependent Claim
17 words
The invention of claim 18 and wherein said row-correcting columns and said column-correcting rows include Reed/Solomon code.
Claim 25
Dependent Claim
50 words
20 . The invention of claim 18 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 26
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 forth 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 27
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 forth 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 28
Dependent Claim
20 words
The invention of claim 21 and wherein said two-dimensional redundant arrays are aligned in parallel planes in said three-dimensional array.
Claim 29
Dependent Claim
30 words
The invention of claim 21 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 30
Dependent Claim
31 words
The invention of claim 21 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 31
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 field 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 field including said auxiliary check bytes syndromes to flag the presence of error.
Claim 32
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 field 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 field including said auxiliary check bytes syndromes to flag the presence of error.
Claim 33
Dependent Claim
41 words
The invention of claim 25 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 34
Dependent Claim
25 words
The invention of claim 2 5 and including the step of utilizing Reed/Solomon cede to locate error and correct error along said rows and columns.
Claim 35
Dependent Claim
15 words
The invention of claim 27 and including the steps of iterating row and column correction.
Claim 36
Dependent Claim
28 words
The invention of claim 25 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 37
Dependent Claim
16 words
The invention of claim 28 and wherein said iterating extends to three row and column iterations.
Claim 38
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 39
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 40
Dependent Claim
19 words
The invention of claim 31 and wherein said generating step further includes locating said error and correcting said error.
Claim 41
Dependent Claim
25 words
The invention of claim 31 and including the step of applying error correction on less than all of said two-dimensional arrays of said three-dimensional array.
Claim 42
Dependent Claim
27 words
The invention of claim 31 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 43
Dependent Claim
22 words
The invention of claim 31 and wherein said generating of syndromes across said two-dimensional array includes all of said two-dimensional data arrays.
Claim 44
Dependent Claim
49 words
The invention of claim 31 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 45
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 forth 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 46
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 forth 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 47
Dependent Claim
16 words
The invention of claim 37 and wherein said computing step includes the step of exclusively ORing.
Claim 48
Dependent Claim
47 words
The invention of claim 31 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 syndrcmes of said two-dimensional array.
Claim 49
Dependent Claim
19 words
The invention of claim 38 and wherein said exclusive ORing step occurs during said writing to a memory media.
Claim 50
Dependent Claim
14 words
The invention of claim 37 and wherein said memory media includes a video format.
Claim 51
Dependent Claim
60 words
A three-dimensional data array for receiving an error-correcting protocol, said array including: multi-bit binary words, each of said words being written at the intersection of first, second and third planes; and each of said words having first, second and third error-correction computations independently addressable whereby any data point within said three-dimensional array is addressable by first, second and third error-corrections.
Claim 52
Dependent Claim
60 words
A three-dimensional data array for receiving an error-correcting protocol, said array including: multi-bit binary words, each of said words being written at the intersection of first, second and third planes; and each of said words having first, second and third error-correction computations independently addressable whereby any data point within said three-dimensional array is addressable by first, second and third error-corrections.
Claim 53
Dependent Claim
198 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-correcting 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 54
Dependent Claim
198 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-correcting 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 55
Dependent Claim
62 words
The error-correction protocol of claim 43 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 56
Dependent Claim
88 words
The error-correction protocol of claim 4 3 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 57
Dependent Claim
29 words
The error-correction protocol of claim 45 and wherein said repeating said step generating an auxiliary check syndrome includes updating said auxiliary check syndrome as column and row corrections occur.
Claim 58
Dependent Claim
25 words
The error-correction protocol of claim 43 including performing iterations of said decoding for the located data array only until the number of iterations reaches three.
Claim 59
Dependent Claim
57 words
The error-correction protocol of claim 47 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 60
Dependent Claim
104 words
The error-correction protocol of claim 48 including the steps of: if the step of generating an auxiliary check syndrome of claim 48 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-dimen- s ional 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 61
Dependent Claim
146 words
The error-correction protocol of claim 49 and including the steps of: if the step of generating an auxiliary check syndrome of claim 49 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 62
Dependent Claim
60 words
The error-correction protocol of claim .50 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 63
Dependent Claim
31 words
5 2 . The error-correction protocol of claim 5 1 and wherein only one two-dimensional array has auxiliary check syndrome with value indicating error and a single-erasure error correction is performed.
Claim 64
Dependent Claim
26 words
The error-correction protocol of claim 51 and wherein two two-dimensional arrays have auxiliary check syndromes with value indicating error and a double-erasure error correction is performed.
Claim 65
Dependent Claim
64 words
The error-correction protocol of claim 51 and including if said auxiliary check syndrome generated in claim 51 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 43.
Claim 66
Dependent Claim
33 words
The error-correction protocol of claim 51 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.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.