Patent US5048024A successfully refreshed from Google Patents.
US5048024A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Partitioned parity check and regeneration circuit
Assignee: Unisys Corp
•
Filing: 1989-09-06
•
Granted: 1991-09-10
•
Expires: 2009-09-06
Abstract
Abstract A novel partitioned parity check and regeneration circuit is provided for receiving an input data word which is partitioned and the partitioned bits are stored in a partitioning register to provide a subset input data word of fewer data bits than the input data word. Parity register means including a parity register are associated with the partitioning register to provide a parity check of the partitioned data word and for generating an error detect signal when the data bits in the partitioning register are not properly latched. The parity bits stored in the associated parity register are employed with associated output logic to generate regenerated parity bits associated with the output of the data bits in the partitioning register to preserve the integrity of the data.
Inventors
- 👤 Gary R. Robeck
- 👤 Joseba M. Desubijana
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 10:04
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
117 words
A partitioned parity check and regeneration circuit, comprising: an input data word comprising a plurality of bytes, each said byte comprising plural data bits and a parity bit, partitioning register means comprising buffer registers for storing selected data bits from said input data word to provide a subset input data word of fewer data bits than said input data word, parity register means containing a plurality of parity bits associated with each said subset input data word, and input logic means for generating said parity bits, said input logic means having all of the inputs of said input data word, and having an error detecting output and a parity bit output for loading said parity register means.
Claim 2
Dependent Claim
117 words
A partitioned parity check and regeneration circuit, comprising: an input data word comprising a plurality of bytes, each said byte comprising plural data bits and a parity bit, partitioning register means comprising buffer registers for storing selected data bits from said input data word to provide a subset input data word of fewer data bits than said input data word, parity register means containing a plurality of parity bits associated with each said subset input data word, and input logic means for generating said parity bits, said input logic means having all of the inputs of said input data word, and having an error detecting output and a parity bit output for loading said parity register means.
Claim 3
Dependent Claim
42 words
A partitioned parity check circuit as set forth in claim 1 wherein said partitioning register means comprises a day clock counter, said day clock counter having two orders of partitioning registers, a master input partitioning register, and a slave output partitioning register.
Claim 4
Dependent Claim
35 words
A partitioned parity check circuit as set forth in claim 2 which further comprises a return loop coupled from the output of said slave output register and to the input of said master input register.
Claim 5
Dependent Claim
41 words
A partitioned parity check circuit as set forth in claim 3 which further comprises a day clock signal coupled to the lowest order bit register of the lowest order bit in said master input register comprising said lowest order bit register.
Claim 6
Dependent Claim
50 words
A partitioned parity check circuit as set forth in claim 1 which further includes output logic means coupled to the output of said partitioning register means and to said parity register means for generating an output data word having the same bit and byte length as said input data word.
Claim 7
Dependent Claim
24 words
A partitioned parity check circuit as set forth in claim 5 wherein said output logic means includes means for generating zero filled data bits.
Claim 8
Dependent Claim
28 words
A partitioned parity check circuit as set forth in claim 6 wherein said zero filled data bits are inserted at predetermined bit positions of said output data word.
Claim 9
Dependent Claim
31 words
A partitioned parity check circuit as set forth in claim 7 wherein the majority of said zero filled bits are inserted in consecutive bit positions at the highest order bit positions.
References Cited (Backward Citations)
US4371929A
Cited
US4443876A
Cited
US4462102A
Cited
US4456976A
Cited
US4556978A
Cited
US4697233A
Cited
US4706250A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-09-09 | 1995-03-11 | 1995-09-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-09-09 | 1999-03-11 | 1999-09-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-09-09 | 2003-03-11 | 2003-09-10 | $7700.00 | Window Closed / Lapsed |