A new class of depth-size optimal parallel prefix circuits
From MaRDI portal
Recommendations
Cited in
(17)- Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
- Finding optimal parallel prefix circuits with fan-out 2 in constant time
- A new approach to constructing optimal parallel prefix circuits with small depth
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- A class of almost-optimal size-independent parallel prefix circuits
- Minimal parallel prefix circuits
- scientific article; zbMATH DE number 3852437 (Why is no real title available?)
- Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
- Depth-size trade-offs for parallel prefix computation
- Parallel Prefix Computation
- scientific article; zbMATH DE number 140491 (Why is no real title available?)
- scientific article; zbMATH DE number 1307000 (Why is no real title available?)
- scientific article; zbMATH DE number 2065716 (Why is no real title available?)
- Mathematics of Program Construction
- On a class of cell circuits
- Limited width parallel prefix circuits
- Faster optimal parallel prefix circuits: new algorithmic construction
This page was built for publication: A new class of depth-size optimal parallel prefix circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964344)