Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2005-04-29
2008-05-20
Chiang, Jack (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
07376926
ABSTRACT:
A method of limiting the routing resources of an integrated circuit (IC) that are available for use when routing multi-fanout nets can include selecting a multi-fanout net comprising a source and a plurality of loads and identifying each region of the IC which does not include at least one of the plurality of loads. Each of the regions can have a defined geometry. A type of routing resource can be selected which has a physical orientation with respect to the IC that corresponds to the geometry of the regions of the IC. Each routing resource of the selected type that is located within a region of the IC which does not include at least one of the plurality of loads can be excluded from consideration when routing the multi-fanout net.
REFERENCES:
patent: 4831725 (1989-05-01), Dunham et al.
patent: 6247167 (2001-06-01), Raspopovic et al.
patent: 7089524 (2006-08-01), Teig et al.
patent: 2001/0018759 (2001-08-01), Andreev et al.
patent: 2003/0074645 (2003-04-01), Clabes et al.
patent: 2005/0166164 (2005-07-01), Ren et al.
Vaughn Betz et al.; “VPR: A New Packing, Placement and Routing Tool for FPGA Research”; 1997 International Workshop on Field Programmable Logic and Applications; pp. 1-10.
Bryan T. Preas et al.; “Physical Design Automation of VLSI Systems”; The Benjamin/Cummings Publishing Company, Inc.; Copyright 1988; pp. 163-167.
Larry McMurchie et al.; “PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs”; FPGA '95; Copyright 1995 ACM; pp. 111-117.
Xilinx, Inc.; “Virtex-II Platform FPGA Handbook”; published Dec. 2000; available from Xilinx, Inc., 2100 Logic Drive, San Jose, California 95124; pp. 33-75.
C. Y. Lee, “An Algorithm for Path Connections and its Applications,” IRE Transactions on Electronic Computers, vol. EC-10, Sep. 1961, pp. 346-365.
Kong Raymond
Rahut Anirban
Chiang Jack
Cuenot Kevin T.
Memula Suresh
Xilinx , Inc.
LandOfFree
Run-time efficient methods for routing large multi-fanout nets does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Run-time efficient methods for routing large multi-fanout nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Run-time efficient methods for routing large multi-fanout nets will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3986870