| 摘要 |
<p>A carry-look-ahead adder (30) for adding an addend (4) and an augend (6) and generating a final sum (8). The addend, augend, and final sum are binary numbers, each having a plurality of bits. Bits of the same order in the addend and the augend are organized into columns. The adder has at least one data reduction stage, each data reduction stage having at least one multi-column full adder. The data reduction stages use the columns of addend and augend bits to generate a reduced addend (38) and a reduced augend (40), with the reduced augend having fewer bits than the augend. A generate/propagate calculation stage (34) then uses the reduced addend and the reduced augend for calculating generate (42) and propagate data (44), the generate/propagate calculation stage having been modified to account for the reduction of the addend and augend. A carry-generate stage (36) then uses the generate and propagate data to generate at least one final carry (48). Finally, a final sum calculation stage uses the reduced addend, the reduced augend, and the final carries for calculating the final sum. The data reduction stages reduce the inputs to the generate/propagate calculation stage thereby reducing the number of inputs to the carry-generate circuit. With fewer inputs, the number of stages in the carry-generate circuit can be reduced, thus resulting in a faster implementation of the carry-look-ahead adder.</p> |
