Formal proof of prefix adders

DOI10.1016/J.MCM.2010.02.008zbMath1201.68163OpenAlexW2087431822MaRDI QIDQ611751

Feng Liu, Qingping Tan, Gang Chen

Publication date: 14 December 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2010.02.008

zbMATH Keywords

VLSIcomputer arithmeticsemi-groupprefix adders

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computability and recursion theory (03D99)

Related Items (1)

Functional verification of high performance adders in \textsc{Coq}

Cites Work

• Unnamed Item
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations
• Parallel Prefix Computation
• A Regular Layout for Parallel Adders
• Proofs of Correctness and Properties of Integer Adder Circuits
• Mathematics of Program Construction
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

This page was built for publication: Formal proof of prefix adders