← Back to Patent Explorer
EP0506474A1 Expired / Lapsed EP ⏱️ 0.0 years remaining

Parity detect circuit for memory including dual validity indication

Assignee: STMicroelectronics lnc USA
•
Filing: 1992-03-27
•
Granted: —
•
Expires: 2012-03-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A memory which is cleared by simultaneously clearing a special bit in each entry within the memory, an extra bit, used for other purposes, is also cleared. When both bits have a value of 0, parity checking is disabled. When either bit has a value of 1, parity checking is enabled. This prevents incorrect detection of parity errors after the memory device has been cleared.

Inventors

  • 👤 Bahador Rastegar

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-30 10:16
CPC Classifications
G; G11; G11C; G11C29/00; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1064; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0806; G06F12/0815; G06F12/0831

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 92 words
A parity checking circuit for a memory having first and second fields indicating whether a location in the memory is valid, comprising: a parity detecting circuit for generating a signal indicative of whether a entry read from a memory location has valid parity; and an enable circuit for enabling an output of said parity detecting circuit, said enable circuit having two inputs indicating the values of the first and second fields, said enable circuit operating to disable the parity detecting circuit output when the first and second fields have a preselected value.
Claim 2
Dependent Claim 17 words
A parity checking circuit of claim 1, which is adapted for use with a cache tag memory.
Claim 3
Dependent Claim 25 words
The parity checking circuit of Claim 2, wherein the first and second fields comprise a valid bit field and a snoop valid bit field, respectively.
Claim 4
Dependent Claim 74 words
The parity checking circuit of Claim 1, wherein the memory is a dual port memory, with each of a first and second port able to read entries in the memory simultaneously, wherein said parity detecting circuit and said enable circuit are connected to the first port, and further comprising: a second parity detecting circuit connected to the second port; and a second enable circuit for enabling the output of said second parity detecting circuit.
Claim 5
Dependent Claim 42 words
The parity checking circuit of Claim 1, wherein said parity detecting circuit includes an output buffer, and wherein said enable circuit forces an output of the output buffer to a selected value when the first and second fields have the selected value.
Claim 6
Dependent Claim 22 words
The parity checking circuit of Claim 5, wherein the selected buffer output value is a value which indicates that parity is valid.
Claim 7
Dependent Claim 63 words
The parity checking circuit of Claim 5, wherein the output buffer is a logic gate, and the output of said enable circuit is connected as an input to such logic gate, wherein the output of the logic gate is forced to a known value if the enable circuit output indicates a disable signal, and reflects the output of said parity detecting circuit otherwise.
Claim 8
Dependent Claim 133 words
A cache tag memory, comprising: a memory array having a plurality of addressable entries, and further having, for each entry, a parity bit and first and second valid bits indicating whether the entry is valid; a first input/output port connected to said memory array; a second input/output port connected to said memory array; a parity generating circuit for generating a parity bit indicating parity for a data value stored into a memory array entry, and for storing such parity bit into the array; first and second parity detect circuits connected to said memory array and associated with said first and second input/output ports, respectively; and means connected to said first and second parity detect circuits for disabling them when the first and second valid bits for an entry are in a preselected state.
Claim 9
Dependent Claim 47 words
The cache tag memory of Claim 8, wherein data entries to said memory array can be written only through said second input/output port, and wherein said second input/output port can only change the values of the parity bit and one of the valid bits for an entry.
Claim 10
Dependent Claim 29 words
The cache tag memory of Claim 9, wherein said parity generating circuit generates a parity bit only for data written into said memory array for said first input/output port.
Claim 11
Dependent Claim 50 words
The cache tag memory of Claim 8, wherein said means for disabling comprises: a logic circuit connected to an output buffer for said parity detecting circuit, for forcing such output buffer to a preselected state when the first and second valid bits for an entry are in the preselected state.
Claim 12
Dependent Claim 27 words
The cache tag memory of Claim 11. wherein the preselected state comprises a state in which both valid bits indicate a memory array entry to be invalid.
Claim 13
Dependent Claim 24 words
The cache tag memory of Claim 12, wherein the preselected state comprises a state in which both valid bits have a value of zero.
Claim 14
Dependent Claim 39 words
The cache tag memory of Claim 11, wherein the output buffer is a logic gate having one input connected to the output of said logic circuit, and a second input connected to the output of said parity detecting circuit.
Claim 15
Dependent Claim 26 words
The cache tag memory of Claim 8, wherein said memory array is cleared by setting only the valid bits for each entry to indicate invalid entries.
Claim 16
Independent Claim 86 words
A method for checking parity in a memory device having a plurality of addressable entries, comprising the steps of: storing a parity bit in a memory array along with data written to an entry; storing first and second valid bit data for each data entry in the memory array; when an entry in the memory array is read, generating a signal indicating whether parity for that entry is valid; and disabling the generated signal when the first and second valid bits are in a preselected state.
Claim 17
Dependent Claim 22 words
The method of Claim 16, wherein the preselected state is one in which both valid bits indicate that an entry is invalid.
Claim 18
Dependent Claim 30 words
The method of Claim 16, wherein said disabling step comprises the step of: forcing the parity signal to a selected state when both valid bits are in the preselected state.
Claim 19
Dependent Claim 14 words
The method of Claim 18, wherein the selected state indicates that parity is valid.
Claim 20
Dependent Claim 33 words
The method of Claim 16, wherein the memory array is cleared by setting only the first and second valid bits for all memory entries to a state indicating that the entries are invalid.

References Cited (Backward Citations)

US4528666A Cited
DE3433679A1 Cited

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