US4815019A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Fast ALU equals zero circuit
Assignee: Texas Instruments Inc
•
Filing: 1987-02-26
•
Granted: 1989-03-21
•
Expires: 2007-02-26
Abstract
Abstract A fast ALU=0 circuit is used with a carry-select lookahead ALU. Preliminary ALU=0 signals are derived for each section of the ALU prior to a carry in signal being received by that section. When the carry in signal is received, a final comparison is made with the least significant bit of the section and the final ALU=0 signal generated. The ALU=0 computation is complete one gate delay after the ALU computation is complete.
Inventors
- 👤 Patrick W. Bosshart
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 01:25
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/57; G06F7/575; G06F7/02
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
253 words
A method for determining whether the result of an ALU computation is zero, comprising the steps of: (A) grouping bits of the ALU into preselected sections, each section containing a plurality of adjacent ALU bits; (B) applying input numbers to the ALU; (C) providing a carry in signal for the preselected section containing the least significant ALU bits; (D) for each preselected section of bits, performing the following substeps (a)-(h): (a) computing a result for the preselected section of bits under the assumption that a carry in signal will be 0; (b) computing a result for the same preselected section of bits under the assumption that a carry in signal will be 1; (c) determining if all bits, except the least significant bit, of the result of step (b) are equal to 0; (d) receiving a carry in signal; (e) using the signal of step (d) to select the result of step (a) or step (b); (f) determining if the least significant bit selected in step (e) is 0; (g) if steps (c) and (f) both indicate that the result bits are 0, then indicating that the selected result of this preselected section of bits is 0; and (h) if either of steps (c) and (f) indicate one or more bits not equal to 0, then indicating that the selected result of this preselected section of bits is not 0; and (E) combining the results of steps (g) and (h) for each preselected section to indicate whether the overall ALU result is zero.
Claim 2
Independent Claim
253 words
A method for determining whether the result of an ALU computation is zero, comprising the steps of: (A) grouping bits of the ALU into preselected sections, each section containing a plurality of adjacent ALU bits; (B) applying input numbers to the ALU; (C) providing a carry in signal for the preselected section containing the least significant ALU bits; (D) for each preselected section of bits, performing the following substeps (a)-(h): (a) computing a result for the preselected section of bits under the assumption that a carry in signal will be 0; (b) computing a result for the same preselected section of bits under the assumption that a carry in signal will be 1; (c) determining if all bits, except the least significant bit, of the result of step (b) are equal to 0; (d) receiving a carry in signal; (e) using the signal of step (d) to select the result of step (a) or step (b); (f) determining if the least significant bit selected in step (e) is 0; (g) if steps (c) and (f) both indicate that the result bits are 0, then indicating that the selected result of this preselected section of bits is 0; and (h) if either of steps (c) and (f) indicate one or more bits not equal to 0, then indicating that the selected result of this preselected section of bits is not 0; and (E) combining the results of steps (g) and (h) for each preselected section to indicate whether the overall ALU result is zero.
Claim 3
Dependent Claim
23 words
The method of claim 1, wherein the preselected sections are grouped to have, from least significant to most significant, non-decreasing numbers of bits.
Claim 4
Dependent Claim
62 words
The method of claim 2, wherei the two preselected sections having the least significant bits each have N bits, the preselected group having the next most significant bits has N+1 bits, and each next preselected group of more significant bits, except for the preselected group of most significant bits, has 1 more bit than the previous preselected group of less significant bits.
Claim 5
Dependent Claim
28 words
The method of claim 3, wherein the preselected group of most significant bits has less than 1 more bit than the previous preselected group of less significant bits.
Claim 6
Dependent Claim
222 words
A carry-select lookahead ALU capable of determining whether the AU result from an operation is 0, comprising; a plurality of sections, wherein each section contains a plurality of adjacent ALU bits and performs ALU operations thereon, wherein each section receives a carry in signal from any previous section operating on less significant bits and generates a carry out signal to any next section operating on more significant bits, and wherein each section computes a result assuming that the carry in will be 1 and a result assuming that the carry in will be 0, and selects the correct result when the actual carry in signal is received; combinational logic, in each section, coupled to all bits of the section result which assumes the carry in signal will be 1, except the least significant bit of the section, for indicating whether those bits in that section are all 0; and output signal logic, in each section, coupled to the combinational logic of that section, the least significant bit of the section result after the actual carry in signal is received, and to any output signals from the previous section operating on less significant bits, said output signal logic generating an output signal indicating whether all ALU bits of less or equal significance to the most significance bit of the section are all 0.
Claim 7
Dependent Claim
222 words
A carry-select lookahead ALU capable of determining whether the AU result from an operation is 0, comprising; a plurality of sections, wherein each section contains a plurality of adjacent ALU bits and performs ALU operations thereon, wherein each section receives a carry in signal from any previous section operating on less significant bits and generates a carry out signal to any next section operating on more significant bits, and wherein each section computes a result assuming that the carry in will be 1 and a result assuming that the carry in will be 0, and selects the correct result when the actual carry in signal is received; combinational logic, in each section, coupled to all bits of the section result which assumes the carry in signal will be 1, except the least significant bit of the section, for indicating whether those bits in that section are all 0; and output signal logic, in each section, coupled to the combinational logic of that section, the least significant bit of the section result after the actual carry in signal is received, and to any output signals from the previous section operating on less significant bits, said output signal logic generating an output signal indicating whether all ALU bits of less or equal significance to the most significance bit of the section are all 0.
Claim 8
Dependent Claim
29 words
The ALU of claim 5, wherein said combinational logic logically ORs the result bits, and wherein said output signal logic logically ORs its inputs to generate its output signal.
References Cited (Backward Citations)
US3983382A
Cited
US4638450A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-03-20 | 1992-09-19 | 1993-03-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-03-20 | 1996-09-19 | 1997-03-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-03-20 | 2000-09-19 | 2001-03-21 | $7700.00 | Window Closed / Lapsed |