US5477553A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Compressed memory address parity checking apparatus and method
Assignee: Professional Computer Systems Inc
•
Filing: 1994-07-22
•
Granted: 1995-12-19
•
Expires: 2014-07-22
Abstract
Abstract A compressed memory address parity (CMAP) checking apparatus for checking the parity of data read from a data memory comprising a low capacity auxiliary memory with 2 N address spaces and an adaptive auxiliary memory addressing scheme to reduce the amount of memory required to perform parity checking. When data is stored in the data memory at an address MA having M bits, (M-N) bits of the data memory address together with one or more parity bits generated from the data stored in the data memory is stored in the auxiliary memory at an address given by the remaining N bits of the data memory address. When data is read from an address MA in the data memory, the (M-N) bits at the address N in the auxiliary memory is compared with the corresponding (M-N) bits in the data memory address. If there is a match, the one or more parity bits stored in the auxiliary memory are read. If there is no match, the one or more parity bits generated from the data read from the data memory are used and the data and one or more parity bits in the auxiliary memory are updated, the data comprising the most recently used M bits of the data memory address.
Inventors
- 👤 Edmund Y. Kong
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 15:02
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1044
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
320 words
For use in a digital apparatus having a data memory, means for storing data in the data memory at a data memory address and means for reading data from a data memory address in said data memory, each said data memory address having M bits, a parity checking apparatus comprising: an auxiliary memory having 2 N addresses; means for addressing the auxiliary memory with an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored; means for generating a parity bit for each predetermined set of data bits stored in the data memory; means for storing in said auxiliary memory at an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored the M-N most significant bits of the address in the data memory at which data is stored together with the parity bits generated when said data is stored in the data memory; means for comparing the M-N address bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the M-N most significant bits of the address in the data memory from which data is read; means responsive to the comparing means for providing the parity bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which the data is read if there is a match; means for generating a parity bit for each predetermined set of data bits read from the data memory; and means responsive to the comparing means for providing the parity bits generated for each predetermined set of data bits read from the data memory if there is no match.
Claim 2
Dependent Claim
320 words
For use in a digital apparatus having a data memory, means for storing data in the data memory at a data memory address and means for reading data from a data memory address in said data memory, each said data memory address having M bits, a parity checking apparatus comprising: an auxiliary memory having 2 N addresses; means for addressing the auxiliary memory with an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored; means for generating a parity bit for each predetermined set of data bits stored in the data memory; means for storing in said auxiliary memory at an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored the M-N most significant bits of the address in the data memory at which data is stored together with the parity bits generated when said data is stored in the data memory; means for comparing the M-N address bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the M-N most significant bits of the address in the data memory from which data is read; means responsive to the comparing means for providing the parity bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which the data is read if there is a match; means for generating a parity bit for each predetermined set of data bits read from the data memory; and means responsive to the comparing means for providing the parity bits generated for each predetermined set of data bits read from the data memory if there is no match.
Claim 3
Dependent Claim
90 words
A parity checking apparatus according to claim 1 comprising: means for storing in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory of the data most recently read from the data memory the M-N most significant bits of the address in the data memory of the data most recently read from the data memory together with the parity bits generated for each predetermined set of data bits most recently read from the data memory if there is no match.
Claim 4
Dependent Claim
20 words
A parity checking apparatus according to claim 1 wherein said parity checking apparatus is located on a data memory chip.
Claim 5
Dependent Claim
27 words
A parity checking apparatus according to claim 1 wherein said parity checking apparatus is located in a chip set separate and apart from a data memory module.
Claim 6
Dependent Claim
35 words
A parity checking apparatus according to claim 1 wherein said auxiliary memory comprises at least one of an SRAM, a DRAM, an EEPROM, a FLASH RAM and an array of flip-flops with a tristate output.
Claim 7
Dependent Claim
33 words
A parity checking apparatus according to claim 1 wherein said means for generating a parity bit comprises means for automatically generating either odd or even parity according to a previous captured parity format.
Claim 8
Dependent Claim
20 words
A parity checking apparatus according to claim 1 wherein said parity checking apparatus is located on a data memory module.
Claim 9
Dependent Claim
36 words
A parity checking apparatus according to claim 7 wherein said parity checking apparatus comprises one eight bit parity checking apparatus and said data memory module comprises a thirty pin, eight bit single or double-inline memory module.
Claim 10
Dependent Claim
36 words
A parity checking apparatus according to claim 7 wherein said parity checking apparatus comprises one thirty-two bit parity checking apparatus and said data memory module comprises a seventy-two pin, thirty-two bit single or double-inline memory module.
Claim 11
Dependent Claim
36 words
A parity checking apparatus according to claim 7 wherein said parity checking apparatus comprises two sixteen bit parity checking apparatuses and said data memory module comprises a seventy-two pin, thirty-two bit single or double-inline memory module.
Claim 12
Dependent Claim
36 words
A parity checking apparatus according to claim 7 wherein said parity checking apparatus comprises four eight bit parity checking apparatuses and said data memory module comprises a seventy-two pin, thirty-two bit single or double-inline memory module.
Claim 13
Dependent Claim
257 words
For use in a digital apparatus having a data memory, means for storing data in the data memory at a data memory address having M bits, and means for reading data from an address having M bits in the data memory, a method of checking parity comprising the steps of: generating a parity bit for each predetermined set of data bits stored in the data memory; storing in an auxiliary memory at an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored the M-N most significant bits of the address in the data memory at which data is stored together with the parity bits generated when said data is stored in the data memory; comparing the M-N address bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the M-N most significant bits of the address in the data memory from which data is read; providing the parity bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which the data is read if there is a match; generating a parity bit for each predetermined set of data bits read from the data memory; and providing the parity bits generated for each predetermined set of data bits read from the data memory if there is no match.
Claim 14
Dependent Claim
257 words
For use in a digital apparatus having a data memory, means for storing data in the data memory at a data memory address having M bits, and means for reading data from an address having M bits in the data memory, a method of checking parity comprising the steps of: generating a parity bit for each predetermined set of data bits stored in the data memory; storing in an auxiliary memory at an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored the M-N most significant bits of the address in the data memory at which data is stored together with the parity bits generated when said data is stored in the data memory; comparing the M-N address bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the M-N most significant bits of the address in the data memory from which data is read; providing the parity bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which the data is read if there is a match; generating a parity bit for each predetermined set of data bits read from the data memory; and providing the parity bits generated for each predetermined set of data bits read from the data memory if there is no match.
Claim 15
Dependent Claim
89 words
A method according to claim 12 comprising the steps of: storing in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory of the data most recently read from the data memory the M-N most significant bits of the address in the data memory of the data most recently read from the data memory together with the parity bits generated for each predetermined set of data bits most recently read from the data memory if there is no match.
Claim 16
Independent Claim
238 words
A method of checking the parity of data stored in and read from an address having M bits in a data memory comprising the steps of: storing in an auxiliary memory a predetermined number M-N of the most significant bits of the data memory address at which data is stored in the data memory together with one or more parity bits which are generated when the data is stored in the data memory at said data memory address at an address in the auxiliary memory defined by the N least significant bits of said data memory address; reading the contents stored at the address in the auxiliary memory defined by the N least significant bits of a data memory address from which data is being read from said data memory, said contents comprising the M-N most significant bits of a data memory address and one or more parity bits; comparing the M-N most significant bits of the data memory address read from the auxiliary memory with the M-N most significant bits of the data memory address of data being read from the data memory; providing the one or more parity bits stored with the M-N most significant bits of the data memory address being read from the auxiliary memory if there is a match; and providing one or more parity bits which are generated when the data is read from the data memory if there is no match.
Claim 17
Independent Claim
238 words
A method of checking the parity of data stored in and read from an address having M bits in a data memory comprising the steps of: storing in an auxiliary memory a predetermined number M-N of the most significant bits of the data memory address at which data is stored in the data memory together with one or more parity bits which are generated when the data is stored in the data memory at said data memory address at an address in the auxiliary memory defined by the N least significant bits of said data memory address; reading the contents stored at the address in the auxiliary memory defined by the N least significant bits of a data memory address from which data is being read from said data memory, said contents comprising the M-N most significant bits of a data memory address and one or more parity bits; comparing the M-N most significant bits of the data memory address read from the auxiliary memory with the M-N most significant bits of the data memory address of data being read from the data memory; providing the one or more parity bits stored with the M-N most significant bits of the data memory address being read from the auxiliary memory if there is a match; and providing one or more parity bits which are generated when the data is read from the data memory if there is no match.
Claim 18
Dependent Claim
62 words
A method according to claim 14 comprising the step of storing in the auxiliary memory at the address defined by the N least significant bits of the most recently read data memory address for which a mismatch occurred the M-N most significant bits of the data memory address for which the mismatch occurred and the parity bit for the date stored thereat.
Claim 19
Dependent Claim
302 words
For use in a digital apparatus having a data memory, means for storing data in the data memory at a data memory address having M bits, and means for reading data from an address having M bits in the data memory, a parity checking apparatus comprising: means for generating a parity bit for each predetermined set of data bits stored in the data memory; means for storing in an auxiliary memory at an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored the M-N most significant bits of the address in the data memory at which data is stored together with the parity bits generated when said data is stored in the data memory; first means for comparing the M-N address bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the M-N most significant bits of the address in the data memory from which data is read; means for disabling the output of the parity checking apparatus an internal parity interrupt signal if the output of said first comparing means indicates that there is no match; means for generating a parity bit for each predetermined set of data bits read from the data memory; second means for comparing the parity bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the parity bits generated when the data is read from the data memory; and means for generating an internal parity interrupt signal if the output of said second comparing means indicates that there is no match.
Claim 20
Dependent Claim
302 words
For use in a digital apparatus having a data memory, means for storing data in the data memory at a data memory address having M bits, and means for reading data from an address having M bits in the data memory, a parity checking apparatus comprising: means for generating a parity bit for each predetermined set of data bits stored in the data memory; means for storing in an auxiliary memory at an address defined by a predetermined number N of the least significant bits of the M bit address in the data memory at which data is stored the M-N most significant bits of the address in the data memory at which data is stored together with the parity bits generated when said data is stored in the data memory; first means for comparing the M-N address bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the M-N most significant bits of the address in the data memory from which data is read; means for disabling the output of the parity checking apparatus an internal parity interrupt signal if the output of said first comparing means indicates that there is no match; means for generating a parity bit for each predetermined set of data bits read from the data memory; second means for comparing the parity bits stored in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory from which data is read with the parity bits generated when the data is read from the data memory; and means for generating an internal parity interrupt signal if the output of said second comparing means indicates that there is no match.
Claim 21
Dependent Claim
88 words
An apparatus according to claim 16 comprising: means for storing in the auxiliary memory at the address defined by the N least significant bits of the address in the data memory of the data most recently read from the data memory the M-N most significant bits of the address in the data memory of the data most recently read from the data memory together with the parity bits generated for each predetermined set of data bits most recently read from the data memory if there is no match.
References Cited (Backward Citations)
US3789204A
Cited
US3963908A
Cited
US4483003A
Cited
US4959835A
Cited
US5345582A
Cited
US5367526A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-12-18 | 1999-06-19 | 1999-12-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-12-18 | 2003-06-19 | 2003-12-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-12-18 | 2007-06-19 | 2007-12-19 | $7700.00 | Window Closed / Lapsed |