Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2004-06-28
2008-11-04
Malzahn, David H (Department: 2193)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
07447727
ABSTRACT:
A recursive carry-select substitution operation is used to optimize the design of an incrementer and similar logic devices. A carry look-ahead incrementer features XOR gates in which the XOR gates in one or more MSBs of the incrementer can be pushed back by substituting an equivalent carry-select circuit, the carry-select circuit including a multiplexer. The push back operations occur until both inputs of the XOR gates are fed by inverters, allowing an entire stage of inverters to be eliminated in the circuit. Where a bit path includes a buffer comprising two inverters, the inverter size is selected so as to execute as a single stage. The result is a carry look-ahead incrementer in which a stage is eliminated.
REFERENCES:
patent: 6347327 (2002-02-01), Petro et al.
patent: 6591286 (2003-07-01), Lu
patent: 6665698 (2003-12-01), Tsai et al.
patent: 2004/0015534 (2004-01-01), Motoyama et al.
Boone P.C. Carrie A.
Intel Corporation
Malzahn David H
LandOfFree
Recursive carry-select topology in incrementer designs does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Recursive carry-select topology in incrementer designs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursive carry-select topology in incrementer designs will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4051253