Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
1999-12-29
2002-08-27
Siek, Vuthe (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
06442745
ABSTRACT:
TECHNICAL FIELD OF THE INVENTION
The invention relates to the design and layout of integrated circuits and, in particular, to methods and apparatus for constraining global routing of an integrated circuit layout.
BACKGROUND OF THE INVENTION
In the field of integrated circuit (IC) development, there is an ever-increasing demand for IC layout tools that are faster, more efficient, and more reliable than their predecessors. This is because there is an ever-accelerating focus upon shortening IC development cycles and time to market, reducing IC development and manufacturing costs, and increasing IC product reliability.
As is well known to IC developers, a process known as “global routing” can be used to route the interconnections (also called “nets”) between terminals on an IC. Global routing uses a divide-and-conquer approach, wherein an IC layout is divided into a rectilinear grid of global routing cells (also called “artificial regions” or “ARs”), and the router plans global routes for the nets in a rectilinear fashion using the cells. Within the global routing cells, detailed routing of nets is generated based upon the global routes.
Global routers often require successive iterations of the routing process until the layout meets a desired set of design specifications. While global routing achieves high density, it often provides poor controllability. Successive iterations of global routing with small changes to the layout may result in large changes to the routing. This is undesirable, because it can result in a failure to achieve timing convergence of the routing. Because the circuit interconnect contributes significantly to timing delays in the IC circuits, the changes in topology can lead to large changes in the timing delays of circuits. Thus, in order to achieve timing convergence of routing, successive iterations should not cause large changes in the timing delays of circuits.
For the reasons stated above, there is a substantial need in the area of IC layout to provide a global routing system and methods that do not cause large changes in the timing delays of circuits on successive iterations.
In addition, there is a substantial need to provide an IC having a layout that has been generated by a system and methods that do not cause large changes in the timing delays of the IC's circuits on successive iterations.
SUMMARY OF THE INVENTION
Accordingly, in one embodiment of the invention there is provided a method adapted to be used in a data processing system. The method includes defining a set of constraints for global routing of an integrated circuit layout. The set of constraints comprises at least one topological constraint. The method also includes performing global routing in accordance with the set of constraints.
In another embodiment, there is provided a data processing system comprising a processor and a memory. The processor executes a computer program stored in the memory. The computer program includes the operation of accessing from the memory a set of constraints for global routing of an integrated circuit layout. The set of constraints comprises at least one topological constraint. The computer program also includes the operation of performing global routing in accordance with the set of constraints.
In a further embodiment, there is provided an integrated circuit having a layout generated by a process which comprises defining a set of constraints for global routing of the integrated circuit layout. The set of constraints comprises at least one topological constraint. The process further includes performing global routing in accordance with the set of constraints.
Additional embodiments are described and claimed.
REFERENCES:
patent: 4613941 (1986-09-01), Smith et al.
patent: 5604680 (1997-02-01), Bamji et al.
patent: 5629860 (1997-05-01), Jones et al.
patent: 5856927 (1999-01-01), Greidinger et al.
patent: 6145117 (2000-11-01), Eng
patent: 6230304 (2001-05-01), Groeneveld et al.
Cormen, T.H., et al., “Introduction to Algorithms”,MIT Press, McGraw-Hill Book Company, 504-513, (1990).
Hadlock, F.O., “A Shortest Path Algorithm for Grid Graphs”,Networks, An International Journal, vol. 7, 323-334, (1977).
Lee, C.Y., “An Algorithm for Path Connections and Its Applications”,IRE Transactions on Electronic Computers, vol. EC-10, 346-365, (Sep. 1961).
Ousterhout, J.K., et al., “Magic: A VLSI Layout System”,Proceedings ACM IEEE 21st Design Automation Conference, Albuquerque, New Mexico, 152-159, (Jun. 1984).
Pearl, J., “Heuristics: Intelligent Search Strategies for Computer Problem Solving”,Addison-Wesley Publishing Company, 74-80, (1984).
Rivest, R.L., et al., “A “Greedy” Channel Router”,ACM IEEE 19th Design Automation Conference Proceedings, Las Vegas, Nevada, 418-424, (Jun. 1982).
Sherwani, N.A., “Algorithms for VLSI Physical Design Automation”,3rd Edition, Kluwer Academic Publishers, 215-223, (1999).
Soukup, J., “Fast Maze Router”,Proceedings Design Automation Conference, IEEE Catalog No. 78, Las Vegas, Nevada, 100-102, (Jun. 1978).
Soukup, J., “Global Router”,16th Design Automation Conference Proceedings, San Diego, California, 481-484, (Jun. 1979).
Arunachalam Prakash S.
Chan Heming
Intel Corporation
Schwegman Lundberg Woessner & Kluth P.A.
Siek Vuthe
LandOfFree
Method and apparatus for layout-constrained global routing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for layout-constrained global routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for layout-constrained global routing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2888753