On the complexity of parallelizing sequential circuits using the parallel-prefix method

DOI10.1109/81.956018zbMath0999.94578OpenAlexW2149917325MaRDI QIDQ4540097

Christoforos N. Hadjicostis

Publication date: 21 July 2002

Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/46cfc8c1a0cd34ac820d86de93da954f0187b449

zbMATH Keywords

parallel processingsequential circuitsfinite-state machineprefix problemdiscrete-time iteration boundparallel-prefix method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)