Patent US4617664A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4617664A Expired / Lapsed US ⏱️ 0.0 years remaining

Error correction for multiple bit output chips

Assignee: International Business Machines Corp
•
Filing: 1984-06-29
•
Granted: 1986-10-14
•
Expires: 2004-06-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An error correction code, especially suited for memory chips with multi-bit outputs, in which parity bits are calculated for each byte of the word and check bits are calculated for the word as a whole. In a 4-byte, 32-bit word, eight bits of error correction can correct up to four errors if the errors are restricted to corresponding bits in the 4 bytes.

Inventors

  • 👤 Frederick J. Aichelmann, Jr.
  • 👤 Lawrence K. Lange

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 10:17
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1012; G06F11/1028

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 229 words
A method of error correcting a data word consisting of a plurality of subwords, each subword consisting of a plurality of bits, comprising the steps of: computing a first set of parity bits, a parity bit being computed from each subword of an original data word; computing a first set of check bits from said original data word according to an error correction code; computing a second set of parity bits, a parity bit of said second set being computed from each subword of a data word derived from said original data word, said derived data word consisting of a plurality of subwords, each subword consisting of a plurality of bits; differencing the corresponding bits of said first and second sets of parity bits to produce a set of parity bit error signals, parity bit error signals not having a predetermined value indicating non-equality between said original data word and said derived data word; computing a second set of check bits from said derived data word according to said error correction code; differencing the corresponding bits of said first and second sets of check bits to produce a set of syndrome bits; and computing from said set of parity bit error signals and said set of syndrome bits according to said error correction code the bit locations in which said original data word differs from said derived data word.
Claim 2
Independent Claim 229 words
A method of error correcting a data word consisting of a plurality of subwords, each subword consisting of a plurality of bits, comprising the steps of: computing a first set of parity bits, a parity bit being computed from each subword of an original data word; computing a first set of check bits from said original data word according to an error correction code; computing a second set of parity bits, a parity bit of said second set being computed from each subword of a data word derived from said original data word, said derived data word consisting of a plurality of subwords, each subword consisting of a plurality of bits; differencing the corresponding bits of said first and second sets of parity bits to produce a set of parity bit error signals, parity bit error signals not having a predetermined value indicating non-equality between said original data word and said derived data word; computing a second set of check bits from said derived data word according to said error correction code; differencing the corresponding bits of said first and second sets of check bits to produce a set of syndrome bits; and computing from said set of parity bit error signals and said set of syndrome bits according to said error correction code the bit locations in which said original data word differs from said derived data word.
Claim 3
Dependent Claim 30 words
A method of error correcting as recited in claim 1, wherein each of said original and derived data words consists of four subwords and each subword consists of eight bits.
Claim 4
Dependent Claim 42 words
A method of error correcting as recited in claim 2, wherein the steps of computing a set of check bits from a word comprises a multiplication of a matrix with a vector of the bits of said word, said matrix being: ##EQU1##
Claim 5
Dependent Claim 76 words
A method of error correcting as recited in claim 1, wherein: each of said original and derived data words consists of a plurality of intermediate words, each intermediate word consisting of a plurality of subwords; and said steps of computing a set of check bits comprises: adding the corresponding bits of said intermediate words to form a first word; and computing said set of check bits from said first word according to said error correction code.
Claim 6
Dependent Claim 77 words
A method of error correcting as recited in claim 3, wherein: each of said original and derived data words consists of a plurality of intermediate words, each intermediate word consisting of a plurality of subwords; and said steps of computing a set of check bits each comprise: adding the corresponding bits of said intermediate words to form a first word; and computing said set of check bits from said first word according to said error correction code.
Claim 7
Dependent Claim 257 words
An error correcting memory system, comprising: a data bus for a data word, said data word consisting of a plurality of subwords; a first parity bus for a first set of plurality of parity bits associated with said data word, each parity bit associated with one of the subwords of said data word; a first check bus for a first set of a plurality of check bits associated with said data word; a memory array for storing said data word and said first sets of said parity bits and said check bits; a parity and checking circuit receiving said data word on said data bus and generating a second set of parity bits and a second set of check bits from said data words according to an error correction code, each of said parity bits recording the parity of a separate subword of said data word, said second set of parity bits being output on a second parity bus and said second set of check bits being output on a second check bus; means receiving said first and second parity busses and said first and second check buses for comparing values on the lines of said first parity bus and said first check bus with the values on the corresponding lines of said second parity bus and said second check bus, said comparing means outputting comparison signals; and means receiving said data word on said data bus and receiving said comparison signals for correcting said data word according to said error correction code and said comparison signals.
Claim 8
Dependent Claim 257 words
An error correcting memory system, comprising: a data bus for a data word, said data word consisting of a plurality of subwords; a first parity bus for a first set of plurality of parity bits associated with said data word, each parity bit associated with one of the subwords of said data word; a first check bus for a first set of a plurality of check bits associated with said data word; a memory array for storing said data word and said first sets of said parity bits and said check bits; a parity and checking circuit receiving said data word on said data bus and generating a second set of parity bits and a second set of check bits from said data words according to an error correction code, each of said parity bits recording the parity of a separate subword of said data word, said second set of parity bits being output on a second parity bus and said second set of check bits being output on a second check bus; means receiving said first and second parity busses and said first and second check buses for comparing values on the lines of said first parity bus and said first check bus with the values on the corresponding lines of said second parity bus and said second check bus, said comparing means outputting comparison signals; and means receiving said data word on said data bus and receiving said comparison signals for correcting said data word according to said error correction code and said comparison signals.
Claim 9
Dependent Claim 41 words
An error correcting memory system as recited in claim 6, wherein said memory array comprises a plurality of memory chips, each memory chip having a plurality of data outputs, each said output associated with a different subword of said data word.
Claim 10
Dependent Claim 34 words
An error correcting memory system as recited in claim 7, wherein said data word consists of four subwords and each subword consists of eight bits an each said memory chip includes four data outputs.
Claim 11
Dependent Claim 39 words
An error correcting memory system as recited in claim 8, wherein said memory array includes one memory chip for four bits associated with said data word and another memory chip for four check bits associated with said data word.
Claim 12
Dependent Claim 37 words
An error correcting memory system as recited in claim 9, wherein said parity and checking circuit produces said second sets of said parity and check bits according to an error correction code represented by the matrix: ##EQU2##
Claim 13
Dependent Claim 107 words
An error correcting system as recited in claim 6, in which said data word is a derived data word, further comprising: a parity and check bit generator for generating, according to said error correction code, said first set of parity bits and said first set of check bits from an original data word from which said derived data word is derived, said original data word consisting of the same number of subwords as said derived data word, said parity and check bit generator providing said first set of parity bits to said first parity bus and said first set of check bits to said first check bus.

References Cited (Backward Citations)

US4030067A Cited
US4168486A Cited
US4211997A Cited
US4317201A Cited
US4345328A Cited
US4353391A Cited
US4531213A Cited
US4488302A Cited
US4507783A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-10-13 1990-04-14 1990-10-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-10-13 1994-04-14 1994-10-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-10-13 1998-04-14 1998-10-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag