Browsing Mathematics (Faculty of) by Author "Held, Stephan"

Now showing items 1-2 of 2

Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two

Held, Stephan; Spirkl, Sophie (Association for Computing Machinery, 2018-01)

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 the carry bits for two n-bit numbers (where ...
Fast Prefix Adders for Non-uniform Input Arrival Times

Held, Stephan; Spirkl, Sophie (Springer Nature, 2017)

We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. In modern computer chips, adders with up to hundreds of inputs occur frequently, and they are often embedded ...