2 papers
cs.DM2020
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…
cs.DS2020
Delay Optimization of Combinational Logic by And-Or Path Restructuring
Ulrich Brenner, Anna Hermann
We propose a dynamic programming algorithm that constructs delay-optimized circuits for alternating And-Or paths with prescribed input arrival times. Our algorithm fulfills best-kn…