← Back to Patent Explorer
US5052001A Expired / Lapsed US ⏱️ 0.0 years remaining

Multiple memory bank parity checking system

Assignee: Unisys Corp
•
Filing: 1989-11-22
•
Granted: 1991-09-24
•
Expires: 2009-11-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A ROM/PROM memory system circuit structure provides for vertical expansion of data words while providing for enablement of parity checking by the addition of a single auxiliary ROM/PROM memory chip which duplicates the type and size of data memory chips. Additionally, selection means is provided to choose either an odd parity or an even parity format.

Inventors

  • 👤 James H. Jeppesen, III
  • 👤 Bruce E. Whittaker

Bibliographic Details

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

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 126 words
A memory structure comprising: (a) a plurality of ROM memory data chips storing data words and connected to a common address bus means where each memory chip is a type-duplicate of each other chip and each chip is connected to a common data output bus means; (b) a single auxiliary type-duplicate ROM memory parity chip holding a related predetermined parity bit for each data word in each said memory chip, said ROM memory parity chip holding multiple parity bits for multiple memory chips; (c) means for accessing a selected data word and its related parity bit for transmission to a parity check logic means; (d) said parity check logic means for determining the integrity of each data word accessed onto said common data output bus means.
Claim 2
Dependent Claim 126 words
A memory structure comprising: (a) a plurality of ROM memory data chips storing data words and connected to a common address bus means where each memory chip is a type-duplicate of each other chip and each chip is connected to a common data output bus means; (b) a single auxiliary type-duplicate ROM memory parity chip holding a related predetermined parity bit for each data word in each said memory chip, said ROM memory parity chip holding multiple parity bits for multiple memory chips; (c) means for accessing a selected data word and its related parity bit for transmission to a parity check logic means; (d) said parity check logic means for determining the integrity of each data word accessed onto said common data output bus means.
Claim 3
Dependent Claim 50 words
The ROM memory structure of claim 1 wherein each said memory data chip stores "N" data words of "n" bits and the entire ROM memory structure has N×k=T data words, where k is the number of data memory chips and N is the number of addressable locations in each chip.
Claim 4
Dependent Claim 31 words
The memory structure of claim 2 wherein said common output bus means provides "n" bit lines and carries data words of "n" bits accessed from an addressed ROM memory data chip.
Claim 5
Dependent Claim 20 words
The memory structure of claim 3 wherein said single auxiliary type-duplicate memory parity ROM chip stores N×n predetermined parity bits.
Claim 6
Dependent Claim 33 words
The memory structure of claim 4 wherein said means for accessing includes: (a) said common address bus means providing "A" bits of address for selecting a specific data word where A=log 2 N.
Claim 7
Dependent Claim 92 words
The structure of claim 5 wherein said means for accessing further includes: (b) "A S " most significant bits of said common address bus means for controlling the selected output of a multiplexer means, where A S =log 2 k bits and k is the number of said memory chips storing data words; (c) said multiplexer means connected to receive "n" parity bits from said single auxiliary memory parity ROM chip and for selecting the appropriately related parity bit for an accessed data word placed on said common data output bus means.
Claim 8
Dependent Claim 55 words
The structure of claim 6 wherein said parity check logic means includes: (a) means to calculate the parity bit value of an accessed data word on said common data output bus means; (b) means to compare said calculated parity bit value against said predetermined related parity bit to establish integrity of the data word accessed.
Claim 9
Dependent Claim 28 words
The structure of claim 6 which includes: (a) means for selecting an odd parity format or an even parity format for use in said parity check logic means.
Claim 10
Dependent Claim 69 words
The structure of claim 6 wherein the said selected related parity bit is transmitted to said parity check logic means; and wherein said parity check logic means includes: (a) parity generator means to calculate the parity value of an addressed data word; (b) adjustment means to adapt to an odd parity or even parity protocol; (c) comparison means to compare said selected parity bit to said calculated parity bit.
Claim 11
Dependent Claim 238 words
An in-depth memory structure of uniform type ROM memory chips comprising: (a) a plurality of "k" ROM memory data chips where each chip stores N data words of n bits each, and each chip provides accessed output data to an output-word bus means of n bits, and wherein each said ROM chips is a duplicate of the other in size and type; (b) a single auxiliary ROM memory parity chip, duplicating the same type and size with N data words of n bits each, for storing a predetermined parity bit for each data word in said memory structure, and providing "k" parity output lines to a parity bit selection means; (c) addressing means for addressing a specific data word in any one of said "k" ROM memory data chips and for enabling output of said specific data word onto said output word bus means; (d) said output-word bus means for transmitting accessed output data to a receiver and also to a parity checking logic means; (e) said parity bit selection means for selecting a predetermined parity bit associated with each addressed word and designated as the related parity bit, in said single auxiliary ROM memory parity chip, which relates to the accessed data word; (f) parity checking logic means for calculating the parity bit value of an addressed data word and comparing said related parity bit with the said calculated parity bit value of said accessed data word;
Claim 12
Dependent Claim 238 words
An in-depth memory structure of uniform type ROM memory chips comprising: (a) a plurality of "k" ROM memory data chips where each chip stores N data words of n bits each, and each chip provides accessed output data to an output-word bus means of n bits, and wherein each said ROM chips is a duplicate of the other in size and type; (b) a single auxiliary ROM memory parity chip, duplicating the same type and size with N data words of n bits each, for storing a predetermined parity bit for each data word in said memory structure, and providing "k" parity output lines to a parity bit selection means; (c) addressing means for addressing a specific data word in any one of said "k" ROM memory data chips and for enabling output of said specific data word onto said output word bus means; (d) said output-word bus means for transmitting accessed output data to a receiver and also to a parity checking logic means; (e) said parity bit selection means for selecting a predetermined parity bit associated with each addressed word and designated as the related parity bit, in said single auxiliary ROM memory parity chip, which relates to the accessed data word; (f) parity checking logic means for calculating the parity bit value of an addressed data word and comparing said related parity bit with the said calculated parity bit value of said accessed data word;
Claim 13
Dependent Claim 77 words
The memory structure of claim 10 wherein said addressing means includes: (a) address bus means having bit lines connected to each one of said "k" ROM memory data chips and to said single auxiliary ROM memory parity chip for addressing a specified memory location, and including: (a1) "A S " address bus bit lines for control of said parity bit selection means, where A S =log 2 k and k is an integer from "1" through "n".
Claim 14
Dependent Claim 70 words
The memory structure of claim 10 wherein said parity bit selection means includes: (a) multiplexer means for receiving "n" output parity bit lines from said single auxiliary ROM memory parity chip and selecting one parity bit line for output; (b) a set of "A S " address bus bit lines carrying bits of the specified address for controlling said multiplexer means to select and transmit the properly related parity bit.
Claim 15
Dependent Claim 61 words
The structure of claim 10 wherein said parity checking logic means includes: (a) means for receiving said accessed data word and calculating its parity value; (b) means for receiving said predetermined related parity bit for comparison with said calculated parity value; (c) means for transmitting an error signal if the said calculated parity bit and said predetermined parity bit are inconsistent.
Claim 16
Dependent Claim 34 words
The memory structure of claim 10 wherein said output word bus means provides the said accessed data word of n bits to a utilization receiver circuit and also to said parity checking logic means.
Claim 17
Dependent Claim 12 words
The memory structure of claim 10 where k equals 2 memory chips.
Claim 18
Dependent Claim 15 words
The memory structure of 15 where said output-word bus means carries 8 bits of information.
Claim 19
Dependent Claim 15 words
The memory structure of 15 where said output-word bus means carries 8 bits of information.
Claim 20
Dependent Claim 54 words
The memory structure of claim 15 wherein said parity bit selection means connects the address bit line carrying the said A S bit lines to each ROM memory chip and to a multiplexer means for enablement of each ROM memory chip and for controlling said multiplexer means to select the said related parity bit.
Claim 21
Dependent Claim 33 words
The memory structure of claim 10 wherein each ROM memory data chip and said single auxiliary ROM memory parity chip stores 2,048 data words of 8 bits each where N=2,048 and n=8 bits.
Claim 22
Dependent Claim 26 words
The memory structure of claim 10 wherein said parity checking logic means includes: (a) selection means for utilizing an odd parity or an even parity format.

References Cited (Backward Citations)

US4019033A Cited
US4355393A Cited
US4271521A Cited
US4295219A Cited
US4464755A Cited
US4809278A Cited
US4809279A Cited
US4800535A Cited
US4849978A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-09-23 1995-03-25 1995-09-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-09-23 1999-03-25 1999-09-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-09-23 2003-03-25 2003-09-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag