Patent US1116264A successfully refreshed from Google Patents.
Patent US5412671A successfully refreshed from Google Patents.
US5412671A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data protection and error correction, particularly for general register sets
Assignee: Unisys Corp
•
Filing: 1993-03-25
•
Granted: 1995-05-02
•
Expires: 2013-03-25
Abstract
Abstract A data protection and correction scheme is implemented by providing main and shadow stores for groups of data bits from a segmented data word. The data bits are divided into even and odd address groups for storage into even and odd storage sections. Each group of 3 bits from a 36-bit data word is supplied in uncomplemented form to even and odd address main stores and in a complemented form to even and odd address shadow stores. By storing the complemented parity bit with the uncomplemented data and the uncomplemented parity bit with the complemented data, the odd parity of the input data is converted to an even parity which may be checked upon read-out from the main store. If this parity test fails, the shadow store is accessed to supply the correct data. When a write address and a read address attempt to access the same storage address a conflict is detected and input data and parity are directly supplied to an output multiplexor. In the preferred embodiment the data is supplied to the general register set of the receiving processor.
Inventors
- 👤 Kenichi Tsuchiya
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 02:41
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/88; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G11C29/74
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
296 words
A data protection and correction means for a first store means, wherein said first store means is coupled to receive input data bits from a source that also supplies input parity bits, comprising, second store means, first complementing means that receives said input data bits and produces complemented input data bits, second complementing means that receives said input parity bits and produces complemented parity bits, first combining means for combining said complemented input data bits with said input parity bits to form a first combined bit set, second combining means for combining said input data bits with said complemented parity bits to form a second combined bit set, write means for writing said first combined bit set into one of said first and second store means and said second combined bit set into the other of said first and second store means, read means for reading from said first store means the one of said first or said second combined bit sets which is stored in said first store means, parity checking means coupled to said read means for receiving said combined bit set which is read from first store means which is constructed to attempt to verify the parity thereof, output means coupled to said first and second store means and to said parity checking means for outputting said combined bit set which is stored in said first store means if said parity checking means verifies that the parity of said combined bit set which was stored in said first store means is correct, and for outputting said combined bit set which is stored in said second store means if said parity checking means fails to verify that the parity of said combined bit set which was stored in said first store means was correct.
Claim 2
Dependent Claim
296 words
A data protection and correction means for a first store means, wherein said first store means is coupled to receive input data bits from a source that also supplies input parity bits, comprising, second store means, first complementing means that receives said input data bits and produces complemented input data bits, second complementing means that receives said input parity bits and produces complemented parity bits, first combining means for combining said complemented input data bits with said input parity bits to form a first combined bit set, second combining means for combining said input data bits with said complemented parity bits to form a second combined bit set, write means for writing said first combined bit set into one of said first and second store means and said second combined bit set into the other of said first and second store means, read means for reading from said first store means the one of said first or said second combined bit sets which is stored in said first store means, parity checking means coupled to said read means for receiving said combined bit set which is read from first store means which is constructed to attempt to verify the parity thereof, output means coupled to said first and second store means and to said parity checking means for outputting said combined bit set which is stored in said first store means if said parity checking means verifies that the parity of said combined bit set which was stored in said first store means is correct, and for outputting said combined bit set which is stored in said second store means if said parity checking means fails to verify that the parity of said combined bit set which was stored in said first store means was correct.
Claim 3
Dependent Claim
23 words
A data protection and correction means as claimed in claim 1 wherein said first and second store means are a general register set.
Claim 4
Dependent Claim
121 words
A data protection and correction means as claimed in claim 1 wherein said input data bits are sent as data woods of a predefined bit size and said data words are segmented into a plurality of sub-groups of bits of predefined bit sizes, said first and second store means are segmented into a plurality of storage sections in correspondence with said plurality of sub-groups of bits so that each of said storage sections stores one of said sub-groups of bits, and said parity checking means and said output means are segmented in a plurality of parity checking and output sections, respectively, so that each parity checking means and each output means corresponds to, and functions with, one of said storage sections.
Claim 5
Dependent Claim
23 words
A data protection and correction means as claimed in claim 3 wherein said first and second store means are a general register set.
Claim 6
Dependent Claim
30 words
A data protection and correction means as claimed in claim 1 wherein said input parity bits have an odd parity and said parity checking means checks for an even parity.
Claim 7
Dependent Claim
23 words
A data protection and correction means as claimed in claim 5 wherein said output means supplies output signals which have an odd parity.
Claim 8
Dependent Claim
73 words
A data protection and correction means as claimed in claim 6 wherein said input data bits are represented as even and odd address words in said first and second store means, and said first and second store means are divided into even and odd first and second store areas comprising address resolution means for writing said even and odd address words in to the appropriate one of said first and second store means.
Claim 9
Independent Claim
273 words
A method of providing data protection and correction means for a first store means, wherein said first store means is coupled to receive input data bits and input parity bits from a source and a second store means is available, comprising, complementing said input data bits and input parity bits to produce complemented input bits and complemented parity bits, combining said complemented input data bits with said input parity bits to form a first combined bit set, combining said input data bits with said complemented parity bits to form a second combined bit set, supplying said first combined bit set to one of said first and second store means for storage therein and said second combined bit set to the other of said first and second storage means for storage therein, reading said one of said first of said second combined bit sets which is stored in said first store means therefrom, verifying the parity of said combined bit set that was read from said first store means, reading said other of said first or said second combined bit sets which are stored in said second store means therefrom if said parity bit of said combined bit set which was stored in said first store means is not verified, and outputting either said combined bit set which was stored in first store means if said parity of said combined bit set which was stored in said first store means is verified, or said combined bit set which was stored in said second store means if said parity of said combined bit set which was stored in said first store means is not verified.
Claim 10
Independent Claim
273 words
A method of providing data protection and correction means for a first store means, wherein said first store means is coupled to receive input data bits and input parity bits from a source and a second store means is available, comprising, complementing said input data bits and input parity bits to produce complemented input bits and complemented parity bits, combining said complemented input data bits with said input parity bits to form a first combined bit set, combining said input data bits with said complemented parity bits to form a second combined bit set, supplying said first combined bit set to one of said first and second store means for storage therein and said second combined bit set to the other of said first and second storage means for storage therein, reading said one of said first of said second combined bit sets which is stored in said first store means therefrom, verifying the parity of said combined bit set that was read from said first store means, reading said other of said first or said second combined bit sets which are stored in said second store means therefrom if said parity bit of said combined bit set which was stored in said first store means is not verified, and outputting either said combined bit set which was stored in first store means if said parity of said combined bit set which was stored in said first store means is verified, or said combined bit set which was stored in said second store means if said parity of said combined bit set which was stored in said first store means is not verified.
Claim 11
Dependent Claim
62 words
A method as claimed in claim 8 wherein said input data bits represent even and odd address words in said first and second store means, and said first and second store means are divided into even and odd first and second store areas, comprising writing said even and odd address words into the appropriate one of said first and second store means.
Claim 12
Dependent Claim
23 words
A method as claimed in claim 8 wherein said input parity bits have an odd parity, comprising checking said parity for even parity.
Claim 13
Dependent Claim
15 words
A method as claimed in claim 10 comprising outputting signals which have an odd parity.
References Cited (Backward Citations)
US3340506A
Cited
US4224681A
Cited
US4271519A
Cited
US4679195A
Cited
SU1501173A1
Cited
US5008886A
Cited
US5140597A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-05-01 | 1998-10-31 | 1999-05-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-05-01 | 2002-10-31 | 2003-05-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-05-01 | 2006-10-31 | 2007-05-02 | $7700.00 | Window Closed / Lapsed |