Advertisement

Journal of Computer Science and Technology

, Volume 6, Issue 1, pp 37–46 | Cite as

Standard-cell placement from functional descriptions

  • Klaus Buchenrieder 
Regular Papers

Abstract

This paper presents a functional language for the unambiguous description of digital circuits, a method and algorithms to obtain a standard-cell layout, and a comparative evaluation of the developed functional standard-cell placement technique. The presented placement scheme is different from traditional methods because the complete layout geometry is specified and constructed automatically from a functional description. The construction relies on a translation that combines the simplicity of standard-cells with the elegance of functional programming. An evaluation of the method introduced shows that the quality of the resulting placement is close to the results achieved with simulated annealing while the computation time is significantly less. Furthermore, the evaluation suggests to employ the functional placement method in conjunction with low-temperature simulated annealing for running-time reduction and improved-results.

Keywords

Functional Description Digital Clock Automatic Placement Functional Placement Common Subexpression Elimination 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H. Hörbst, M. Nett and H. Schwärzel, Venus-Entwurf von VLSI-Schaltungen. Springer Verlag, 1986.Google Scholar
  2. [2]
    S. Sahni and A. Bhatt, The Complexity of Design Automation Problems. Proc. 17th DAC., 1980. 402–411.Google Scholar
  3. [3]
    M. Hartoog, Analysis of Placement Procedures for VLSI Standard Cell Layout. Proc. 23rd DAC., 1986, 314–319.Google Scholar
  4. [4]
    B. Preas and P. Karger, Automatic Placement a Review of Current Techniques. Proc. 23rd DAC., 1986, 622–629.Google Scholar
  5. [5]
    K. Buchenrieder, A Standard-Cell Placement Tool for the Translation of Behavioral Descriptions into Efficient Layouts. PhD. Dissertation, The Ohio State University, 1988.Google Scholar
  6. [6]
    K. Buchenrieder and P. Sadayappan, Placement of Standard-Cells from Functional Descriptions. Proc. EURD ASIC, 1989, 436–450.Google Scholar
  7. [7]
    S. Kirkpartrick, C. Gelatt and M. Vecci, Optimization by Simulated Annealing.SCIENCE,220 4598(May 1983), 671–680.CrossRefMathSciNetGoogle Scholar
  8. [8]
    C. Sechen, The Timberwolf placement and routing package.IEEE Journal of Solid-State Circuits, SC-20: 2 (April 1985), 510–522.CrossRefGoogle Scholar
  9. [9]
    A. Aho, R. Sethi and J. Ullman, A formal approach to code optimization.SIGPLAN Notices, 5 (1970), 86–100,CrossRefGoogle Scholar
  10. [10]
    A.Aho and J. Ullman, The Theory of Parsing, Translation and Compiling. Prentice-Hall, 1973.Google Scholar
  11. [11]
    D. Patel, M. Schlag and M. Ergegovac, μFP: An Environment for the Multi-Level Specification, Analysis, and Synthesis of Hardware Algorithms. Technical Report, University of California.Google Scholar
  12. [12]
    S. Johnson, Synthesis of Digital Designs from Recursion Equations. PhD Thesis, Indiana University, 1983.Google Scholar
  13. [13]
    J. Darringer, W. Joyner, L. Berman and L. Trevillyan, Logic synthesis through local transformations.IBM J. RES. Develop.,25: 4(1981), 272–280.CrossRefGoogle Scholar
  14. [14]
    J. Darringer, D. Brand, W. Joyner and L. Trevillyan, LSS: A System for Production Logic Synthesis. Technical Report, IBM Laboratories, RC 10577 (# 47021), 1984.Google Scholar
  15. [15]
    A. Tannenbaum, H. Staveren and J. Stevenson, Using Pcephole Optimizations on Intermediate Code. Transactions on Programming Languages, 1982 21–36.Google Scholar
  16. [16]
    R. Raghavan and S. Sahni, Optimal Single Row Router. Proc. 19th DAC., 1982, 38–45.Google Scholar
  17. [17]
    L. Grover, Simulated Annealing Using Approximate Calculations. Technical Report, AT & T Bell Laboratories, Murray Hill NJ, 1987.Google Scholar
  18. [18]
    L. Grover, GRIM: A Fast Simulated Annealing Program for Standard Cell Placement. Technical Report, AT & T Bell Laboratories, Murray Hill NJ, 1987.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1991

Authors and Affiliations

  • Klaus Buchenrieder 
    • 1
  1. 1.Ottobrunn/RGermany

Personalised recommendations