Senior Fitness - Exercise and Nutrition for Aging Men and Women
FREE Article Feed for your website.
Home Ownership Magazine
Party Planning Information
Article Marketing Resources
Bio-Medical Research Article Database
Informative Articles on Life, Love and Happiness
Tutorials on Business to Writing
Famous Quotes from Famous People
Song Lyric Information
New US Patent Information
Comprehensive List of Content by Category
Online Auctions and Shopping Related Articles
Article Search
Most Recent Articles
Title: Ball cage
Patent Number: 6,922,897 Issued on 08/02/2005 to Adams,   et al.

Title: Image-recording device for a printing form, having an array of VCSEL light sources
Patent Number: 6,798,438 Issued on 09/28/2004 to Beier,   et al.

Title: Fixed and roving wireless system monitors
Patent Number: 7,164,908 Issued on 01/16/2007 to Dowling

Title: Arrangements for self-measurement of I/O timing
Patent Number: 6,898,741 Issued on 05/24/2005 to Muljono,   et al.

Title: Overvoltage protection circuits that utilize capacitively bootstrapped variable voltages
Patent Number: 6,798,629 Issued on 09/28/2004 to Proebsting

Title: Power frequency electromagnetic field compensation system
Patent Number: 6,798,632 Issued on 09/28/2004 to Holmes,   et al.

Title: Trip device comprising an improved man-machine interface and circuit breaker comprising such a trip device
Patent Number: 6,798,630 Issued on 09/28/2004 to Del Vecchio,   et al.

Title: Digital transceiver with multi-rate processing
Patent Number: 6,778,599 Issued on 08/17/2004 to Doron

Title: Control processor dynamically loading shadow instruction register associated with memory entry of coprocessor in flexible coupling mode
Patent Number: 6,865,663 Issued on 03/08/2005 to Barry

Title: Intake module having integrally housed ECU
Patent Number: 6,910,456 Issued on 06/28/2005 to Umemoto,   et al.

Title: Predictive processing method in a semiconductor processing facility
Patent Number: 6,766,285 Issued on 07/20/2004 to Allen, Jr.,   et al.

Title: Weighing apparatus
Patent Number: 6,809,270 Issued on 10/26/2004 to Fujita

Title: Internal combustion engine comprising a hydraulic system
Patent Number: 6,854,431 Issued on 02/15/2005 to Gaessler,   et al.

Title: Scarecrow gene, promoter and uses thereof
Patent Number: 6,809,234 Issued on 10/26/2004 to Benfey,   et al.

Title: Biopsy needle
Patent Number: 7,131,951 Issued on 11/07/2006 to Angel

Title: Biopsy needle
Patent Number: 7,131,951 Issued on 11/07/2006 to Angel

Title: Method for controlling a circumferential register in a web-fed rotary press
Patent Number: 6,766,737 Issued on 07/27/2004 to Glockner,   et al.

Title: Method and apparatus for measuring spinal distortions
Patent Number: 7,131,952 Issued on 11/07/2006 to Dickholtz, Sr.,   et al.

Title: Method and apparatus for measuring spinal distortions
Patent Number: 7,131,952 Issued on 11/07/2006 to Dickholtz, Sr.,   et al.

Title: Liquid crystal display having compensation capacitor
Patent Number: 7,142,261 Issued on 11/28/2006 to Chiang,   et al.

Title: Interchangeable flexible die
Patent Number: 6,766,733 Issued on 07/27/2004 to Collins

Title: Substituted cycloalkyl P1' hepatitis C virus inhibitors
Patent Number: 6,878,722 Issued on 04/12/2005 to Campbell,   et al.

Title: Multiaxis punch device
Patent Number: 6,766,723 Issued on 07/27/2004 to Yasoda,   et al.

Title: Image pickup device
Patent Number: 7,142,241 Issued on 11/28/2006 to Mukai

Title: Automatic self cleaning bladder relief system and failsafe
Patent Number: 7,131,964 Issued on 11/07/2006 to Harvie

Title: Automatic self cleaning bladder relief system and failsafe
Patent Number: 7,131,964 Issued on 11/07/2006 to Harvie

Title: Household appliance using water, namely, a washing machine, with improved device for reducing the water hardness
Patent Number: 6,766,812 Issued on 07/27/2004 to Gadini

Title: Semiconductor laser device
Patent Number: 6,768,755 Issued on 07/27/2004 to Inoue,   et al.

Title: Apparatus and method for performing symbolic resolution of modules using static representations of a trace
Patent Number: 6,766,511 Issued on 07/20/2004 to Berry,   et al.

Title: Polymer coated capacitor films
Patent Number: 6,798,642 Issued on 09/28/2004 to Decker,   et al.

Title: Gas discharge laser, method of operating a gas discharge laser, and use of a sintered filter
Patent Number: 6,798,814 Issued on 09/28/2004 to Geiger,   et al.

Title: Rotation sensor
Patent Number: 6,860,159 Issued on 03/01/2005 to Jin,   et al.

Title: Methods and apparatus for encoding LDPC codes
Patent Number: 6,961,888 Issued on 11/01/2005 to Jin,   et al.

Title: Lithographic apparatus, programmable patterning structure, device manufacturing method, and device manufactured thereby
Patent Number: 7,141,340 Issued on 11/28/2006 to Bleeker

Title: Method and apparatus for measurement using piezoelectric sensor
Patent Number: 6,989,623 Issued on 01/24/2006 to Zeighami

Title: Multi-mode mobile communications device with continuous mode transceiver and methods therefor
Patent Number: 6,957,081 Issued on 10/18/2005 to Leyh,   et al.

Title: Electrical wiring device with multiple types of wire terminations
Patent Number: 7,140,887 Issued on 11/28/2006 to Poh,   et al.

Title: System and method for annotation on a moving image
Patent Number: 7,119,814 Issued on 10/10/2006 to Meron,   et al.

Title: Dual-function three-axis positioning system
Patent Number: 7,084,533 Issued on 08/01/2006 to Botos,   et al.

Title: Hard bodied high capacity catch basin filtration system
Patent Number: 6,872,029 Issued on 03/29/2005 to Allard,   et al.

Title: Article information providing system and mediate apparatus
Patent Number: 7,020,682 Issued on 03/28/2006 to Homma,   et al.

Title: Floor hockey puck
Patent Number: 7,140,989 Issued on 11/28/2006 to Poruchny

Title: Method of allowing multiple, hardware embedded configurations to be recognized by an operating system
Patent Number: 7,020,723 Issued on 03/28/2006 to Beaudoin,   et al.

Title: Method for producing alkanolamines
Patent Number: 7,119,231 Issued on 10/10/2006 to Frauenkron,   et al.

Title: Digital watermark screening and detection strategies
Patent Number: 6,768,809 Issued on 07/27/2004 to Rhoads,   et al.

Title: Single data line sensing scheme for TCCT-based memory cells
Patent Number: 7,006,398 Issued on 02/28/2006 to Yoon,   et al.

Title: Quick-connecting coupler for hoses, pipes and faucets
Patent Number: 7,140,645 Issued on 11/28/2006 to Cronley

Title: Multi-layer golf ball
Patent Number: 7,140,978 Issued on 11/28/2006 to Nealon,   et al.

Title: Radio data communication apparatus and radio data communication method
Patent Number: 6,970,710 Issued on 11/29/2005 to Kikuchi

Title: Recessed luminaire having a dome-shaped reflector
Patent Number: 6,883,940 Issued on 04/26/2005 to Grajetzky,   et al.

Title: Interpolating a pixel from an intermediate line of a field
Patent Number: 7,142,249 Issued on 11/28/2006 to Hahn,   et al.

Title: Method for performing a camera function in a mobile communication terminal
Patent Number: 7,119,827 Issued on 10/10/2006 to Kang

Title: Bearing assembly equipped with rotation sensor to determine rotation and position of rotating element
Patent Number: 6,956,367 Issued on 10/18/2005 to Fujikawa,   et al.

Title: Solid electrolytic capacitor and method for producing the same
Patent Number: 6,790,384 Issued on 09/14/2004 to Konuma,   et al.

Title: Disposable diaper
Patent Number: 6,890,327 Issued on 05/10/2005 to Suzuki,   et al.

Title: Case tab-lock slitting and flap sealer in combination with a continuous radial motion case packing apparatus and method
Patent Number: 6,883,296 Issued on 04/26/2005 to Hartness,   et al.

Title: Jar lid opener
Patent Number: 6,935,207 Issued on 08/30/2005 to Mazza

Title: Multiple discharge-servo curve control method and device for an electrical discharge machine
Patent Number: 6,941,187 Issued on 09/06/2005 to Lu,   et al.

Title: Solar cell unit with removable layer
Patent Number: 6,809,252 Issued on 10/26/2004 to Winkeler

Title: Tire with improved endurance
Patent Number: 6,766,840 Issued on 07/27/2004 to Pereira,   et al.

Title: Receiving circuit, mobile terminal with receiving circuit, and method of receiving data
Patent Number: 6,768,769 Issued on 07/27/2004 to Hokao

Title: Gas laser oscillator
Patent Number: 6,768,761 Issued on 07/27/2004 to Hongu,   et al.

Title: System and method for noise reduction in thermodilution for cardiac measurement
Patent Number: 7,131,950 Issued on 11/07/2006 to Hamilton

Title: System and method for noise reduction in thermodilution for cardiac measurement
Patent Number: 7,131,950 Issued on 11/07/2006 to Hamilton

Title: Active pixel sensor array reset
Patent Number: 7,142,240 Issued on 11/28/2006 to Hua,   et al.

Title: CDMA receiver, path detection method, and recording medium on which path detection control program is recorded
Patent Number: 6,768,729 Issued on 07/27/2004 to Ohsuge

Title: Field adjustable pilot guard
Patent Number: 6,766,820 Issued on 07/27/2004 to Hoss

Title: Binaural synchronization
Patent Number: 6,768,802 Issued on 07/27/2004 to Baechler

Title: Vehicle seat air conditioning system
Patent Number: 6,871,696 Issued on 03/29/2005 to Aoki,   et al.

Title: Valve mechanism with a variable valve opening cross-section
Patent Number: 6,766,778 Issued on 07/27/2004 to Hammer

Title: Cooling module with axial blower and pressure regulated cross-flow fan
Patent Number: 6,766,774 Issued on 07/27/2004 to Kussmann

Title: Fluid conduction utilizing a reversible unsaturated siphon with tubarc porosity action
Patent Number: 6,766,817 Issued on 07/27/2004 to da Silva

Title: System and method for molecular optical emission
Patent Number: 7,115,916 Issued on 10/03/2006 to Avouris,   et al.

Title: Semiconductor device and semiconductor device producing system
Patent Number: 7,115,903 Issued on 10/03/2006 to Isobe,   et al.

Title: Administrating system of image forming apparatus and image forming apparatus
Patent Number: 6,999,191 Issued on 02/14/2006 to Yamada,   et al.

Method and apparatus for routing sets of nets Number:6,886,149 from the United States Patent and Trademark Office (PTO) owispatent

Home    Author Login    Submit Article    Article Search    Add Your Link    Edit Your Link    Contact Us    Advertising    Disclaimer

   

 
Web LinkGrinder.com

Top Breaking News
     Greek, Cypriot Leaders Resume Unification Talks in Nicosia by Nathan Morley
     Indonesia Tobacco Sales Grow, Raising Health Fears
     South Korea Allows Top Defector to Travel Overseas by VOA News

Title: Method and apparatus for routing sets of nets

Abstract: Some embodiments of the invention provide a method of routing a set of nets. The method specifies a first order for the set of nets. It then routes the nets according to the specified first order. The method then specifies a second order for the set of nets, where the second order has the fewest possible number of differences with the first order. The method then routes the nets according to the specified second order.

Patent Number: 6,886,149 Issued on 04/26/2005 to Teig,   et al.

Inventors: Teig; Steven (Menlo Park, CA); Caldwell; Andrew (Santa Clara, CA)
Assignee: Cadence Design Systems, Inc. (San Jose, CA)
Appl. No.: 286584
Filed: October 31, 2002

Current U.S. Class: 716/12; 716/13; 716/14; 716/15
Intern'l Class: G06F 017//50
Field of Search: 716/12- 15

References Cited [Referenced By]
U.S. Patent Documents
4615011Sep., 1986Linsker.
4673966Jun., 1987Shimoyama.
4777606Oct., 1988Fournier.
4782193Nov., 1988Linsker.
4855929Aug., 1989Nakajima.
5224057Jun., 1993Igarashi et al.
5360948Nov., 1994Thornberg.
5375069Dec., 1994Satoh et al.
5532934Jul., 1996Rostoker.
5578840Nov., 1996Scepanovic et al.
5618744Apr., 1997Suzuki et al.
5633479May., 1997Hirano.
5634093May., 1997Ashida et al.
5635736Jun., 1997Funaki et al.
5636125Jun., 1997Rostoker et al.
5637920Jun., 1997Loo.
5650653Jul., 1997Rostoker et al.
5657242Aug., 1997Sekiyama et al.
5659484Aug., 1997Bennett et al.
5663891Sep., 1997Bamji et al.
5717600Feb., 1998Ishizuka.
5723908Mar., 1998Fuchida et al.
5742086Apr., 1998Rostoker et al.
5757089May., 1998Ishizuka.
5757656May., 1998Hershberger et al.
5777360Jul., 1998Rostoker et al.
5811863Sep., 1998Rostoker et al.
5822214Oct., 1998Rostoker et al.
5838583Nov., 1998Varadarajan et al.
5856927Jan., 1999Greidinger et al.
5859449Jan., 1999Kobayashi et al.
5877091Mar., 1999Kawakami.
5880969Mar., 1999Hama et al.
5889329Mar., 1999Rostoker et al.
5889677Mar., 1999Yasuda et al.
5898597Apr., 1999Scepanovic et al.
5914887Jun., 1999Scepanovic et al.
5973376Oct., 1999Rostoker et al.
5980093Nov., 1999Jones et al.
6006024Dec., 1999Guruswamy et al.
6035108Mar., 2000Kikuchi.
6038383Mar., 2000Young et al.
6058254May., 2000Scepanovic et al.
6067409May., 2000Scepanovic et al.
6068662May., 2000Scepanovic et al.
6088519Jul., 2000Koford.
6110222Aug., 2000Minami et al.
6111756Aug., 2000Moresco.
6123736Sep., 2000Pavisic et al.
6128767Oct., 2000Chapman.
6154873Nov., 2000Takahashi.
6154874Nov., 2000Scepanovic et al.
6155725Dec., 2000Scepanovic et al.
6166441Dec., 2000Geryk.
6175950Jan., 2001Scepanovic et al.
6209123Mar., 2001Maziasz et al.
6216252Apr., 2001Dangelo et al.
6219823Apr., 2001Hama et al.
6219832Apr., 2001Buzbee.
6226560May., 2001Hama et al.
6230306May., 2001Raspopovic et al.
6247167Jun., 2001Raspopovic et al.
6247853Jun., 2001Papadopoulou et al.
6253363Jun., 2001Gasanov et al.
6260179Jul., 2001Ohsawa et al.
6262487Jul., 2001Igarashi et al.
6286128Sep., 2001Pileggi et al.
6289495Sep., 2001Raspopovic et al.
6292929Sep., 2001Scepanovic et al.
6295634Sep., 2001Matsumoto.
6301686Oct., 2001Kikuchi et al.
6324674Nov., 2001Andreev et al.
6324675Nov., 2001Dutta et al.
6327693Dec., 2001Cheng et al.
6327694Dec., 2001Kanazawa.
6330707Dec., 2001Shinomiya et al.
6349403Feb., 2002Dutta et al.
6378121Apr., 2002Hiraga.
6385758May., 2002Kikuchi et al.
6401234Jun., 2002Alpert et al.
6405358Jun., 2002Nuber.
6407434Jun., 2002Rostoker et al.
6412097Jun., 2002Kikuchi et al.
6412102Jun., 2002Andreev et al.
6415427Jul., 2002Nitta et al.
6434730Aug., 2002Ito et al.
6436804Aug., 2002Igarashi et al.
6442745Aug., 2002Arunachalam et al.
6463575Oct., 2002Takahashi.
6473891Oct., 2002Shively.
6490713Dec., 2002Matsumoto.
6505331Jan., 2003Bracha et al.
6519751Feb., 2003Sriram et al.
6526555Feb., 2003Teig et al.
6543043Apr., 2003Wang et al.
6546540Apr., 2003Igarashi et al.
6557145Apr., 2003Boyle et al.
6567967May., 2003Greidinger et al.
6578184Jun., 2003Fukuda et al.
6586281Jul., 2003Gabara et al.
6601227Jul., 2003Trimberger.
6609237Aug., 2003Hamawaki et al.
6622294Sep., 2003Saxena et al.
6645842Nov., 2003Igarashi et al.
6656644Dec., 2003Hasegawa et al.
6665852Dec., 2003Xing et al.
2001/0003843Jun., 2001Scepanovic et al.
2001/0038612Nov., 2001Vaughn et al.
2002/0043988Apr., 2002Or-Bach et al.
2002/0100009Jul., 2002Xing et al.
2002/0104061Aug., 2002Xing et al.
2002/0107711Aug., 2002Xing et al.
2002/0170029Nov., 2002Sriram et al.
2002/0174413Nov., 2002Tanaka.
2002/0182844Dec., 2002Igarashi et al.
2003/0005399Jan., 2003Igarashi et al.
2003/0009737Jan., 2003Xing.
2003/0014725Jan., 2003Sato et al.
2003/0025205Feb., 2003Shively.
2003/0063614Apr., 2003Teig et al.
2003/0121017Jun., 2003Andreev et al.
2003/0188281Oct., 2003Xing.
2004/0044979Mar., 2004Aji et al.
2004/0088670May., 2004Stevens et al.
2004/0098678May., 2004Teig et al.
2004/0098692May., 2004Teig et al.
2004/0098693May., 2004Teig et al.
Foreign Patent Documents
84-15947Jan., 1989JP.
02-262354Oct., 1990JP.
03-173471Jul., 1991JP.
04-000677Jan., 1992JP.
05-102305Apr., 1993JP.
05-243379Sep., 1993JP.
07-085407Mar., 1995JP.
09-162279Jun., 1997JP.
11-298560Oct., 1999JP.
2000/-082743Mar., 2000JP.


Other References

Cho J.D., Wiring Space and Length Estimation in Two-Dimensional Arrays, May 2000, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. 19, Iss. 5, pp. 612-615.
Cong J. et al., DUNE—A Multilayer Gridless Routing System, May 2001, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 20, iss. 5, pp. 633-647.
Dion J. et al., Contour: A Tile-based Gridless Router, Mar. 1995, Digital Western Research Laboratory, research Report 95-3, pp. 1-22.
Schulz U., Hierarchical Physical Design System, CompEuro '89, VLSI and Computer Peripherals. VSLI and Microelectronic Applications in Intelligent Peripherals and their Interconnection Networks. Proceedings, May 8-12, 1989, pp. 5/20-5/24.
Tseng H-P et al., A Gridless Multilayer Router for Standard Cell Circuits Using CTM Cells, Oct. 1999, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 18, iss. 10, pp. 1462-1479.
U.S. Appl. No. 10/068,060, Teig, filed Jan. 31, 2002.
U.S. Appl. No. 10/056,160, Teig et al., filed Jan. 31, 2002.
U.S. Appl. No. 10/066,095, Teig et al., filed Jan. 31, 2002.
U.S. Appl. No. 10/066,047, Teig et al., filed Jan. 31, 2002.
U.S. Appl. No. 10/061,641, Teig et al., filed Jan. 31, 2002.
U.S. Appl. No. 10/066,094, Teig et al., filed Jan. 31, 2002.
U.S. Appl. No. 10/076,121, Teig et al., filed Feb. 12, 2002.
U.S. Appl. No. 10/062,995, Teig et al., filed Jan. 31, 2002.
U.S. Appl. No. 10/066,102, Teig, filed Jan. 31, 2002.
U.S. Appl. No. 10/066,187, Teig et al., filed Jan. 31, 2002.
Chen, H.F. et al., A Faster Algorithm for Rubber-Band Equivalent Transformation for Planar VLSI Layouts, IEEE Transactions on Computer-Aided Design of Integrated 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, 28th ACM/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 Delauney 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 Transformation 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, 28th ACM-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.
Yu, M.F. et al., Fast and Incremental Routability Check of a Topological Routing Using a Cut-Based Encoding, UCSC-CRL-97-07, Apr. 14, 1997.
Yu, M.-F. et al., Interchangeable Pin Routing with Application to Package Layout, UCSC-CRL-96-10, Apr. 25, 1998.
Yu, M.-F. et al., Pin Assignment and Routing on a Single-Layer Pin Grid Array, UCSC-CRL-95-15, Feb. 24, 1995.
Yu, M.-F., et al., Planar Interchangeable 2-Terminal Routing, UCSC-CRL-95-49, Oct. 19, 1995.
Yu, M.-F. et al., Single-Layer Fanout Routing and Routability Analysis for Ball Grid Arrays, UCSC-CRL-95-18, Apr. 25, 1995.
Ahuja, R. et al., Faster Algorithms for the Shortest Path Problem, Journal of the Association for Computing Machinery, vol. 37, No. 2, Apr. 1990, pp. 213-223.
Alexander, M. et al., Performance-Oriented Placement and Routing for field-programmable gate arrays, Proceedings of the European Design Automation Conference, pp. 80-85, 1995.
Alexander, M. et al., Placement and Routing for Performance-Oriented FPGA Layout, VLSI Design, vol. 7, No. 1, 1998.
Andou, H. et al., Automatic Routing Algorithm for VLSI, 22nd Design Automation Conference, 1985, pp. 785-788.
Bagga, J. et al., Internal, External, and Mixed Visibility Edges of Polygone.
Berger, B. et al., Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing, Journal of the Association for Computing Machinery, pp. 500-542, Mar. 1995.
Brady, L. et al., Channel Routing on a 60° Grid, extended abstract, pp. 926-931.
Carothers, K. A Method of Measuring Nets Routability for MCM's General Area Routing Problems, 1999, pp. 186-192.
Chen, D-S. et al., A Wire-Length Minimization Algorithm for Single-Layer Layouts.
Chen et al., Optimal Algorithms for Bubble Sort Based Non-Manhattan Channel Routing, May 1994, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions Volume: 13, Issues, pp. 603-609.
Chen, H., Routing L-Shaped Channels in Nonslicing-Structure Placement. 24th ACM-IEEE Design Automation Conference, pp. 152-165, 1987.
Chen, H. et al., Physical Planning of On-Chip Interconnect Architecture, 2002, IEEE, International Conference, pp. 30-35.
Chen, S.-S. et al., A New Approach to the Ball Grid Array Package Routing, IEICE Trans. Fundamentals, vol. E82-A, No. 11, Nov., 1999, pp. 2599-2608.
Cheng, K. et al., Manhattan or Non Manhattan? A Study of Alternative VLSI Routing Architectures, pp. 47-52, 2000.
Chang, K., Steiner Problem in Octilinear Routing Model, A Thesis submitted for the Degree of Master of Science, National University Singapore, 1995, pp. 1-122.
Chiang, C. et al., Wirability of Knock-Knee Layouts with 45° Wires, IEEE Transactions on Circuits and Systems, vol. 38, Issue 8, pp. 613-624, Jun. 1991.
Cong, J. et al., Efficient Heuristics for the Minimum Shortest Path Steiner Aborescence Problem with Applications to VLSI Physical Design, Cadence Design Systems, pp. 88-95.
Cong, J. et al., Multilevel Approach to Full Chip Gridless Routing, Nov. 2001, IEEE, pp. 398-403.
Cong, J. et al., Performance Driven Multi-Layer General Routing for PCB/MCM Designs, UCLA Computer Science Department, 1998, pp. 356-361.
Das, S. et al., Channel Routing in Manhattan-Diagonal Model, 9th International Conference on VLSI Design, Jan. 1996, pp. 43-48.
Das, S. et al., Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model, pp. 65-70, Jan. 1998.
Enbody, R. et al., Near-Optimal n-Layer Channel Routing, 23rd Design Automation Conference, 1986, pp. 708-714.
Finch, A.C. et al., A Method for Gridless Routing of Printed Circuit Boards, 22nd Design Automation Conference, 1985 ACM, pp. 509-515.
Gao, S. et al., Channel Routing of Multiterminal Nets, Journal of the Association for Computing Machinery, vol. 41, No. 4, Jul. 1994, pp. 791-818.
Gao, T. et al., Minimum Crosstalk Channel Routing, pp. 692-696, 1993 IEEE.
Gao, T. et al., Minimum Crosstalk Switchbox Routing, pp. 610-615, 1994 ACM.
Gonzalez, T. et al., A Linear Time-Algorithm for Optimal Routing, Journal of the Association for Computing Machinery, vol. 35, No. 4, Oct. 1968, pp. 810-831.
Gulbas, L. et al., Optimal Shortest Path Queries in a Simple Polygon, 1987 ACM, pp. 50-63.
Hachtel, G.D. et al., Linear Complexity Algorithms for Hierarchial Routing, Jan. 1989, IEEE pp. 64-80.
Hershberger, J., Efficient Breakout Routing in Printed Circuit Boards, Computational Geometry, 1997, ACM, pp. 460-462.
Hershberger, J., Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size, Preliminary Version, 1987 ACM, pp. 11-20.
Hightower, D., A Solution to Line-Routing Problems on the Continuous Plane, Bell Laboratories, Inc., pp. 11-34.
Iao, N. et al., Efficient Routability Checking for Global Wires in Planar Layouts, IEICE Trans. Fundamentals, vol. E80-A, No. 10 Oct. 1997, pp. 1878-1882.
Khoo, K. et al., An Efficient Multilayer MCM Router Based on Four-Via Routing, 30th ACM/IEEE Design Automation Conference, 1993, pp. 590-595.
Ladage, L. et al., Resistance Extraction Using a Routing Algorithm, 30th ACM/IEEE Design Automation Conference, 1993, pp. 38-42.
Leach, G., Improving Worst-case Optimal Delauney Triangulation Algorithms, Department of Computer Science, Jun. 15, 1992, pp. 1-7.
Leiserson, C. et al., Algorithms for Routing and Testing Routability of Planar VLSI Layouts, pp. 69-78, May 1985.
Lillis, J. et al., New Performance Driven Routing Techniques with Explicit Area-Delay Tradeoff and Simultaneous Wire Sizing, 33rd Design Automation Conference, 1996.
Lipski, W. et al., A Unified Approach to Layout Wirability, Mathematical Systems Theory, 1987, pp. 189-203.
Lodi, E. et al., A 2d Channel Router for the Diagonal Model, pp. 111-125, Apr. 1991.
Lodi, E. et al., A Preliminary Study of a Diagonal Channel-Routing Model, Algorithmica, 1989, pp. 585-597.
Lodi, E. et al., Lecture Notes In Computer Science, A 4d Channel router for a two layer diagonal model, pp. 464-476, Jul. 1988.
Lodi, E., et al., Routing In Times Square Mode, pp. 41-48, Jun. 1990.
Lodi, E. et al., Routing Multiterminal Nets In a Diagonal Model, pp. 889-902, 1988.
Murooka, T. et al., Simplified Routing Procedure for a CAD-Verified FPGA, IEICE Trans. Fundamentals, vol. E82-A, No. 11 Nov. 1999, pp. 2440-2447.
Naclerio, N. et al., Via Minimization for Gridless Layouts, 24th ACM/IEEE Design Automation Conference, 1987, pp. 159-165.
Nam, G. et al., Satisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs Via Search-Based Boolean SAT, 1999, pp. 167-175.
Nestor, J. A New Look at Hardware Maze Routing, Proceedings of the 12th ACM Symposium on Great Lakes Symposium on VLSI, pp. 142-147, Apr. 2002.
Ng, C., A "Gridless" Variable-Width Channel Router for Macro Cell Design, 24th ACM/IEEE Design Automation Conference, 1987, pp. 633-636.
Otaverri, A.G. et al., On the Minimum Size of Visibility Graphs.
Overtone, G., EDA Underwriter 2 Finding Space in a Multi-Layer Board, Electronic Engineering, Morgan-Gramplan LTD, Mar. 1995, vol. 67, No. 819, pp. 29-30.
Pacchiola, M., Computing the Visibility Graph via Pseudo-Triagulations, 11th Computational Geometry, Vancouver, Canada, 1995 ACM, pp. 248-257.
Powers, K. et al., The 60° Grid: Routing Channels in Width d/square root 3, VLSI, 1991, Proceedings., First Great Lakes Symposium on Kalamazoo, MI, USA, pp. 214-291, Mar. 1991.
Royle, J. et al., Geometric Compaction in One Dimension for Channel Routing, 24th ACM/IEEE Design Automation Conference, 1987, pp. 140-145.
Schele, W. et al., A Gridless Router for Industrial Design Rule, 27th ACM-IEEE Design Automation Conference, pp. 626-631, 1990.
Sekiyama, Y. et al., Timing-Oriented Routers for PCB Layout Design of High-Performance Computers, International Conference on Computer Aided Design, pp. 332-335, Nov. 1991.
Soukop, J. et al., Maza Router Without a Grid Map, IEEE, 1992, pp. 382-385.
Takashima, Y. et al, Routability of FPGAs with Extremal Switch-Block Structures, IEICE Trans. Fundamentals, vol. E81-A, No. 5, May 1998, pp. 850-856.
Teig, S. The X Architecture: Not your Father's Diagonal Wiring, International Workshop on System Level Interconnect Prediction, pp. 33-37, Apr. 2002.
Thakur, S. et al., Algorithms for a Switch Module Routing Problem, 1994, pp. 265-270.
Theune, D. et al.; HERO: Hierarchical EMC-constrained routing, Nov. 1992, IEEE pp. 468-472.
Tolltis, I. Techniques for Wiring in Non-Square Grids, pp. 68-69, May 1989.
Urrutia, J., On the Number of Internal and External Visibility Edges of Polygons, Department of CS, University of Ottawa, ON, Canada, Feb. 11, 1997.
Wang; D., Novel Routing Schemes for IC Layout, Part I: Two-Layer Channel Routing, 28th ACM/IEEE Automation Conference, 1991, pp. 49-53.
Yan et al., Three-Layer Bubble-Sorting-Based Non-Manhattan Channel Routing, ACM Transactions on Design Automation of Electronic Systems, vol. 5, No. 3, Jul. 2000, pp. 726-734.
Zhou, H. et al., An Optimal Algorithm for River Routing with Crosstalk Constraints, 1996.
Zhou, H. et al., Optimal River Routing with Crosstalk Constraints, ACM Transactions on Design Automation of Electronic Systems, vol. 3, No. 3, Jul. 1998, pp. 496-514.

Primary Examiner: Siek; Vuthe
Attorney, Agent or Firm: Stattler, Johansen & Adeli, LLP
Parent Case Text


CLAIM OF BENEFIT TO PRIOR APPLICATION

This patent application is a continuation of the U.S. patent application Ser. No. 10/215,896, filed Aug. 9, 2002, which is incorporated herein by reference. This application also claims the benefit of the U.S. Provisional Patent Application 60/396,571, filed Jul. 15, 2002; U.S. Provisional Patent Application 60/388,518, filed Jun. 12, 2002; U.S. Provisional Patent Application 60/385,975, filed Jun. 4, 2002; U.S. Provisional Patent Application 60/351,459, filed Jan. 22, 2002.
Claims


1. A method of routing a set of nets, the method comprising:

a) specifying a first order for the set of nets, wherein an order is a specific sequence of nets to be routed in succession of each other, wherein each net has a position in the specific sequence of nets;

b) routing the nets according to the specified first order;

c) using a least-discrepancy search ("LDS") to specifying a second order for the set of nets, wherein the LDS-specified second order has the fewest possible number of differences with the first order, wherein a difference is calculated for every net whose position in the second order differs from said net's position in the first order; and

d) routing the nets according to the specified second order.

2. The method of claim 1 further comprising:

a) using the least-discrepancy search to specify a third order for the set of nets, wherein the third order has the next fewest possible number of differences with the first order; and

b) routing the nets according to the specified third order.

3. The method of claim 2 further comprising, after routing the nets according to the second order but before routing the nets according to the third specified order, identifying a set of orders for the set of nets, wherein each order in the identified set of orders has the same number of differences with the first order as the second order.

4. The method of claim 3 further comprising:

routing the nets according to each of the orders in the identified set of orders.

5. The method of claim 4, wherein identifying the set of orders comprises iteratively identifying each order in the set and routing the nets at each particular iteration according to the order for the particular iteration.

6. The method of claim 5, wherein the routing the nets according to at least some of the orders results in a complete routing solution that includes a route for each net, the method further comprising:

after at least each particular routing that results in a complete solution, determining whether the particular routing solution is better than any of the prior complete routing solutions examined, and if so, storing the particular routing solution.

7. The method of claim 6, wherein the set of orders is a first set of orders, the method further comprising:

identifying a second set of orders for the set of nets, wherein each order in the identified second set of orders has the same number of differences with the first order as the third order; and

routing the nets according to each of the orders in the identified second set of orders.

8. The method of claim 7 further comprising:

identifying a third set of orders for the set of nets, wherein each order in the identified second set of orders has one more difference with the first order than the number of differences between the first and third orders; and

routing the nets according to each of the orders in the identified third set of orders.

9. The method of claim 8 further comprising:

iteratively identifying additional sets of orders for the set of nets, wherein at each iteration the number of differences between the orders in the set and the first order is more than the number of differences between the orders in the set from the previous iteration and the first order;

at each iteration, identifying a routing solution for at least one order in the iteration; and

terminating the iterative identification of additional order sets once the number of differences between the orders in the next iteration and the first order reaches a certain value.

10. The method of claim 9 further comprising:

iteratively identifying additional sets of orders for the set of nets, wherein at each iteration the number of differences between the orders in the set and the first order is more than the number of differences between the orders in the set from the previous iteration and the first order;

at each iteration, identifying a routing solution for at least one order in the iteration; and

terminating the iterative identification of additional order sets once the number of differences between the orders in the last iteration and the first order reaches a certain value.

11. A computer readable medium that stores a computer program for routing a set of nets, the computer program comprising sets of instructions for:

a) specifying a first order for the set of nets, wherein an order is a specific sequence of nets to be routed in succession of each other, wherein each net has a position in the specific sequence of nets;

b) routing the nets according to the specified first order;

c) using a least-discrepancy search ("LDS") to specifying a second order for the set of nets, wherein the LDS-specified second order has the fewest possible number of differences with the first order, wherein a difference is calculated for every net whose position in the second order differs from said net's position in the first order; and

d) routing the nets according to the specified second order.

12. The computer readable medium of claim 11, wherein the computer program further comprises sets of instructions for:

a) using the least-discrepancy search to specify a third order for the set of nets, wherein the third order has the next fewest possible number of differences with the first order; and

b) routing the nets according to the specified third order.

13. The computer readable medium of claim 12, wherein the computer program further comprises instructions for identifying, after routing the nets according to the second order but before routing the nets according to the third specified order, a set of orders for the set of nets, wherein each order in the identified set of orders has the same number of differences with the first order as the second order.

14. The computer readable medium of claim 13, wherein the computer program further comprises a set of instructions for routing the nets according to each of the orders in the identified set of orders.

15. The computer readable medium of claim 14, wherein the set of instructions for identifying the set of orders comprises a set of instructions for iteratively identifying each order in the set and routing the nets at each particular iteration according to the order for the particular iteration.

16. The computer readable medium of cla


Free Web Sudoku Puzzles.
Solve with your browser.
7   4 6       1 9
    8            
  9   3   1 4    
      4     5 2  
      5   2      
  1 2     8      
    1 7   4   6  
            1    
4 5       3 2   8
What is it?



Add Your Site · Terms Of Service · Privacy Policy


DISCLAIMER
Linkgrinder is a free service that searches the Internet and indexes all files found so that you may search quickly and easily for shared files. These files are created and made available individually by users whose identity we are not aware of and who we have no control over. In essence we function like a search engine tool; these files ARE NOT STORED OR SERVED BY OUR NETWORK. We are not responsible for any materials obtained by using our service. We do not monitor any of the contents of these files. These files may contain viruses, illegal materials, materials inappropriate for minors, offensive files and the like. BY USING OUR SERVICE, YOU ASSUME FULL RESPONSIBILITY FOR DOWNLOADING THESE MATERIALS AND WILL INDEMNIFY US FOR ANY DAMAGES THAT MAY BE INCURRED.

For More Specific Information VIEW OUR TERMS OF SERVICE.

Thank you and Enjoy!