Incremental routing in integrated circuit design

Details Incremental routing in integrated circuit design Incremental routing in integrated circuit design

2006-11-07

2006-11-07

Siek, Vuthe (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C716S030000, C716S030000

Reexamination Certificate

active

07134112

ABSTRACT:
A method for completing the routing of a partially routed design is provided. The unrouted pins are routed to generate a first plurality of nets that may contain shorts or overlaps between the nets. The nets are analyzed to obtain timing information, and then divided into a set of critical and a set of non-critical nets. The non-critical nets are hidden, and the critical nets are rerouted to remove overlaps. The non-critical nets are then unhidden. The non-critical nets and rerouted critical nets are then rerouted so as to remove overlaps.

REFERENCES:
patent: 5790414 (1998-08-01), Okano et al.
patent: 5963728 (1999-10-01), Hathaway et al.
patent: 6269468 (2001-07-01), Dean et al.
patent: 6286128 (2001-09-01), Pileggi et al.
patent: 6460166 (2002-10-01), Reddy et al.
patent: 6480991 (2002-11-01), Cho et al.
patent: 6557145 (2003-04-01), Boyle et al.
patent: 6622291 (2003-09-01), Ginetti
patent: 6757879 (2004-06-01), Kong et al.
patent: 6766504 (2004-07-01), Rahut et al.
Vaughn Betz, Jonathan Rose; “FPGA Routing Architecture: Segmentation and Buffering to Optimize Speed and Density”; 10 pages.
Dijkstra, E.; A Note on Two Problems in Connexion with Graphs, Numerishe Mathematik 1; 1959; 2 pages. attached publication from book: 25.2 Dijkstra's algorithm—pp. 527-531.
L. McMurchie, C. Ebeling; “PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs”; Proc. of the Feb. 1995; 1995 ACM Third International Symposium on Field-Programmable Gate Arrays Aided Design; 7 pages.
C. Y. Lee, “An Algorithm for Path Connections and its Applications, ” IRE Transactions on Electronic Computers, vol. EC=10, Sep. 1961, pp. 346-365.
Ravi Nair, “A Simple Yet Effective Technique for Global Wiring”; IEEE Transactions on Computer-Aided Design, vol. CAD-6, No. w; Mar. 1987; Copyright 1987 IEEE; pp. 165-171.

Affiliated with

Also associated with

Rating

Incremental routing in integrated circuit design does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Incremental routing in integrated circuit design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental routing in integrated circuit design will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3670032