Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
From MaRDI portal
Publication:2074348
DOI10.1016/J.DAM.2021.12.007OpenAlexW4220747421MaRDI QIDQ2074348FDOQ2074348
Authors: Ulrich Brenner, Anna Silvanus, Jannik Silvanus 
Publication date: 9 February 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.05550
Recommendations
- Faster carry bit computation for adder circuits with prescribed arrival times
- Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
- Fast prefix adders for non-uniform input arrival times
- Depth-size trade-offs for parallel prefix computation
- A new class of depth-size optimal parallel prefix circuits
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monotone Circuits for Connectivity Require Super-Logarithmic Depth
- Title not available (Why is that?)
- Parallel Prefix Computation
- Title not available (Why is that?)
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
- Title not available (Why is that?)
- Sharpening an upper bound on the adder and comparator depths
- Title not available (Why is that?)
- The delay of circuits whose inputs have specified arrival times
- Faster carry bit computation for adder circuits with prescribed arrival times
- Fast prefix adders for non-uniform input arrival times
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times
- Size-depth tradeoff in monotone Boolean formulae
- On the Addition of Binary Numbers
- Size-depth tradeoff in non-monotone Boolean formulae
- Title not available (Why is that?)
- Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
- Logic and discrete mathematics. A concise introduction
Uses Software
This page was built for publication: Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074348)
