The applicability of discrete performance estimation methods to VLSI design

DOI10.1007/BF01211303MaRDI QIDQ2366696zbMATH OpenFDO

Authors Yanyan Li, Alan Williams

Publication date 18 August 1993

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01211303

zbMATH Keywords

asymptotic complexity resultsdiscret high-level VLSI complexity modelsperformance estimationspecification of synchronous concurrent algorithmsVLSI design

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Circuits, networks (94C99)

Recommendations

• scientific article; zbMATH DE number 3847304
• On the VLSI complexity of some arithmetic and numerical problems
• Performance planning
• scientific article; zbMATH DE number 4102489
• A model of computation for VLSI with related complexity results

Cites work

• A model of computation for VLSI with related complexity results
• A Regular Layout for Parallel Adders
• The Area-Time Complexity of Binary Multiplication

This page was built for publication: The applicability of discrete performance estimation methods to VLSI design

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