High-Speed Binary Adder

Publisher Website
Google Scholar
Abstract
Based on the bit pair (ai, bi) truth table, the carry propagate pi and carry generate gi have dominated the carry-look-ahead formation process for more than two decades. This paper presents a new scheme in which the new carry propagation is examined by including the neighboring pairs (ai, bi; ai+1, bi+1). This scheme not only reduces the component count in design, but also requires fewer logic levels in adder implementation. In addition, this new algorithm offers an astonishingly uniform loading in fan-in and fan-out nesting.
Keywords

This publication has 0 references indexed in Scilit: