skip to main content
10.5555/949970.950104acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article
Free access

Cell based performance optimization of combinational circuits

Published: 12 March 1990 Publication History

Abstract

Performance optimization, i.e. the problem of finding an optimal investment of transistor area which meets given delay constraints, is considered from an abstract, cell based point of view which allows only solutions within a discrete solution space of coarse granularity. The main advantages of this problem modelling are the independence of the methods from concrete delay modelling (and thus from technology) and the applicability to even very restrictive design styles (as for example gate arrays or sea of gates). The paper contains a classification of the computational complexity of the performance optimization problem as well as efficient algorithms (where they exist), heuristics and experimental results.

References

[1]
B. Becker, G. Hotz, R. Kolla, P. Molitor, and H. G. Osthof. Hierarchical design based on a calculus of nets. In Proc. of the 24th Des. Autom. Conf., pages 649--653, 1987.
[2]
B. Becker and R. Kolla. On the construction of optimal time adders. In Proc. of the 5th Ann. Symp. on Theoretical Aspects of Comp. Sc., 1988.
[3]
L. A. Glasser and L. P. J. Hoyte. Delay and Power Optimization in VLSI Circuits. In Proc. of the 21st Des. Autom. Conf., pages 529--535, 1984.
[4]
K. S. Hedlund. Aesop: A Tool for Automated Transistor Sizing. In Proc. of the 24th Des. Autom. Conf., pages 114--120, 1987.
[5]
U. Hinsberger. Zellenbasierte Dimensionierung kombinatorischer Schaltkreise. Master's thesis, Universitát des Sarrlandes, Saarbrucken, 1989.
[6]
U. Hinsberger and R. Kolla. A cell based approach to performance optimization of combinational circuits. Tech. Report TR-14, SFB124-B1, Saarbrucken, 1989.
[7]
D. P. Marple and A. El Gamal. Optimal Selection of Transistor Sizes in digital VLSI Circuits. Technical Report, Stanford University, 1987.
[8]
K. Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theor. Comp. Sc., Springer-Verlag, 1984.
[9]
L. Nagel. A Computer Program to Simulate Semiconductor Circuits. Technical Report ERL-520, University of California at Berkeley, 1975.
[10]
J. K. Ousterhout. Crystal: A Timing Analyser for nMOS VLSI Circuits. In R. Bryant, Editor, Proc. of the Third Caltech Conf. on VLSI, pages 57--70, 1983.
[11]
N. Weste and K. Eshraghian. Principles of CMOS VLSI Design. VLSI Systems Series, Addison Wesley, 1985.

Cited By

View all
  1. Cell based performance optimization of combinational circuits

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    EURO-DAC '90: Proceedings of the conference on European design automation
    March 1990
    659 pages
    ISBN:0818620242
    • General Chair:
    • Gordon Adshead,
    • Program Chair:
    • Jochen Jess

    Sponsors

    Publisher

    IEEE Computer Society Press

    Washington, DC, United States

    Publication History

    Published: 12 March 1990

    Check for updates

    Qualifiers

    • Article

    Upcoming Conference

    DAC '25
    62nd ACM/IEEE Design Automation Conference
    June 22 - 26, 2025
    San Francisco , CA , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)20
    • Downloads (Last 6 weeks)3
    Reflects downloads up to 15 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media