US3700875A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Parallel binary carry look-ahead adder system
Assignee: Licentia Patent Verwaltungs GmbH
•
Filing: 1971-02-18
•
Granted: 1972-10-24
•
Expires: 1991-02-18
Abstract
Abstract A multiple bit binary parallel adder system including a plurality of multiple bit group parallel adders with the output carry from the highest-bit of each group adder constituting the input carry of the next highest order group adder. The output carry of the highest order bit of each group adder is rapidly formed by means of logic switching circuits which compile values corresponding to all of the input values to the group adder while the remaining output carries within the group adders are formed as conventional propogated carries.
Inventors
- 👤 Franz Saenger
- 👤 Dieter Straub
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 21:40
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F7/506; G06F7/508
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
329 words
In a multiple bit binary parallel adder system for adding together the bits of two binary words, said system containing a plurality of multiple bit group parallel adders and wherein the output carry from the highest order bit of each group adder constitutes the input carry for the lowest order bit of the nexthigher order group adder, the improvement wherein at least one of said group adders comprises: a plurality of full adders Vi, where i is a number which represents the bit location in the words, each of said full adder Vi having inPuts Xi, Yi for summands of the same designation, an input Wi for the output carry Zi 1 of the next-lower order bit, an output Si for the sum of the bits and output Zi for the output carry; a plurality of logic stages connected to the summand inputs for forming the values Gi Xi. Yi, Pi Xi + Yi, and Gi, Pi for the corresponding complementary values; and, logic circuit means for rapidly forming the output carry of said at least one group adder by compiling values corresponding to all of the input values to said at least one group adder, while all of the other carries within said at least one group adder are formed as propagated carriers, said logic circuit means including a plurality of logic circuits L Mu where Mu 1,2, . . . m, each of said logic circuits having at least one first input A1 Mu , A2 Mu . . . , at least one second input B1 Mu , B2 Mu . . . , outputs C Mu and C Mu , and means interconnecting said first and second inputs and said outputs for establishing the following relationships, C Mu A1 Mu + A2 Mu + . . . +B1 Mu + B2 Mu + . . . C Mu A1 Mu + A2 Mu + . . . (B1 Mu + B2 Mu . . .).
Claim 2
Dependent Claim
329 words
In a multiple bit binary parallel adder system for adding together the bits of two binary words, said system containing a plurality of multiple bit group parallel adders and wherein the output carry from the highest order bit of each group adder constitutes the input carry for the lowest order bit of the nexthigher order group adder, the improvement wherein at least one of said group adders comprises: a plurality of full adders Vi, where i is a number which represents the bit location in the words, each of said full adder Vi having inPuts Xi, Yi for summands of the same designation, an input Wi for the output carry Zi 1 of the next-lower order bit, an output Si for the sum of the bits and output Zi for the output carry; a plurality of logic stages connected to the summand inputs for forming the values Gi Xi. Yi, Pi Xi + Yi, and Gi, Pi for the corresponding complementary values; and, logic circuit means for rapidly forming the output carry of said at least one group adder by compiling values corresponding to all of the input values to said at least one group adder, while all of the other carries within said at least one group adder are formed as propagated carriers, said logic circuit means including a plurality of logic circuits L Mu where Mu 1,2, . . . m, each of said logic circuits having at least one first input A1 Mu , A2 Mu . . . , at least one second input B1 Mu , B2 Mu . . . , outputs C Mu and C Mu , and means interconnecting said first and second inputs and said outputs for establishing the following relationships, C Mu A1 Mu + A2 Mu + . . . +B1 Mu + B2 Mu + . . . C Mu A1 Mu + A2 Mu + . . . (B1 Mu + B2 Mu . . .).
Claim 3
Dependent Claim
26 words
A binary adder system as defined in claim 1 wherein said full adders include said logic stages which form the values Pi, Pi, Gi, and Gi.
Claim 4
Dependent Claim
136 words
A binary adder system as defined in claim 1 wherein said plurality of multiple bit group adders comprises a plurality of three-bit group adders, each of said three-bit group adders including three of said full adders V1, V2 and V3 and four of said logic circuits L1, L2, L3, and L4, the interconnection of the full adders and logic circuits of each three-bit group adder with one another and the association of input values and output values of each three-bit group adder with the inputs and outputs thereof being as follows: V1 V2 V3 X1 X2 X3 Y1 Y2 Y3 W1 Z0 W2 Z1 W3 Z2 A11 P3 A12 G1 A13 G3 A21 P2 A22 P2 B11 P1 B12 P3 B13 G2 B23 P3 A14 C2 A24 C3 B14 C1 B24 Z0 Z3 C4; Z3 C4
Claim 5
Dependent Claim
148 words
A binary adder system as defined in claim 1 wherein said plurality of multiple-bit group adders comprises a plurality of four-bit group adders, each of said four-bit group adders including four full adders V1, V2, V3, and V4 and six logic circuits L1, L2, L3, L4, L5 and L6, the interconnection of the full adders and logic circuits of each four-bit group adders with one another and the association of input values and output values of each four-bit group adder with the inputs and outputs thereof being as follows: V1 V2 V3 V4 X1 X2 X3 X4 Y1 Y2 Y3 Y4 W1 Z0 W2 Z1 W3 Z2 W4 Z3 A11 P2 A12 G2 A13 G4 A21 P3 A22 P3 B11 P4 B12 P4 B13 G3 B23 P4 A14 C1 A15 C2 A25 C3 B14 P1 B15 C1 B25 G1 A16 C5 B16 C4 B26 Z0Z4 C6, Z4 C6
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) | 1975-10-24 | 1976-04-24 | 1976-10-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-10-24 | 1980-04-24 | 1980-10-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-10-24 | 1984-04-24 | 1984-10-24 | $7700.00 | Window Closed / Lapsed |