Formal Proof for a General Architecture of Hybrid Prefix/Carry-Select Adders


In this paper, we present a general architecture of hybrid prefix/carry-select adder. Based on this architecture, we formalize the hybrid adder’s algorithm using the first-order recursive equations and develop a proof framework to prove its correctness. Since several previous adders in the literature are special cases of this general architecture, our… (More)
DOI: 10.1007/978-3-642-13119-6_17


5 Figures and Tables

Slides referencing similar topics