Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2005-09-27
2005-09-27
Smith, Matthew (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
06951005
ABSTRACT:
One embodiment of the invention is a method of routing a group of nets in a region. The method identifies a first route for a first net. It then determines whether embedding the first route in the region will make a set of unrouted nets in the region unroutable. When embedding the first route will make the set of unrouted nets unroutable, the method then identifies a second route for the first net. If embedding a route will not make the set of unrouted nets unroutable, the method embeds the route in the region.
REFERENCES:
patent: 4673966 (1987-06-01), Shimoyama
patent: 4782193 (1988-11-01), Linsker
patent: 4855929 (1989-08-01), Nakajima
patent: 5360948 (1994-11-01), Thornberg
patent: 5375069 (1994-12-01), Satoh et al.
patent: 5532934 (1996-07-01), Rostoker
patent: 5578840 (1996-11-01), Scepanovic et al.
patent: 5618744 (1997-04-01), Suzuki et al.
patent: 5633479 (1997-05-01), Hirano
patent: 5635736 (1997-06-01), Funaki et al.
patent: 5636125 (1997-06-01), Rostoker et al.
patent: 5637920 (1997-06-01), Loo
patent: 5650653 (1997-07-01), Rostoker et al.
patent: 5657242 (1997-08-01), Sekiyama et al.
patent: 5663891 (1997-09-01), Bamji et al.
patent: 5723908 (1998-03-01), Fuchida et al.
patent: 5742086 (1998-04-01), Rostoker et al.
patent: 5757656 (1998-05-01), Hershberger et al.
patent: 5777360 (1998-07-01), Rostoker et al.
patent: 5811863 (1998-09-01), Rostoker et al.
patent: 5822214 (1998-10-01), Rostoker et al.
patent: 5838583 (1998-11-01), Varadarajan et al.
patent: 5859449 (1999-01-01), Kobayashi et al.
patent: 5889329 (1999-03-01), Rostoker et al.
patent: 5889677 (1999-03-01), Yasuda et al.
patent: 5898597 (1999-04-01), Scepanovic et al.
patent: 5914887 (1999-06-01), Scepanovic et al.
patent: 5973376 (1999-10-01), Rostoker et al.
patent: 5980093 (1999-11-01), Jones et al.
patent: 6035108 (2000-03-01), Kikuchi
patent: 6038383 (2000-03-01), Young et al.
patent: 6058254 (2000-05-01), Scepanovic et al.
patent: 6067409 (2000-05-01), Scepanovic et al.
patent: 6068662 (2000-05-01), Scepanovic et al.
patent: 6088519 (2000-07-01), Koford
patent: 6111756 (2000-08-01), Moresco
patent: 6123736 (2000-09-01), Pavisic et al.
patent: 6128767 (2000-10-01), Chapman
patent: 6155725 (2000-12-01), Scepanovic et al.
patent: 6166441 (2000-12-01), Geryk
patent: 6175950 (2001-01-01), Scepanovic et al.
patent: 6209123 (2001-03-01), Maziasz et al.
patent: 6216252 (2001-04-01), Dangelo et al.
patent: 6219823 (2001-04-01), Hama et al.
patent: 6219832 (2001-04-01), Buzbee
patent: 6226560 (2001-05-01), Hama et al.
patent: 6230306 (2001-05-01), Raspopovic et al.
patent: 6253363 (2001-06-01), Gasanov et al.
patent: 6260179 (2001-07-01), Ohsawa et al.
patent: 6262487 (2001-07-01), Igarashi et al.
patent: 6289495 (2001-09-01), Raspopovic et al.
patent: 6292929 (2001-09-01), Scepanovic et al.
patent: 6295634 (2001-09-01), Matsumoto
patent: 6301686 (2001-10-01), Kikuchi et al.
patent: 6324674 (2001-11-01), Andreev et al.
patent: 6324675 (2001-11-01), Dutta et al.
patent: 6327693 (2001-12-01), Cheng et al.
patent: 6327694 (2001-12-01), Kanazawa
patent: 6330707 (2001-12-01), Shinomiya et al.
patent: 6385758 (2002-05-01), Kikuchi et al.
patent: 6401234 (2002-06-01), Alpert et al.
patent: 6405358 (2002-06-01), Nuber
patent: 6407434 (2002-06-01), Rostoker et al.
patent: 6412097 (2002-06-01), Kikuchi et al.
patent: 6412102 (2002-06-01), Andreev et al.
patent: 6436804 (2002-08-01), Igarashi et al.
patent: 6463575 (2002-10-01), Takahashi
patent: 6473891 (2002-10-01), Shively
patent: 6490713 (2002-12-01), Matsumoto
patent: 6526555 (2003-02-01), Teig et al.
patent: 6546540 (2003-04-01), Igarashi et al.
patent: 6557145 (2003-04-01), Boyle et al.
patent: 6567967 (2003-05-01), Greidinger et al.
patent: 6586281 (2003-07-01), Gabara et al.
patent: 6645842 (2003-11-01), Igarashi et al.
patent: 6665852 (2003-12-01), Xing et al.
patent: 2001/0003843 (2001-06-01), Scepanovic et al.
patent: 2002/0100009 (2002-07-01), Xing et al.
patent: 2002/0104061 (2002-08-01), Xing et al.
patent: 2002/0107711 (2002-08-01), Xing et al.
patent: 2002/0174413 (2002-11-01), Tanaka
patent: 2002/0182844 (2002-12-01), Igarashi et al.
patent: 2003/0005399 (2003-01-01), Igarashi et al.
patent: 2003/0025205 (2003-02-01), Shively
patent: 2003/0121017 (2003-06-01), Andreev et al.
patent: 2003/0188281 (2003-10-01), Xing
patent: 64-15947 (1989-01-01), None
patent: 03-173471 (1991-07-01), None
patent: 04-000677 (1992-01-01), None
patent: 05-102305 (1993-04-01), None
patent: 05-243379 (1993-09-01), None
patent: 07-086407 (1995-03-01), None
patent: 09-162279 (1997-06-01), None
patent: 11-296560 (1999-10-01), None
patent: 2000-082743 (2000-03-01), None
U.S. Appl. No. 10/066,060, filed Jan. 31, 2002, Teig.
U.S. Appl. No. 10/066,095, filed Jan. 31, 2002, Teig et al.
U.S. Appl. No. 10/066,047, filed Jan. 31, 2002, Teig et al.
U.S. Appl. No. 10/061,641, filed Jan. 31, 2002, Teig et al.
U.S. Appl. No. 10/066,094, filed Jan. 31, 2002, Teig et al.
U.S. Appl. No. 10/076,121, filed Feb. 12, 2002, Teig et al.
U.S. Appl. No. 10/062,995, filed Jan. 31, 2002, Teig et al.
U.S. Appl. No. 10/066,102, filed Jan. 31, 2002, Teig.
U.S. Appl. No. 10/066,187, filed Jan. 31, 2002, Teig et al.
U.S. Appl. No. 10/286,584, filed Oct. 31, 2002, Teig.
U.S. Appl. No. 10/335,087, filed Jan. 31, 2002, Teig et al.
U.S. Appl. No. 10/335,239, filed Dec. 31, 2002, Teig et al.
U.S. Appl. No. 10/335,086, filed Dec. 31, 2002, Teig et al.
Chen, H.F. et al., A Faster Algorithm for Rubber-Band Equivalent Transformation for Planar VLSI Layouts, IEEE Transactions on Computer-Aided Design of Intergrated Circuits and Systems, vol. 15, No. 2, Feb. 1996, pp. 217-227.
Chip Model with Wiring Cost Map, Aug. 1983, IBM Technical Disclosure Bulletin, vol. 26, issu. 3A, pp. 929-933.
Dayan, T. et al., Layer Assignment for Rubber Band Routing, UCSC-CRI-93-04, Jan. 20, 1993.
Dayan, T., Rubber-Band Based Topological Router, A Dissertation, UC Santa Cruz, Jun. 1997.
Dood, P. et al. A Two-Dimensional Topological Compactor with Octagonal Geometry, 28thACM/IEEE Design Automation Conference, pp 727-731, Jul. 1991.
Fujimura, K. et al, Homotopic Shape Deformation.
Hama, T. et al., Curvilinear Detailed Routing Algorithm and its Extension to Wire-Spreading and Wire-Fattening.
Hama, T. et al., Topological Routing Path Search Algorithm with Incremental Routability Test, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 18, No. 2, Feb. 1999, pp. 142-150.
Kobayashi, K. et al., A New Interactive Analog Layout Methodology based on Rubber-Band Routing, UCSC-CRL-96-12, Jun. 13, 1996.
Lim, A. et al, A Fast Algorithm To Test Planar Topological Routability, Technical Report 94-012, pp. 1-16.
Lu, Y., Dynamic Constrained Delaunay Triangulation and Application to Multichip Module Layout, A Thesis for Master of Science, UC Santa Cruz, Dec. 1991.
Maley, F.M., Testing Homotopic Routability Under Polygonal Wiring Rules, Algorithmica 1996, 15: 1-16.
Morton, P. B. et al., An Efficient Sequential Quadratic Programming Formulation of Optimal Wire Spacing for Cross-Talk Noise Avoidance Routing, UCSC-CRL-99-05, Mar. 10, 1999.
NN71091316, Use of Relatively Diagonal and Rectangular Wiring Planes n Multilayer Packages, Sep. 1971, IBM Technical Disclosure Bulletin, vol. No. 14, Issue No. 4, pp. 1316-1317.
Staepelaere, D. et al., Geometric Transformations for a Rubber-Band Sketch, A Thesis for a Master of Science in Computer Engineering, UCSC, Sep. 1992.
Staepelaere, D. et al., Surf: A Rubber-Band Routing System for Multichip Modules, pp 18-26, 1993.
Su, J. et al., Post-Route Optimization for Improved Yield Using Rubber-Band Wiring Model, 1997 International Conference on Computer-Aided Design, pp 700-706, Nov. 1997.
Wei-Ming Dai, W. et al., Routability of a Rubber-Band Sketch. 28thACM-IEEE Design Automation Conference, 1991, pp. 45-65.
Xing, Z. et al., A Minimum Cost Path Search Algorithm Through Tile Obstacles, slide presentation.
Xing, Z. et al., Shortest Path Search Using Tiles and Piecewise Linear Cost Propagation, IEEE, 2002, pp. 145-158.
Xu, A More Efficient Distance Vector Routing Algorithm, UCSC-CRL-96-18, Mar. 1997
Caldwell Andrew
Teig Steven
Cadence Design Systems Inc.
Dinh Paul
Smith Matthew
Stattler, Johansen and Adeli LLP
LandOfFree
Method and apparatus for selecting a route for a net based... 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 selecting a route for a net based..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for selecting a route for a net based... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3430029