US4251884A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Parity circuits
Assignee: AT&T Inc
•
Filing: 1979-02-09
•
Granted: 1981-02-17
•
Expires: 1999-02-09
Abstract
Abstract A parity circuit (FIG. 6) for n signals comprises n-1 parity building blocks (61-67) connected in a parity tree configuration. Each parity building block comprises three interconnected NAND gates (41-43). A first pair of signal inputs (A and B) are connected to the input of the first and second NAND gates (41 and 42), and a second pair of signal inputs (C and D) are connected to the input of the first and third NAND gates (41 and 43). The output of the first NAND gate (41) is coupled to the input of the second and third NAND gates (42 and 43). The pairs of inputs are controlled so that at least one signal in each pair is high ("1"). In an alternative embodiment of the parity building block, three NOR gates (91-93) are connected in the same manner as the aforementioned NAND gates and the pairs of inputs thereto are controlled so that at least one signal in each pair is low ("0"). Parity circuits in accordance with the disclosure can be used as parity generators or as parity checkers.
Inventors
- 👤 Philip J. Baun, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 21:15
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
57 words
A parity building block circuit having two pairs of inputs, said circuit comprising means for converting the parities of the two pairs of inputs into a single pair of output signals of corresponding parity, and means for controlling the pairs of inputs so that at least one signal in each pair is of the same predetermined potential.
Claim 2
Dependent Claim
57 words
A parity building block circuit having two pairs of inputs, said circuit comprising means for converting the parities of the two pairs of inputs into a single pair of output signals of corresponding parity, and means for controlling the pairs of inputs so that at least one signal in each pair is of the same predetermined potential.
Claim 3
Dependent Claim
74 words
In a parity circuit as defined in claim 1 wherein the converting means comprises three interconnected NAND gates, a first pair of inputs each being connected to the input of the first and second NAND gates, the second pair of inputs each being connected to the input of the first and third NAND gates, and the output of the first NAND gate being coupled to the input of the second and third NAND gates.
Claim 4
Dependent Claim
20 words
In a parity circuit as defined in claim 2 wherein at least one signal in each input pair is high.
Claim 5
Dependent Claim
74 words
In a parity circuit as defined in claim 1 wherein the converting means comprises three interconnected NOR gates, a first pair of inputs each being connected to the input of the first and second NOR gates, the second pair of inputs each being connected to the input of the first and third NOR gates, and the output of the first NOR gate being coupled to the input of the second and third NOR gates.
Claim 6
Dependent Claim
20 words
In a parity circuit as defined in claim 4 wherein at least one signal in each input pair is low.
Claim 7
Dependent Claim
89 words
A parity building block circuit having two pairs of inputs, said circuit comprising three connected NAND gates, a first pair of inputs each connected to the input of the first and second NAND gates, a second pair of inputs each connected to the input of the first and third NAND gates, the output of the first NAND gate being coupled to the input of the second and third NAND gates, and means for controlling the pairs of inputs so that at least one signal in each pair is high.
Claim 8
Dependent Claim
89 words
A parity building block circuit having two pairs of inputs, said circuit comprising three connected NAND gates, a first pair of inputs each connected to the input of the first and second NAND gates, a second pair of inputs each connected to the input of the first and third NAND gates, the output of the first NAND gate being coupled to the input of the second and third NAND gates, and means for controlling the pairs of inputs so that at least one signal in each pair is high.
Claim 9
Dependent Claim
89 words
A parity building block circuit having two pairs of inputs, said circuit comprising three connected NOR gates, a first pair of inputs each connected to the input of the first and second NOR gates, a second pair of inputs each connected to the input of the first and third NOR gates, the output of the first NOR gate being coupled to the input of the second and third NOR gates, and means for controlling the pairs of inputs so that at least one signal in each pair is low.
Claim 10
Dependent Claim
89 words
A parity building block circuit having two pairs of inputs, said circuit comprising three connected NOR gates, a first pair of inputs each connected to the input of the first and second NOR gates, a second pair of inputs each connected to the input of the first and third NOR gates, the output of the first NOR gate being coupled to the input of the second and third NOR gates, and means for controlling the pairs of inputs so that at least one signal in each pair is low.
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) | 1984-02-17 | 1984-08-18 | 1985-02-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-02-17 | 1988-08-18 | 1989-02-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-02-17 | 1992-08-18 | 1993-02-17 | $7700.00 | Window Closed / Lapsed |