Optimized binary adder and comparator having an implicit constant for an input
US5394351A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Mar 11, 1994 |
| Grant date | Feb 28, 1995 |
| Priority date | — |
| Expiry date | Mar 11, 2014 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F7/026
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A three-input comparator, where one of the inputs is an implicit constant, is formed with a special carry-save adder (CSA) followed by carry propagation circuitry. The special CSA uses two different bit cells depending upon whether that bit position in the constant input is a one or a zero. The three-input comparator can be modified to be a three-input adder by using a full carry-propagate adder (CPA). By taking into account a priori restrictions on the possible input operands, these arithmetic circuits are smaller and more efficient than conventional adders and comparators, which must be designed to deal with all possible input operands.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.