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

Kaur et al., 2017 - Google Patents

On solving partition driven standard cell placement problem using firefly-based metaheuristic approach

Kaur et al., 2017

Document ID
1596459385201853329
Author
Kaur M
Sharma P
Publication year
Publication venue
International Journal of Bio-Inspired Computation

External Links

Snippet

The standard-cell placement problem has drawn great attention in the VLSI CAD domain. Being an NP complete problem, a spacious range of heuristic approaches exist in the literature for expeditiously organising the circuit elements on a VLSI chip design. The …
Continue reading at www.inderscienceonline.com (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/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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • 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
    • 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
    • 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
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6261—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation partitioning the feature space
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]

Similar Documents

Publication Publication Date Title
Murata et al. VLSI module placement based on rectangle-packing by the sequence-pair
US8370783B2 (en) Systems and methods for probabilistic interconnect planning
CN106919769B (en) Hierarchical FPGA (field programmable Gate array) layout and wiring method based on multi-level method and empowerment hypergraph
Boese et al. Rectilinear Steiner trees with minimum Elmore delay
CN110838072A (en) Social network influence maximization method and system based on community discovery
CN112528591A (en) Automatic PCB wiring method based on joint Monte Carlo tree search
Lee et al. Ensembles of Lasso screening rules
Kaur et al. On solving partition driven standard cell placement problem using firefly-based metaheuristic approach
Chou et al. Wire length and delay minimization in general clock net routing
Grzesiak-Kopeć et al. Hypergraphs and extremal optimization in 3D integrated circuit design automation
CN108198084A (en) A kind of complex network is overlapped community discovery method
Lin et al. Module placement with boundary constraints using B*-trees
CN104834957B (en) A kind of method and apparatus that Nonlinear programming Model is solved based on cuckoo searching algorithm
Chu et al. Efficient nonrectangular shaped voltage island aware floorplanning with nonrandomized searching engine
Yang et al. Towards Timing-Driven Routing: An Efficient Learning Based Geometric Approach
Jain et al. A genetic algorithm based approach to solve vlsi floor planning problem
Gill et al. Comparative study of ant colony and genetic algorithms for VLSI circuit partitioning
Rad et al. An intelligent algorithm for mapping of applications on parallel reconfigurable systems
Gill et al. Genetic Algorithm Based Approach To CircuitPartitioning
Chowdhury et al. Invictus: Optimizing boolean logic circuit synthesis via synergistic learning and search
Sun et al. A Streaming Graph Partitioning Method to Achieve High Cohesion and Equilibrium via Multiplayer Repeated Game
Jubeir et al. Enhanced selection method for genetic algorithm to solve traveling salesman problem
Chiang Ant colony optimization for VLSI floorplanning with clustering constraints
Rais et al. Computational comparison of major proposed methods for graph partitioning problem
Helvig et al. New approximation algorithms for routing with multiport terminals