Open AccessBook
Algorithms for VLSI Physical Design Automation
TLDR
This book is a core reference for graduate students and CAD professionals and presents a balance of theory and practice in a intuitive manner.Abstract:
From the Publisher:
This work covers all aspects of physical design. The book is a core reference for graduate students and CAD professionals. For students, concept and algorithms are presented in an intuitive manner. For CAD professionals, the material presents a balance of theory and practice. An extensive bibliography is provided which is useful for finding advanced material on a topic. At the end of each chapter, exercises are provided, which range in complexity from simple to research level.read more
Citations
More filters
Patent
Advanced modular cell placement system with overlap remover with minimal noise
TL;DR: In this article, a method for refining the position of linearly aligned cells on the surface of a semiconductor chip is presented, which consists of defining an array of spaces between cells based on maximum and minimum cell positions, establishing a minimum spacing between cells, and linearly shifting cells in a predetermined manner such that no cells are closer to one another than the minimum space between cells.
Proceedings ArticleDOI
FAST-SP: a fast algorithm for block placement based on sequence pair
Xiaoping Tang,D. F. Wong +1 more
TL;DR: FAST-SP translates each sequence pair to its corresponding block placement in O(n log log n) time based on a fast longest common subsequence computation, much faster than the traditional O( n2) method by first constructing horizontal and vertical constraint graphs and then performing longest path computations.
Patent
Hexagonal field programmable gate array architecture
Michael D. Rostoker,James S. Koford,Ranko Scepanovic,Edwin R. Jones,Gobi R. Padmanahben,Ashok K. Kapoor,Valeriy B. Kudryavtsev,Alexander E. Andreev,Stanislav V. Aleshin,Alexander S. Podkolzin +9 more
TL;DR: In this article, a tri-directional three-layer metal routing is proposed for hexagonal-shaped cells, where the conductors for interconnecting terminals of microelectronic cells of an integrated circuit prefer to be angularly displaced from each other.
Journal ArticleDOI
Global optimization of cerebral cortex layout
TL;DR: Functional areas of mammalian cerebral cortex seem positioned to minimize costs of their interconnections, down to a best-in-a-billion optimality level, which may indicate cortex optimizing mechanisms involve more global processes.
Proceedings ArticleDOI
Redundant-via enhanced maze routing for yield improvement
TL;DR: This paper proposes the first routing algorithm that considers feasibility of redundant via insertion in the detailed routing stage, and transforms the routing problem to a multiple constraint shortest path problem, and solved by Lagrangian relaxation technique.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.