[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Fang et al., 2018 - Google Patents

Obstacle-avoiding open-net connector with precise shortest distance estimation

Fang et al., 2018

Document ID
8326839752506061625
Author
Fang G
Zhong Y
Cheng Y
Fang S
Publication year
Publication venue
Proceedings of the 55th Annual Design Automation Conference

External Links

Snippet

At the end of digital integrated circuit (IC) design flow, some nets may still be left open due to engineering change order (ECO). Resolving these opens could be quite challenging for some huge nets such as power ground nets because of a large number of obstacles and …
Continue reading at dl.acm.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5081—Layout analysis, e.g. layout verification, design rule check
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5077—Routing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5072—Floorplanning, e.g. partitioning, placement
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G06F17/5036—Computer-aided design using simulation for analog modelling, e.g. for circuits, spice programme, direct methods, relaxation methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G06F17/505—Logic synthesis, e.g. technology mapping, optimisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5086—Mechanical design, e.g. parametric or variational design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/12—Design for manufacturability
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/78—Power analysis and optimization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/08—Multi-objective optimization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/02—Component-based CAD
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/34—Pipes

Similar Documents

Publication Publication Date Title
Bustany et al. ISPD 2015 benchmarks with fence regions and routing blockages for detailed-routing-driven placement
Yang et al. Congestion estimation during top-down placement
Cong et al. Large-scale circuit placement
Xu et al. PARR: Pin-access planning and regular routing for self-aligned double patterning
Sun et al. A multithreaded initial detailed routing algorithm considering global routing guides
Liu et al. A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing
Cong et al. An enhanced multilevel routing system
Kahng et al. Tritonroute: The open-source detailed router
Chen et al. Toward silicon-proven detailed routing for analog and mixed-signal circuits
Nieberg Gridless pin access in detailed routing
US11176306B2 (en) Methods and systems to perform automated Integrated Fan-Out wafer level package routing
Chen et al. Routability-driven blockage-aware macro placement
Chen et al. Minimizing cluster number with clip shifting in hotspot pattern classification
US9372952B1 (en) Methods, systems, and articles of manufacture for enhancing metrics of electronic designs using design rule driven physical design implementation techniques
Kahng et al. The tao of PAO: Anatomy of a pin access oracle for detailed routing
Chang et al. iClaire: A fast and general layout pattern classification algorithm
Fang et al. Obstacle-avoiding open-net connector with precise shortest distance estimation
He et al. Ripple 2.0: Improved movement of cells in routability-driven placement
Chang et al. MANA: A shortest path maze algorithm under separation and minimum length nanometer rules
US9183343B1 (en) Methods, systems, and articles of manufacture for implementing high current carrying interconnects in electronic designs
Moffitt Global routing revisited
Wei et al. Techniques for scalable and effective routability evaluation
Cong et al. An analytical placer for mixed-size 3D placement
Kai et al. Tofu: A two-step floorplan refinement framework for whitespace reduction
Zhong et al. Via pillar-aware detailed placement