skip to main content
10.1145/299996.300038acmconferencesArticle/Chapter ViewAbstractPublication PagesispdConference Proceedingsconference-collections
Article
Free Access

Gate sizing with controlled displacement

Authors Info & Claims
Published:12 April 1999Publication History
First page image

References

  1. 1.J.Lou, A.Salek, M.Pedram, "An Exact Solution to Simultaneous Technology Mapping and Linear Placement Problem", Proc. Intl. Conf. on CAD, pp.671-675, Nov 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.A~Salek, J.Lou, M.Pcdram, ''A Simultaneous Routing Tree and Fanout Optimization Algorithm", Proc. Intl. Conf. on CAD, pp.625- 630, Nov 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.O.Coudert, R. Haddad, "New Algorithms for Gate Sizing: a Conggtmtive Study% Proc. 33"d DAC, pp.734-739, Jun 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.J.P.Ftshbum, A.E.Du~op, 'TILOS: a Posynomial Programming Approach to Transistor Sizing% Proc. Intl. Conf. on CAD, pp.326- 328, Nov 1985.Google ScholarGoogle Scholar
  5. 5.M. Berkelaar, J. Jess, "Gate Sizing in MOS Digital Circuits with Linear Programming% Proc. European DA C, pp.217-221, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.C.P.Chen, C.C.N.Chu, D.F.Wong, "Fast and Exact Simultaneous Gate and Wire Sizing by Lagrangian Relaxation", Proc. Intl. Conf. on CAD, pp.617~624. Nov 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7."National Technology Roadmap % Semiconductor Industry Association, 1997.Google ScholarGoogle Scholar
  8. 8.W. Chuang, LN.Hajj, "Delay and Area Optimization for Compact Placement by Gate Resizing and Relocation", Proc. Intl. Conf. on CAD, pp. 145-148, Nov 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.F.R.K.Chung, F.K.Hwang, 'The Largest Minimal Rectilinear Steiner Trees for a Set of N Points Enclosed in a Rectangle with Given Perimeter", "Networks'; 9:19-36, 1979.Google ScholarGoogle ScholarCross RefCross Ref
  10. 10.D.Luenberger, "Linear and Nonlinear Programming", pp.180, 1984.Google ScholarGoogle Scholar
  11. 11.J.M.Kleinhans, G.Sigl, F.M.Johannes, K.J.Antreich, "GORDIAN: VI.~I Placement by Quadratic Progmnmffng and Slicing Optimization'; IEEE Trans. on Computer-Aided Design, vol.10, No.3, pp.356-365, Mar 1991.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.B.M. Riess, G.G. Ettelt, "SPEED: Fast and Efficient Timing Driven Placement", Proc. Intl. Symposium Of Circuits and Systems, pp.377- 380, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  13. 13.M. Berkelaar, "Area-Power-Delay Trade-off in Logic Synthesis~, Ph.D Thesis, Eindhoven University of Technology, 1992.Google ScholarGoogle Scholar
  14. 14.P.lLChan, "Algorithms for Library-specific Sizing of Combinational Logic'; Proc. 2~h DAC, pp.353-356, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.C.Beightler, D.T.Philips, "Applied Geometric Programming'; 1976.Google ScholarGoogle Scholar
  16. 16.K. O. Kortanek, X. Xu, Y.Ye, "An infeasible interior-point algorithm for solving primal and dual geometric programs~, Mathematical Programming 76, pp.t55-181, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.M.Avriel, R.Dembo, U.Passy, "Solution of Generalized Geometric Programming", International Journal for Numerical Methods in Engineering, vol.9, 1975.Google ScholarGoogle ScholarCross RefCross Ref
  18. 18.RJ. Duffin, "Linearizing Geometric Programs", SIAM Review, vol. 12, pp.211-237, 1970.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Gate sizing with controlled displacement

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              ISPD '99: Proceedings of the 1999 international symposium on Physical design
              April 1999
              223 pages
              ISBN:1581130899
              DOI:10.1145/299996

              Copyright © 1999 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 12 April 1999

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate62of172submissions,36%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader