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
Book ChapterDOI
Floorplan and Timing
TL;DR: A well-thought-out floorplan leads to an ASIC design with higher performance and optimum area, and can be applied to any physical design.
Scenario-Oriented Design for Single-Chip
TL;DR: Motivated by this, new bench- mark-based design strategies for SCHMs are described which are referred to as scenario-oriented design and include an example and results.
Journal ArticleDOI
Performance Enhancement of Standard Cell Placement Techniques using Memetic Algorithm
TL;DR: This paper discusses the Memetic algorithm as a solution to Standard Cell Placement (SCP) problem and procedures are laid down to strike a balance between genetic search and local search in MAs.
Proceedings ArticleDOI
Routing methodology for minimizing 1nterconnect energy dissipation
TL;DR: In this article, the routing grid configuration for automatic place and route methodology for sub-quarter micron system-on-a-chip (SoC) was optimized to reduce coupling effects such as crosstalk noise and coupled energy dissipation.
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.