Informatik pp 185-208 | Cite as

Performance Optimization of Combinational Circuits

  • Uwe Hinsberger
  • Reiner Kolla
Part of the TEUBNER-TEXTE zur Informatik book series (TTZI, volume 1)

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 formulation 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). Our approach can be considered as a discrete version of the transistor sizing problem on one hand and generalizes to the library mapping problem on the other hand. The paper presents optimal dynamic programming algorithms for trees and heuristics together with first experimental results for general combinational circuits.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    A.V. Aho and M.J. Corasick. Efficient string matching: An aid to bibliographic search. Communications of the ACM, Vol. 18, No. 6, pages 333–340, 1975.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    A.V. Aho, M. Ganapathi, and S.W.K. Tjiang. Code generation using tree matching and dynamic programming. ACM Transactions on Programming Languages and Systems, Vol. 11, No. 4, pages 491–516, 1989.CrossRefGoogle Scholar
  3. [3]
    A.V. Aho, S.C. Johnson, and J.D. Ullman. Code generation for expressions with common subexpressions. Journal of the Association for Computing Machinery, Vol. 24, No. 1, pages 146–160, 1977.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    M.R.C.M. Berkelaar and J.A.G. Jess. Gate sizing in mos digital circuits with linear programming. In Proceedings of the European Design Automation Conference (EDAC90), pages 217–221, 1990.Google Scholar
  5. [5]
    D.H.C. Du, S.H.C. Yen, and S. Ghanta. On the general false path problem in timing analysis. In Proceedings of the 26th Design Automation Conference (DAC89), pages 555–560, 1989.Google Scholar
  6. [6]
    L.A. Glasser and L.P.J. Hoyte. Delay and power optimization in vlsi circuits. In Proceedings of the 21st Design Automation Conference (DAC84), pages 529–535, 1984.CrossRefGoogle Scholar
  7. [7]
    K.S. Hedlund. Aesop: A tool for automated transistor sizing. In Proceedings of the 24th Design Automation Conference (DAC87), pages 114–120, 1987.Google Scholar
  8. [8]
    U. Hinsberger. Zellenbasierte Dimensionierung kombinatorischer Schaltkreise. Master’s thesis, Fachbereich Informatik, Universität des Saarlandes, Im Stadtwald, W-6600 Saarbrücken 11, FRG, 1990. 94 Seiten.Google Scholar
  9. [9]
    U. Hinsberger and R. Kolla. A cell based approach to performance optimization of combinational circuits. Technical Report 14/1989, Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelität, Fachbereich Informatik, Universität des Saarlandes, Im Stadtwald, W-6600 Saarbrücken 11, FRG, 1989.Google Scholar
  10. [10]
    U. Hinsberger and R. Kolla. Cell based performance optimization of combinational circuits. In Proceedings of the 1st European Design Automation Conference (EDAC90), pages 594–599, 1990.Google Scholar
  11. [11]
    C.M. Hoffmann and M.J. O’Donnell. Pattern matching in trees. Journal of the Association for Computing Machinery, Vol. 29, No. 1, pages 68–95, 1982.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    H.J. Hoover, M.M. Klawe, and N.J. Pippenger. Bounding fan-out in logical networks. Journal of the Association for Computing Machinery, Vol. 31, No. 1:13–18, 1984.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    K. Keutzer. DAGON: Technology binding and local optimization by DAG matching. In Proceedings of the 24th Design Automation Conference (DAC87), pages 341–347, June 1987.Google Scholar
  14. [14]
    Shen Lin and M. Marek Sadowska. A fast and efficient agorithm for determining fanout trees in large networks. In Proceedings of the 2nd European Design Automation Conference (EDAC91), pages 539–544, 1991.Google Scholar
  15. [15]
    Shen Lin, M. Marek Sadowska, and E.S. Kuh. Delay and area optimization in standard-cell design. In Proceedings of the 27th Design Automation Conference (DAC90), pages 349–352, 1991.Google Scholar
  16. [16]
    D.P. Marple and A. El Gamal. Optimal selection of transistor sizes in digital VLSI circuits. In Proceedings of Stanford Conference of Advanced Research in VLSI, pages 151–172, 1987.Google Scholar
  17. [17]
    P.C. McGeer and R.K. Brayton. Efficient algorithms for computing the longest viable path in a combinational network. In Proceedings of the 26th Design Automation Conference (DAC89), pages 161–567, 1989.Google Scholar
  18. [18]
    P.C. McGeer and R.K. Brayton. Provably corrext critical paths. In Decennial Caltech Conference on VLSI, 1989.Google Scholar
  19. [19]
    G. De Micheli. Performance-oriented synthesis of large-scale domino MOS circuits. IEEE Transactions on Computer Aided Design, CAD-6(5):751–764, 1987.CrossRefGoogle Scholar
  20. [20]
    M. Matson. Optimization of digital MOS VLSI circuits. In Proceedings of the Chapel Hill Conference on VLSI, pages 109–126, May 1985.Google Scholar
  21. [21]
    L. Nagel. A computer program to simulate semiconductor circuits. Technical Report ERL-520, University of California at Berkeley, 1975.Google Scholar
  22. [22]
    F.W. Obermeier and R.H. Katz. An electrical optimizer that considers physical layout. In Proceedings of the 25st Design Automation Conference (DAC88), pages 453–459, June 1988.Google Scholar
  23. [23]
    J.K. Ousterhout. Crystal: A timing analyser for nMOS VLSI circuits. In R. Bryant, editor, Proceedings of the Third Caltech Conference on VLSI, pages 57–70. Computer Science Press, 1983.Google Scholar
  24. [24]
    R. Rudell. Logic Synthesis for VLSI Design. PhD thesis, University of California, Berkeley, April 1989.Google Scholar
  25. [25]
    K.J. Singh and A. Sangiovanni-Vincentelli. A heuristic algorithm for the fanout problem. In Proceedings of the 27th Design Automation Conference (DAC90), pages 357–360, 1990.Google Scholar
  26. [26]
    H. Touati, C. Moon, R. Brayton, and A. Wang. Performance-oriented technology mapping. In Proceedings of the MIT VLSI Conference, 1990.Google Scholar
  27. [27]
    C.H.A. Wu, N. Vander Zanden, and D. Gajski. A new algorithm for transistor sizing in CMOS circuits. In Proceedings of the European Design Automation Conference (EDAC90), pages 589–592, 1990.Google Scholar
  28. [28]
    S. Yang. Logic synthesis and optimization benchmarks user guide (version 3.0). Technical report, Microelectronics Center of North Carolina, P.O. Box 12889, Research Triangle Park, NC 27709, January 1991.Google Scholar

Copyright information

© B. G. Teubner Verlagsgesellschaft, Leipzig 1992

Authors and Affiliations

  • Uwe Hinsberger
    • 1
  • Reiner Kolla
    • 1
  1. 1.Institut für Informatik - Abteilung VIRheinische Friedrich-Wilhelms-UniversitätBonnGermany

Personalised recommendations