Patent US355343A successfully refreshed from Google Patents.
Patent US3492018A successfully refreshed from Google Patents.
Patent US563246A successfully refreshed from Google Patents.
Patent EP0052216A2 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0052216A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Data storage systems

Assignee: International Business Machines Corp
•
Filing: 1981-10-05
•
Granted: —
•
Expires: 2001-10-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a data storage system in which data words, including word check bytes and periodic block check bytes, are stored in failure independent modules, an improved ECC mechanism is incorporated which corrects words as they are accessed assuming random errors and logs the corrections. When a block check byte becomes available, the logged errors are sum compared with the block check byte to validate the random error assumption else to attempt correction assuming one failed unit, restoring the previous "corrections" if the second assumption proves correct. For little extra redundancy, two correction modes can be attempted and miscorrections at least indicated.

Inventors

  • 👤 Arvind Motibhai Patel

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-03 20:53
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1012; G06F11/1028

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 436 words
A data storage system in which fixed length data words, having M-l data byte positions and one word check byte position a "write" block check byte being included periodically, are accessed as such from plural failure independent storage units, (11-0, to 11-14) one byte per unit and including a dual function ECC system for either correcting from a single syndrome byte random 1-bit errors in a data word or multi-bit errors in the same byte position of successive data words, and where each syndrome byte is developed from a write check byte and a read check byte where each bit position of the check bytes represents the modulo-2 sum of the value of data in bit positions defined by ones association in n rows of a arity check matrix H' derived from a parity check matrix H, which itself corresponds to an m-sequence of length 2-1, where b is equal to the number of bit positions in each said byte, by selecting therefrom M|b x b| non-overlapping submatrices spaced apart by (X-b) columns, where λ is greater than b, the ECC system including means (25) for generating a syndrome byte for each word, a comparator (80), a syndrome processing circuit (30) operable to process a non-zero syndrome byte to provide a sequence of different b bit vectors, positionally related-in the m-sequence to the syndrome byte by a factor Kλ where K is the position number in said sequence, means (28) for transferring each non-zero syndrome byte to the processing circuit, and means (39) responsive to the output of the processing circuit to indicate the byte location and error pattern assuming a random single-bit error in the data word producing the processed syndrome and for correcting such error in response thereto, characterised in that there are included (1) means (35) for logging, for the words of a block, the indicated byte location, the single-bit error pattern, and the non-zero syndrome byte for each processed word where a correction was made; (2) means (19) for generating a block syndrome byte which should be related by a linear function to the sum of all errors which occurred in the data byte positions of the processed words, of a block; (3) summing means (in 30) to provide a summed error pattern byte from all the logged single-bit error patterns; said comparator being operable at the end of each block of words for comparing the block syndrome byte with the summed error pattern byte to confirm (or deny) the validity of each single-bit error pattern correction, and (4) the block check bytes are stored as data bytes within the corresponding blocks.
Claim 2
Dependent Claim 436 words
A data storage system in which fixed length data words, having M-l data byte positions and one word check byte position a "write" block check byte being included periodically, are accessed as such from plural failure independent storage units, (11-0, to 11-14) one byte per unit and including a dual function ECC system for either correcting from a single syndrome byte random 1-bit errors in a data word or multi-bit errors in the same byte position of successive data words, and where each syndrome byte is developed from a write check byte and a read check byte where each bit position of the check bytes represents the modulo-2 sum of the value of data in bit positions defined by ones association in n rows of a arity check matrix H' derived from a parity check matrix H, which itself corresponds to an m-sequence of length 2-1, where b is equal to the number of bit positions in each said byte, by selecting therefrom M|b x b| non-overlapping submatrices spaced apart by (X-b) columns, where λ is greater than b, the ECC system including means (25) for generating a syndrome byte for each word, a comparator (80), a syndrome processing circuit (30) operable to process a non-zero syndrome byte to provide a sequence of different b bit vectors, positionally related-in the m-sequence to the syndrome byte by a factor Kλ where K is the position number in said sequence, means (28) for transferring each non-zero syndrome byte to the processing circuit, and means (39) responsive to the output of the processing circuit to indicate the byte location and error pattern assuming a random single-bit error in the data word producing the processed syndrome and for correcting such error in response thereto, characterised in that there are included (1) means (35) for logging, for the words of a block, the indicated byte location, the single-bit error pattern, and the non-zero syndrome byte for each processed word where a correction was made; (2) means (19) for generating a block syndrome byte which should be related by a linear function to the sum of all errors which occurred in the data byte positions of the processed words, of a block; (3) summing means (in 30) to provide a summed error pattern byte from all the logged single-bit error patterns; said comparator being operable at the end of each block of words for comparing the block syndrome byte with the summed error pattern byte to confirm (or deny) the validity of each single-bit error pattern correction, and (4) the block check bytes are stored as data bytes within the corresponding blocks.
Claim 3
Dependent Claim 62 words
A system as claimed in claim 1 in which the processing circuit provides a first signal indicating that an input syndrome byte does not represent a single random 1-bit error, means being provided responsive to such first signal for logging the corresponding word number, syndrome byte, and an indication that the word contains an error that is not a random single-bit error.
Claim 4
Dependent Claim 180 words
A system as claimed in claim 2 which, in the event of denial of validity of single bit error correction, actuates means for selectively providing to the processing circuit the modulo-2 sum of the non-zero syndrome bytes for all words of a block, means for selectively providing to the comparator the corresponding block syndrome byte, means, including the comparator, for generating a signal K' indicating the position of the block syndrome byte in the sequence of b bit vectors provided by processing the summed syndrome byte in the processing circuit, deemed indicative of a failed unit, means for transferring from the error log to the processing circuit a non-zero syndrome byte for each logged word and means for transferring from the output of the processing circuit one b bit vectors selected from the sequence generated from the non-zero syndrome byte in accordance with the alue of signal K' as the error pattern required to correct the error in the byte position related to the deemed failed unit in the associated word such error pattern being transferred to the error log.
Claim 5
Dependent Claim 39 words
A system as claimed in claim 3 which includes means for reprocessing each word having an error to reverse any previous correction made in accordance with the syndrome byte and correct an error existing in the defective byte position.
Claim 6
Dependent Claim 29 words
A system as claimed in claim 4 in which λ is equal to 2 b -1/2 c -1 for some integer c to provide a double error detection capability.
Claim 7
Independent Claim 72 words
A system as claimed in any of claims 1 to 4 in which X is 17, the m-sequence is generated from any primative polynomial of degree b, each block comprises a plurality N of data words, each of which includes 15 byte positions, all the words including check bytes and the Nth word including the block parity byte position N being selected in accordance with the error characteristics of the memory system.
Claim 8
Independent Claim 26 words
A system as claimed in any claim in which each failure independent storage units comprises a bubble memory module, each of which has b bubble chips.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag