US5327369A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital adder and method for adding 64-bit, 16-bit and 8-bit words
Assignee: Intel Corp
•
Filing: 1993-03-31
•
Granted: 1994-07-05
•
Expires: 2013-03-31
Abstract
Abstract An adder for a 64-bit microprocessor which has three modes of operations, specifically, a 64-bit mode, a second mode where the adder in effect is four 16-bit adders and a third mode where the adder is, in effect, eight 8-bit adders. Two levels of Kogge-Stone trees are used, the first to generate group carries and propagate signals and the second for generating the carry signals for the 64-bit case. In the case of the 8-bit and 16-bit modes, the second level Kogge-Stone tree is not used, rather ordinary logic generates the appropriate carries. Exclusive ORing for conditional sums is performed in parallel with the generation of the carry signals.
Inventors
- 👤 Yaron Ashkenazi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 18:37
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F7/506; G06F7/507; G06F2207/00; G06F2207/38; G06F2207/3804; G06F2207/3808; G06F2207/3828
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
217 words
An adder comprising: a first circuit coupled to receive A and B signals, each of said A and B signals comprising a plurality of bits, said first circuit logically combining said A and B signals to provide first propagate and generate signals; a group of second circuits each coupled to receive a plurality of said first propagate and generate signals from said first circuit, said group of second circuits providing a plurality of group propagate and generate signals; a third circuit coupled to said group of second circuits for providing first carry signals from said group propagate and generate signals taken as a continuous chain and second carry signals from said group propagate and generate signals taken in chains shorter than said continuous chain; a fourth circuit coupled to said group of second circuits and to receive said A and B signals for computing conditional sums for said A and B signals; a first selector coupled to said third circuit for selecting between said first carry signals and second carry signals, said first selector being controlled by an external mode signal; and, a second selector coupled to said fourth circuit and said first selector for selecting between said conditional sums, said second selector being controlled by one of said first carry signals and said second carry signals.
Claim 2
Dependent Claim
217 words
An adder comprising: a first circuit coupled to receive A and B signals, each of said A and B signals comprising a plurality of bits, said first circuit logically combining said A and B signals to provide first propagate and generate signals; a group of second circuits each coupled to receive a plurality of said first propagate and generate signals from said first circuit, said group of second circuits providing a plurality of group propagate and generate signals; a third circuit coupled to said group of second circuits for providing first carry signals from said group propagate and generate signals taken as a continuous chain and second carry signals from said group propagate and generate signals taken in chains shorter than said continuous chain; a fourth circuit coupled to said group of second circuits and to receive said A and B signals for computing conditional sums for said A and B signals; a first selector coupled to said third circuit for selecting between said first carry signals and second carry signals, said first selector being controlled by an external mode signal; and, a second selector coupled to said fourth circuit and said first selector for selecting between said conditional sums, said second selector being controlled by one of said first carry signals and said second carry signals.
Claim 3
Dependent Claim
16 words
The adder defined by claim 1 wherein each of said second circuits comprise a Kogge-Stone tree.
Claim 4
Dependent Claim
14 words
The adder defined by claim 2 wherein said third circuit comprises another Kogge-Stone tree.
Claim 5
Dependent Claim
38 words
The adder defined by claim 1 wherein said adder receives a carry-in signal and wherein said carry-in signal is connected to said first selector and is also used for selecting between the conditional sums of said fourth circuit.
Claim 6
Dependent Claim
30 words
The adder defined by claim 4 wherein said first circuit logically ORs and ANDs each bit of said A and B signals to provide said first propagate and generate signals.
Claim 7
Dependent Claim
29 words
The adder defined by claim 5 wherein said fourth circuit is coupled to receive said group propagate and generate signals, said A and B signals and said carry-in signal.
Claim 8
Dependent Claim
171 words
A 64-bit adder for adding two 64-bit digital signals, A and B, comprising: a first circuit coupled to receive the A and B signals for logically combining said signals to provide first propagate and generate signals; a group of eight Kogge-Stone trees each coupled to receive a plurality of said first propagate and first generate signals from said first circuit, said group of trees providing a plurality of group propagate and generate signals; a second circuit including an additional Kogge-Stone tree coupled to said group of trees for determining first carry signals when said group of eight trees are considered as a single first chain and second carry signal signals when said group of trees are considered as a plurality of second chains, each of said second chains being shorter than said first chain; a third circuit for computing conditional sums for said A and B signals; and, a multiplexer for selecting between said conditional sums, said multiplexer being controlled by one of said first carry signals or second carry signals.
Claim 9
Dependent Claim
171 words
A 64-bit adder for adding two 64-bit digital signals, A and B, comprising: a first circuit coupled to receive the A and B signals for logically combining said signals to provide first propagate and generate signals; a group of eight Kogge-Stone trees each coupled to receive a plurality of said first propagate and first generate signals from said first circuit, said group of trees providing a plurality of group propagate and generate signals; a second circuit including an additional Kogge-Stone tree coupled to said group of trees for determining first carry signals when said group of eight trees are considered as a single first chain and second carry signal signals when said group of trees are considered as a plurality of second chains, each of said second chains being shorter than said first chain; a third circuit for computing conditional sums for said A and B signals; and, a multiplexer for selecting between said conditional sums, said multiplexer being controlled by one of said first carry signals or second carry signals.
Claim 10
Dependent Claim
18 words
The adder defined by claim 7 wherein said first circuit ORs and ANDs said A and B signals.
Claim 11
Dependent Claim
14 words
The adder defined by claim 8 wherein said first circuit receives a carry-in signal.
Claim 12
Dependent Claim
17 words
The adder defined by claim 9 wherein said multiplexer is controlled in part by said carry-in signal.
Claim 13
Dependent Claim
22 words
The adder defined by claim 7 wherein said second circuit provides additional carry signals different than said first and second carry signals.
Claim 14
Independent Claim
108 words
A method for adding two numbers, A and B, each having a plurality of bits, comprising the steps of: generating propagate and generate terms for the numbers A and B; generating propagate and generate terms for groups of the propagate and generate terms for the numbers A and B; finding one of, first carry terms for all the groups as single chain or second carry terms for the groups considered as a plurality of chains, each shorter than the single chain; generating group conditional sums for at least two of the groups; using the first carry terms or second carry terms to select sums from the conditional sums.
Claim 15
Independent Claim
108 words
A method for adding two numbers, A and B, each having a plurality of bits, comprising the steps of: generating propagate and generate terms for the numbers A and B; generating propagate and generate terms for groups of the propagate and generate terms for the numbers A and B; finding one of, first carry terms for all the groups as single chain or second carry terms for the groups considered as a plurality of chains, each shorter than the single chain; generating group conditional sums for at least two of the groups; using the first carry terms or second carry terms to select sums from the conditional sums.
Claim 16
Dependent Claim
26 words
The method defined by claim 12 wherein a carry-in is used in the generation of the propagate and generate terms for the numbers A and B.
Claim 17
Dependent Claim
30 words
The method defined by claim 13 wherein the using step selectively uses the first carry terms, the second carry terms and the carry-in to select sums from the conditional sums.
Claim 18
Dependent Claim
33 words
The method defined by claim 14 wherein the step of generating propagate and generate terms for the numbers A and B, comprises ANDing and ORing the bits in the numbers, A and B.
Claim 19
Dependent Claim
26 words
The method defined by claim 15 wherein generating group conditional sums includes use of the A and B numbers and the group propagate and generate terms
Claim 20
Independent Claim
119 words
A method for adding two 64-bit numbers comprising the steps of: generating propagate and generate terms for the two 64-bit numbers; grouping the propagate and generate terms for the two 64-bit numbers into eight groups; generating propagate and generate terms for each of the eight groups; finding first carry terms for the eight groups when considering the groups as a single chain; finding second carry terms for the eight groups when considering the groups as a plurality of chains each of which is shorter than the single chain; generating group conditional sums for at least two of the eight groups; and using one of said first carry terms and second carry terms to select sums from the conditional sums.
Claim 21
Independent Claim
119 words
A method for adding two 64-bit numbers comprising the steps of: generating propagate and generate terms for the two 64-bit numbers; grouping the propagate and generate terms for the two 64-bit numbers into eight groups; generating propagate and generate terms for each of the eight groups; finding first carry terms for the eight groups when considering the groups as a single chain; finding second carry terms for the eight groups when considering the groups as a plurality of chains each of which is shorter than the single chain; generating group conditional sums for at least two of the eight groups; and using one of said first carry terms and second carry terms to select sums from the conditional sums.
Claim 22
Dependent Claim
33 words
The method defined by claim 17 wherein generating propagate and generate terms for the numbers A and B comprises the steps of ORing and ANDing the bits of the numbers A and B.
Claim 23
Dependent Claim
26 words
The method defined by claim 18 wherein the step of generating propagate and generate terms for the numbers A and B includes using a carry-in term.
Claim 24
Dependent Claim
45 words
The method defined by claim 19 wherein the step of using one of the first carry terms and second carry terms comprises the step of using one of the first carry terms, second carry terms or carry-in signal to select sums from the conditional sums.
References Cited (Backward Citations)
US4707800A
Cited
US4768160A
Cited
US4737926A
Cited
US4914617A
Cited
US5047975A
Cited
US5189636A
Cited
US4905180A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-07-04 | 1998-01-03 | 1998-07-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-07-04 | 2002-01-03 | 2002-07-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-07-04 | 2006-01-03 | 2006-07-05 | $7700.00 | Window Closed / Lapsed |