High Speed Binary Adder
Original Publication Date: 1981-Jun-01
Included in the Prior Art Database: 2005-Feb-11
Based on the bit pair (a(i)b(i) truth table, the carry propagate, p(i) carry generate, g(i), have dominated the carry look-ahead formation process for more than two decades. A new scheme is disclosed where the carry propagation is discussed and examined by including the neighboring pairs (a(i), b(i), a(i+1)). The disclosed algorithm not only reduces the component count in design, but also requires fewer logic levels in adder implementation. In addition, the algorithm offers uniform loading in fan-in and fan-out nesting.