A new approach to constructing optimal parallel prefix circuits with small depth

DOI10.1016/J.JPDC.2003.09.004MaRDI QIDQ1878701zbMATH OpenOpenAlexFDO

Authors Yen-Chun Lin, Jun-Wei Hsiao

Publication date 8 September 2004

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2003.09.004

zbMATH Keywords

combinational circuit model

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Faster optimal parallel prefix circuits: new algorithmic construction
• scientific article; zbMATH DE number 2065716
• Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
• A new class of depth-size optimal parallel prefix circuits
• Depth-size trade-offs for parallel prefix computation

Cited in

(5)

• Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
• Faster optimal parallel prefix circuits: new algorithmic construction
• A class of almost-optimal size-independent parallel prefix circuits
• scientific article; zbMATH DE number 1307000 (Why is no real title available?)
• scientific article; zbMATH DE number 2065716 (Why is no real title available?)

This page was built for publication: A new approach to constructing optimal parallel prefix circuits with small depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878701)