Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1500412.1500415acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free access

A computer-aided VLSI layout system

Published: 04 May 1981 Publication History

Abstract

The VLSI layout system is suggested as a practical approach for solving large and complex problems introduced by today's VLSI technology. Computer-based design aids are introduced which are utilized to effectively reduce design time and to increase product quality. A hierarchical description of VLSI circuits is utilized to partition the problem into manageable tasks. Each phase of the VLSI chip design cycle is discussed with special emphasis on layout techniques. The hierarchical VLSI layout system is applicable to the design of "semicustom" or master-slice VLSI circuits. The placement and placement optimization portions of the proposed system have been implemented. Routing and routing optimization techniques are currently being developed.

References

[1]
"Computer-aided MOS VLSI Layout System." Electrical Engineering Department, The University of Texas at Austin, February 1980. (Prepared under the direction of R. J. Smith, II, by D. LaPlante, R. Tsui, W. Dees, W. Rogers, H. Bryce, B. D. Rathi, K. Parmar, T. Gunter, and C. Hobbs.)
[2]
Breuer, Melvin A. "A Class of Min-Cut Placement Algorithms." Proc. 14th Design Automation Conference, June 1977, pp. 284--290.
[3]
Lynn, Conway, and Carver Mead. Introduction to VLSI Systems. California: Addison-Wesley, 1979.
[4]
Corrigan, Lorretta I., "A Placement Capability Based on Partitioning." Proc. 16th Design Automation Conference, June 1979, pp. 406--413.
[5]
Deutsch, David N. "A 'Dogleg' Channel Router." Proc. 13th Design Automation Conference, June 1976, pp. 425--433.
[6]
Hashimoto, Akhiro, and James Stevens. "Wire Routing by Optimizing Channel Assignment Within Large Apertures," Proc. 8th Design Automation Workshop, June 1971, pp. 155--169.
[7]
Hightower, David W. "A Solution to Line-Routing Problems on the Continuous Plane." Proc. 6th Design Automation Workshop, June 1969, pp. 1--24.
[8]
Klomp, J. G. M. "CAD for LSI---Production's Interest Is in Its Economics," ACM SIGDA Newsletter, 6 (1976), pp. 11--15.
[9]
Koller, Konrad W., and Ulrich Lauther. "The Siemens-AVESTA-System for Computer-Aided Design of MOS-Standard Cell Circuits." Proc. 14th Design Automation Conference, June 1977, pp. 153--157.
[10]
Lauther, Ulrich. "A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation." Proc. 16th Design Automation Conference, June 1979, pp. 1--10.
[11]
Lee, C. Y. "An Algorithm for Path Connections and its Applications." IRE Transactions on Electronic Computers, September 1961, pp. 346--365.
[12]
Losleben, Paul, and Kathryn Thompson. "Topological Analysis for VLSI Circuits." Proc. 16th Design Automation Conference, June 1979, pp. 461--473.
[13]
Oakes, M. F. "The Complete VLSI Design System." Proc. 16th Design Automation Conference, June 1979, pp. 452--460.
[14]
Persky, G., Deutsch, D. N., and D. G. Schweikert. "LTX---A System for the Directed Automatic Design of VLSI Circuits." Proc. 13th Design Automation Conference, June 1976, pp. 399--407.
[15]
Preas, B. T., and C. W. Gwyn. "Methods for Hierarchical Automated Layout of Custom LSI Circuit Masks." Proc. 15th Design Automation Conference, June 1978, pp. 206--212.
[16]
Preas, B. T., and W. M. vanCleemput. "Placement Algorithms for Arbitrary Shaped Blocks." Proc. 16th Design Automation Conference, June 1979, pp. 474--480.
[17]
Hightower, D. W., and R. L. Boyd. "A Generalized Channel Router." Proc. 17th Design Automation Conference, June 1980, pp. 12--21.

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '81: Proceedings of the May 4-7, 1981, national computer conference
May 1981
736 pages
ISBN:9781450379212
DOI:10.1145/1500412
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]

Sponsors

  • AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 May 1981

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 119
    Total Downloads
  • Downloads (Last 12 months)53
  • Downloads (Last 6 weeks)4
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

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