Patent US2795736A successfully refreshed from Google Patents.
US3585378A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Error detection scheme for memories
Assignee: International Business Machines Corp
•
Filing: 1969-06-30
•
Granted: 1971-06-15
•
Expires: 1989-06-30
Abstract
Abstract A method and apparatus for detecting errors occurring as a result of faulty memory operation. By storing every data word in an addressable memory at an address therein having a parity with a fixed predetermined relationship to the parity of the said data word, errors occurring in the memory may be detected. By incorporating an extra bit in the memory word, the error can be isolated and by incorporating two extra bits, double word readout errors may be detected.
Inventors
- 👤 Willard G Bouricius
- 👤 Keith A Duke
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 17:41
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1012; G06F11/1016; G06F11/1032
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
136 words
A method for detecting errors in a conventional 3-dimensional memory system including a memory address register, decoding and addressing circuitry, which cause a single fixed word to be read from memory, a memory storage area per se, sensing circuitry and a data register connected to the output thereof, said method comprising the steps of storing all data words in said memory at an address therein such that the parity of said address bears a fixed predetermined relationship to the parity of said data word, checking the parities of a memory address and the resultant data word read out of the memory and stored in the data register subsequent to a readout operation, comparing the parities to determine if the fixed predetermined parity relationship exists and producing an error signal if said parity relationship does not exist.
Claim 2
Independent Claim
136 words
A method for detecting errors in a conventional 3-dimensional memory system including a memory address register, decoding and addressing circuitry, which cause a single fixed word to be read from memory, a memory storage area per se, sensing circuitry and a data register connected to the output thereof, said method comprising the steps of storing all data words in said memory at an address therein such that the parity of said address bears a fixed predetermined relationship to the parity of said data word, checking the parities of a memory address and the resultant data word read out of the memory and stored in the data register subsequent to a readout operation, comparing the parities to determine if the fixed predetermined parity relationship exists and producing an error signal if said parity relationship does not exist.
Claim 3
Dependent Claim
53 words
A method as set forth in claim 1 wherein the address parity is determined by generating the parity of the actual address stored in the memory address register and determining the parity of the data word read out by generating the parity of the data word actually stored in the system data register.
Claim 4
Dependent Claim
89 words
A method as set forth in claim 2 wherein the parities of the address and data word are chosen to be equal and including the step of providing an extra check bit to be included with each data word in memory indicating the nature of the parity equality, and checking the contents of the check bit after each readout against the parities of said address and data word to ascertain whether an error that is present exists in the addressing circuitry or in the memory and data register circuitry.
Claim 5
Dependent Claim
67 words
A method as set forth in claim 3 including the additional step of providing a second check bit which is the complement of the first said check bit and the additional step of checking the two said check bits after each readout cycle to determine if they are equal and providing a system signal that a double word readout has occurred if both check bits are equal.
Claim 6
Dependent Claim
157 words
A memory system including an error detection mechanism; said memory system including an address register, decoding and addressing circuitry which cause a single fixed word to be read from the memory, a memory per se, sensing circuitry and a data register for said memory connected to the output of said sensing circuitry and in which memory data words are stored at predetermined addresses in said memory so that the parity of the data word bears a fixed predetermined relationship to the parity of the address of said word, means operable after a read cycle in the memory to determine the parity of the data currently stored in the data register, means concurrently operative with the previous means to determine the parity of the address currently in the address register, means to compare the two parties, and means operative to produce an ''''error'''' signal if the two parities do not have said fixed predetermined relationship to each other.
Claim 7
Dependent Claim
157 words
A memory system including an error detection mechanism; said memory system including an address register, decoding and addressing circuitry which cause a single fixed word to be read from the memory, a memory per se, sensing circuitry and a data register for said memory connected to the output of said sensing circuitry and in which memory data words are stored at predetermined addresses in said memory so that the parity of the data word bears a fixed predetermined relationship to the parity of the address of said word, means operable after a read cycle in the memory to determine the parity of the data currently stored in the data register, means concurrently operative with the previous means to determine the parity of the address currently in the address register, means to compare the two parties, and means operative to produce an ''''error'''' signal if the two parities do not have said fixed predetermined relationship to each other.
Claim 8
Dependent Claim
39 words
A memory system as set forth in claim 5 wherein the parties of the data words and addresses thereof are equal and wherein said last-named means includes means to produce an error signal whenever a parity inequality is detected.
Claim 9
Dependent Claim
51 words
A memory system as set forth in claim 6 wherein an additional check bit is included with each data word in memory, said check bit indicating whether the fixed predetermined relationship of parities is odd or even and means for comparing the two said parities with said check bit for correspondence.
Claim 10
Dependent Claim
78 words
A memory system as set forth in claim 7 wherein a second check bit is included in each data word and wherein the binary value stored in said second check bit is always the complement of the binary value stored in said first check bit and including means to compare the two check bits subsequent to a readout cycle and means to indicate a double word readout error whenever both of said check bits are a binary one.
Claim 11
Dependent Claim
34 words
A memory system as set forth in claim 6 wherein the two parity determining means are parity generators producing a predetermined binary value depending on whether or not odd or even parity is detected.
Claim 12
Dependent Claim
31 words
A memory system as set forth in claim 9 wherein said memory comprises a control memory for storing lists of computer instructions and wherein the data stored therein is essentially fixed.
Claim 13
Dependent Claim
17 words
A memory system as set forth in claim 10 wherein said memory is a read only store.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-06-14 | 1974-12-14 | 1975-06-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-06-14 | 1978-12-14 | 1979-06-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-06-14 | 1982-12-14 | 1983-06-15 | $7700.00 | Window Closed / Lapsed |