2 citations · 5 across the 7 of their papers we have counts for
Showing cs.ARShow all
2 papers · 1 filter
cs.AR2015
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
Stephan Held, Sophie Theresa Spirkl
We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes t…
cs.AR2014
Fast Prefix Adders for Non-Uniform Input Arrival Times
Stephan Held, Sophie Spirkl
We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. This problem arises whenever the adder is embedded into a more co…