A Spanning Tree Carry Lookahead Adder
IEEE Transactions on Computers - Special issue on computer arithmetic
A Recursive Carry-Lookahead/Carry-Select Hybrid Adder
IEEE Transactions on Computers
Mechanical Verification of Adder Circuits using Rewrite RuleLaboratory
Formal Methods in System Design
A fast hybrid carry-lookahead/carry-select adder design
GLSVLSI '01 Proceedings of the 11th Great Lakes symposium on VLSI
Computer Arithmetic Algorithms
Computer Arithmetic Algorithms
A Reduced-Area Scheme for Carry-Select Adders
IEEE Transactions on Computers
Derivation of a logarithmic time carry lookahead addition circuit
Journal of Functional Programming
A Regular Layout for Parallel Adders
IEEE Transactions on Computers
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
IEEE Transactions on Computers
Proofs of Correctness and Properties of Integer Adder Circuits
IEEE Transactions on Computers
Hi-index | 0.00 |
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 methodology can be used to prove the correctness of different hybrid prefix/carry-select adders The formal proof for a special hybrid prefix/carry-select adder shows the effectiveness of the algebraic structures built in this paper.