Formal proof of integer adders using all-prefix-sums operation

DOI10.1007/s11432-011-4331-7zbMath1270.65086OpenAlexW2256816214MaRDI QIDQ362271

Qingping Tan, Otmane Ait Mohamed, Feng Liu

Publication date: 20 August 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4331-7

zbMATH Keywords

VLSIcomputer arithmeticinteger adderprefix computationsemi-group

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cites Work

• Unnamed Item
• 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
• FUNCTIONAL PEARL Derivation of a logarithmic time carry lookahead addition circuit
• Proofs of Correctness and Properties of Integer Adder Circuits
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations