US4918695A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Failure detection for partial write operations for memories
Assignee: Unisys Corp
•
Filing: 1988-08-30
•
Granted: 1990-04-17
•
Expires: 2008-08-30
Abstract
Abstract A failure detection system for variable field partial write system for merging data bits in a memory word upon programmable request is described. The variable bit field can be selected for any number of bit positions from a single bit up to and including a full data word, where data words are comprised of a predetermined number of bytes each containing a predetermined number of bits. A Start Bit Code defines the location of the start of the bit field to be written and an End Bit Code defines the bit after the last bit that is to be merged and written. Write and Read Data to be used in the partial merge operation are stored in a Merge Register along with a code derived from the Start and End Code bits. The bits not used are stored in a Non-Merge Register. Parities are compared to verify that a parity error did not occur when the Merge Register was loaded.
Inventors
- 👤 James H. Scheuneman
- 👤 Michael E. Mayer
- 👤 Paul L. Peirson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 06:38
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/76; G06F7/764; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1048; G06F11/1056
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
155 words
In a memory system capable of partial write operation comprising error detection means and partial write means for merging error-corrected read data and write data under the control of a start code and an end code, which respectively define the starting bit of said read data and the end bit of said read data which is to be overwritten with said write data, the improvement comprising decode means which receives and decodes said start code and said end code for producing a selection code and the bit-by-bit complement of such selection code, merge means coupled to said decode means which utilizes said read data, said write data, and said selection code, non-merge means coupled to said decode means which utilizes said read data, said write data and said bit-by-bit complement of said selection code, and parity generating and checking means coupled to both said merge means and said non-merge means for checking partial write operations.
Claim 2
Dependent Claim
155 words
In a memory system capable of partial write operation comprising error detection means and partial write means for merging error-corrected read data and write data under the control of a start code and an end code, which respectively define the starting bit of said read data and the end bit of said read data which is to be overwritten with said write data, the improvement comprising decode means which receives and decodes said start code and said end code for producing a selection code and the bit-by-bit complement of such selection code, merge means coupled to said decode means which utilizes said read data, said write data, and said selection code, non-merge means coupled to said decode means which utilizes said read data, said write data and said bit-by-bit complement of said selection code, and parity generating and checking means coupled to both said merge means and said non-merge means for checking partial write operations.
Claim 3
Dependent Claim
37 words
In a memory system as claimed in claim 1 the improvement wherein said parity generator and checking means comprises a first parity generator means coupled to receive a merged data word and a corresponding non-merged data word.
Claim 4
Dependent Claim
25 words
In a memory system as claimed in claim 2 the improvement wherein write and read parity bits are coupled to said first parity generator means.
Claim 5
Dependent Claim
26 words
In a memory system as claimed in claim 2 the improvement wherein write data and read data words are coupled to said first parity generator means.
Claim 6
Dependent Claim
37 words
In a memory system as claimed in claim 2 the improvement comprising second parity generator means coupled to receive write and read parity bits and parity comparator means coupled to said first and second parity generator means.
Claim 7
Dependent Claim
37 words
In a memory system as claimed in claim 2 the improvement comprising second parity generator means coupled to receive write and read data words and parity comparator means coupled to said first and second parity generator means.
Claim 8
Dependent Claim
84 words
In a memory system as claimed in claim 2 wherein said merged data word, said non-merged data word and bits representative of either data word of said write data or said read data words are supplied to said first parity generator means, comprising parity comparator means which is coupled to said first parity generator means and to receive bits representative of the other data word of said write data or said read data words which was not coupled to said first parity generator means.
Claim 9
Dependent Claim
98 words
In a memory system as claimed in claim 2 the improvement wherein said parity generator and checking means comprises second parity generator means, said merged data word is coupled to one of said first and second parity generator means and said non-merged data word is coupled to the other of said first and second parity generator means and all of said bits representative of said write and said read data words are sent to the same one of said first and second parity generator means, and parity comparator means for comparing said first and second parity generator means.
Claim 10
Independent Claim
111 words
A method of detecting errors in a memory system that comprises partial write means for merging read data and write data under the control of a start code and an end code, which respectively define the starting bit of said read data and the end bit of said read data which is to be overwritten with said write data, and decode means which receives and decodes said start code and said end code, comprising generating a non-merged data word and then generating a parity check utilizing the corresponding merged data word, said non-merged data word and bits representative of corresponding write word and read words to check said partial write operations.
Claim 11
Independent Claim
111 words
A method of detecting errors in a memory system that comprises partial write means for merging read data and write data under the control of a start code and an end code, which respectively define the starting bit of said read data and the end bit of said read data which is to be overwritten with said write data, and decode means which receives and decodes said start code and said end code, comprising generating a non-merged data word and then generating a parity check utilizing the corresponding merged data word, said non-merged data word and bits representative of corresponding write word and read words to check said partial write operations.
Claim 12
Dependent Claim
51 words
A method as claimed in claim 9 comprising generating a first parity for said merged data word, generating a second parity for said non-merged data, a write parity bit representative of said write word, and a read parity bit representative of said read word and comparing said first and second parities.
Claim 13
Dependent Claim
51 words
A method as claimed in claim 9 comprising generating first parity for a write parity bit representative of said write word and a read bit representative of said read word and a second parity for said merged data word and a non-merged data word and comparing said first and second parities.
Claim 14
Dependent Claim
41 words
A method as claimed in claim 9 comprising generating a first parity for said write word and said read word and a second parity for said merged data word and a non-merged data word and comparing said first and second parities.
Claim 15
Dependent Claim
40 words
A method as claimed in claim 9 comprising generating a combined parity for write parity bit representative of of said write word, a read parity bit representative of said read word, said merged data word and said non-merged data word.
Claim 16
Dependent Claim
35 words
A method as claimed in claim 9 comprising generating a combined parity for said write word, said read word, said merged data word and a non-merged data word and comparing said first and second parities.
Claim 17
Dependent Claim
54 words
A method as claimed in claim 9 comprising generating a first parity that utilizes said merged data word, a second parity that utilizes said corresponding non-merged data words wherein one of said first and second parities also utilize bits representative of said write and read data words and comparing said first and second parities.
Claim 18
Dependent Claim
75 words
A method as claimed in claim 9 comprising generating a first parity that utilized said merged data word, said non-merged data word and bits representative of the parity of either data word of said write data or said read data words and comparing said first parity with bits representative of the parity of the other data word of said write data of said read data words which was not utilized in generating said first parity.
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) | 1993-04-16 | 1993-10-16 | 1994-04-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-04-16 | 1997-10-16 | 1998-04-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-04-16 | 2001-10-16 | 2002-04-17 | $7700.00 | Window Closed / Lapsed |