Patent US4761760A successfully refreshed from Google Patents.
US4761760A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital adder-subtracter with tentative result correction circuit
Assignee: NEC Electronics Corp
•
Filing: 1985-08-19
•
Granted: 1988-08-02
•
Expires: 2005-08-19
Abstract
Abstract For reduction in circuit complexity, there is disclosed a high speed digital arithmetic unit comprises a plurality of binary adders in cascade arrangement, each binary adder comprising carry lookahead means for generating a carry signal representative of an actual carry bit based on a segment of a first binary number, a corresponding segment of a second binary number and a carry signal fed from an adder located at a lower position, adding means for adding the segment of the first binary number to the corresponding segment of the second binary number in parallel operation with the carry lookahead means, the adding means simultaneously adding a suspense carry to a partial sum of the segments for generation of a temporary result, and final result determination means operative to generate a final result based on the partial sum in accordance with the actual carry fed from the lower adder.
Inventors
- 👤 Nukiyama Tomoji
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 04:37
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F7/506
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
334 words
A digital arithmetic unit for first and second binary numbers including a least significant adder and a plurality of adders arranged in cascade, each of said first and second binary numbers being subdivided into a plurality of segments, and (a) said least significant adder comprising: (1) carry lookahead means operative to produce a first carry signal representative of an actual carry based on one of the segments of said first binary number, a corresponding segment of said second binary number, and a dummy carry signal of value 0; (2) adding means operative to add the segment of said first binary number to the corresponding segment of said second binary number for generation of a first partial sum of the segments, said adding means further being operative to add a suspense carry of value 1 to the first partial sum for generation of a first temporary result; and (3) final result determination means operative to generate a first final result by subtracting a value 1 from said first temporary result (b) each of said adders comprising: (1) carry lookahead means operative to produce a second carry signal representative of an actual carry based on another segment of said first binary number, a corresponding segment of said second binary number and said carry signal fed from said least significant adder or said adder located at a lower position thereof, (2) adding means operative to add said another segment of said first binary number to the corresponding segment of said second binary number for generation of a second partial sum of the segments, said adding means further being operative to add a suspense carry of value 1 to the second partial sum for generation of a second temporary result, and (3) final result determination means operative to generate a second final result by substracting a value 0 from said second temporary result in the presence of said carry signal and by subtracting a value 1 from said second temporary result in the absence of said carry signal.
Claim 2
Dependent Claim
334 words
A digital arithmetic unit for first and second binary numbers including a least significant adder and a plurality of adders arranged in cascade, each of said first and second binary numbers being subdivided into a plurality of segments, and (a) said least significant adder comprising: (1) carry lookahead means operative to produce a first carry signal representative of an actual carry based on one of the segments of said first binary number, a corresponding segment of said second binary number, and a dummy carry signal of value 0; (2) adding means operative to add the segment of said first binary number to the corresponding segment of said second binary number for generation of a first partial sum of the segments, said adding means further being operative to add a suspense carry of value 1 to the first partial sum for generation of a first temporary result; and (3) final result determination means operative to generate a first final result by subtracting a value 1 from said first temporary result (b) each of said adders comprising: (1) carry lookahead means operative to produce a second carry signal representative of an actual carry based on another segment of said first binary number, a corresponding segment of said second binary number and said carry signal fed from said least significant adder or said adder located at a lower position thereof, (2) adding means operative to add said another segment of said first binary number to the corresponding segment of said second binary number for generation of a second partial sum of the segments, said adding means further being operative to add a suspense carry of value 1 to the second partial sum for generation of a second temporary result, and (3) final result determination means operative to generate a second final result by substracting a value 0 from said second temporary result in the presence of said carry signal and by subtracting a value 1 from said second temporary result in the absence of said carry signal.
Claim 3
Dependent Claim
27 words
A digital arithmetic unit as set forth in claim 1 wherein each segment of said first and second numbers is constituted by a predetermined number of bits.
Claim 4
Dependent Claim
18 words
A digital arithmetic unit as set forth in claim 2, wherein said segment is constituted by four bits.
Claim 5
Dependent Claim
22 words
A digital arithmetic unit as set forth in claim 1, wherein said second binary number is the complement of a third number.
Claim 6
Dependent Claim
330 words
A digital arithmetic unit for first and second binary numbers including a least significant adder and a plurality of adders arranged in cascade, each of said first and second binary numbers being subdivided into a plurality of segments, (a) said least significant adder comprising: (1) carry lookahead means operative to produce a carry signal representative of an actual carry based on one of the segments of said first binary number, a corresponding segment of said second binary number, and a dummy carry signal of value 0; (2) adding means operative to add the segment of said first binary number to the corresponding segment of said second binary number for generation of a first partial sum of the segments, said adding means further being operative to add a suspense carry of value 0 to the first partial sum for generation of a first temporary result, and (3) final result determination means operative to generate a first final result by substracting a value 0 from said first temporary result, (b) each of said adders comprising: (1) carry lookahead means operative to produce a carry signal representative of an actual carry based on another segment of said first binary number, a corresponding segment of said second binary number and said carry signal fed from said least significant adder or said adder located at a lower position thereof; (2) adding means operative to add the segment of said first binary number to the corresponding segment of said second binary number for generation of a second partial sum of the segments, said adding means further being operative to add a suspense carry of value 0 to the second partial sum for generation of a second temporary result; and (3) final result determination means operative to generate a second final result by adding a value 1 to said second temporary result in the presence of said actual carry and by adding a value 0 to said second temporary result in the absence of said actual carry.
Claim 7
Dependent Claim
330 words
A digital arithmetic unit for first and second binary numbers including a least significant adder and a plurality of adders arranged in cascade, each of said first and second binary numbers being subdivided into a plurality of segments, (a) said least significant adder comprising: (1) carry lookahead means operative to produce a carry signal representative of an actual carry based on one of the segments of said first binary number, a corresponding segment of said second binary number, and a dummy carry signal of value 0; (2) adding means operative to add the segment of said first binary number to the corresponding segment of said second binary number for generation of a first partial sum of the segments, said adding means further being operative to add a suspense carry of value 0 to the first partial sum for generation of a first temporary result, and (3) final result determination means operative to generate a first final result by substracting a value 0 from said first temporary result, (b) each of said adders comprising: (1) carry lookahead means operative to produce a carry signal representative of an actual carry based on another segment of said first binary number, a corresponding segment of said second binary number and said carry signal fed from said least significant adder or said adder located at a lower position thereof; (2) adding means operative to add the segment of said first binary number to the corresponding segment of said second binary number for generation of a second partial sum of the segments, said adding means further being operative to add a suspense carry of value 0 to the second partial sum for generation of a second temporary result; and (3) final result determination means operative to generate a second final result by adding a value 1 to said second temporary result in the presence of said actual carry and by adding a value 0 to said second temporary result in the absence of said actual carry.
References Cited (Backward Citations)
US3316393A
Cited
US3993891A
Cited
US4139894A
Cited
US4203157A
Cited
US4525797A
Cited
US4639888A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-08-02 | 1992-02-01 | 1992-08-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-08-02 | 1996-02-01 | 1996-08-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-08-02 | 2000-02-01 | 2000-08-02 | $7700.00 | Window Closed / Lapsed |