Constructing Depth-Optimum Circuits for Adders and AND-OR Paths

Ulrich Brenner, Anna Hermann, Jannik Silvanus

We examine the fundamental problem of constructing depth-optimum circuits for binary addition. More precisely, as in literature, we consider the following problem: Given auxiliary…