US4899305A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Manchester carry adder circuit
Assignee: National Semiconductor Corp
•
Filing: 1988-06-15
•
Granted: 1990-02-06
•
Expires: 2008-06-15
Abstract
Abstract A 16-bit adder architecture configured uniquely as two 8-bit adders. The first 8-bit adder uses a static technique to perform addition of the least significant bits and a dynamic technique to perform addition on the remaining bits. The second 8-bit adder uses a static technique to perform addition of the most significant bits and a dynamic technique to perform addition on the remaining bits. The two 8-bit adders are combined at the most significant bit of the first adder and the least significant bit of the second adder using the carry out of the first adder and the carry in of the second adder. A static logic gate is used to logically combine and correctly time the combination of the two 8-bit adders into a single, high-speed 16-bit adder.
Inventors
- 👤 William M. Needles
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 21:23
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
196 words
A Manchester carry adder circuit of the type that includes a plurality of series-connected elemental adder circuits for performing addition of bit position n+1 of N-bit terms A and B by adding the operands An+1 and B n+1 and the carry C n from the previous bit position n to produce a sum digit and a possible carry-out digit C n+1 for carry to the subsequent bit position n+2, the circuit comprising (a) a first x bit adder that uses a static technique to perform addition of the least significant bit of the terms A and B and a dynamic technique to perform addition on the remaining x-1 bits; (b) a second N-x bit adder that uses a static technique to perform addition on the most significant bit of the terms A and B and a dynamic technique to perform addition on the remaining N-x-1 bits; and (c) means for combining the first and second adders at the most significant bit of the first adder and the least significant bit of the second adder using the carry-out C x of the first adder and the carry-in of the least significant bit position of the second adder.
Claim 2
Dependent Claim
196 words
A Manchester carry adder circuit of the type that includes a plurality of series-connected elemental adder circuits for performing addition of bit position n+1 of N-bit terms A and B by adding the operands An+1 and B n+1 and the carry C n from the previous bit position n to produce a sum digit and a possible carry-out digit C n+1 for carry to the subsequent bit position n+2, the circuit comprising (a) a first x bit adder that uses a static technique to perform addition of the least significant bit of the terms A and B and a dynamic technique to perform addition on the remaining x-1 bits; (b) a second N-x bit adder that uses a static technique to perform addition on the most significant bit of the terms A and B and a dynamic technique to perform addition on the remaining N-x-1 bits; and (c) means for combining the first and second adders at the most significant bit of the first adder and the least significant bit of the second adder using the carry-out C x of the first adder and the carry-in of the least significant bit position of the second adder.
Claim 3
Dependent Claim
12 words
A Manchester carry adder as in claim 1 wherein N=16 and x=8.
Claim 4
Dependent Claim
111 words
A Manchester carry adder as in claim 1 wherein each elemental adder circuit except that for the least and most significant bit positions of terms A and B comprises (a) a carry output node; (b) pull-up means connected between a positive supply and the carry output node for charging the carry output node in response to a clock signal; (c) pull-down means connected directly between the carry output node and ground for discharging the carry output node in response to a carry generate signal; and (d) carry propagate means connected to the carry output node for providing a carry-in to the carry output node in response to a carry propagate signal.
Claim 5
Dependent Claim
41 words
A Manchester carry adder as in claim 3 wherein the pull-down means consists of an N-channel transistor its source connected directly to ground, its drain connected to the carry output node and its gate connected to receive the carry generate signal.
Claim 6
Dependent Claim
32 words
A Manchester carry adder as in claim 1 wherein the means for combining includes a static logic gate for logically combining and correctly timing the combination of the first and second adders.
Claim 7
Dependent Claim
21 words
A Manchester carry adder as in claim 1 wherein each of the first and second adders includes carry look ahead circuitry.
References Cited (Backward Citations)
US4052604A
Cited
US4564921A
Cited
US4523292A
Cited
US4651296A
Cited
US4707800A
Cited
US4807176A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-02-05 | 1993-08-07 | 1994-02-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-02-05 | 1997-08-07 | 1998-02-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-02-05 | 2001-08-07 | 2002-02-06 | $7700.00 | Window Closed / Lapsed |