scispace - formally typeset
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

Method for estimating routability and congestion in a cell placement for integrated circuit chip

TL;DR: In this article, a method for estimating routing density in the placement of a microelectronic integrated circuit includes superimposing a pattern of contiguous tiles over the placement, with each of the tiles having edges.
Journal ArticleDOI

Estimating routing congestion using probabilistic analysis

TL;DR: A net-based stochastic model for computing expected horizontal and vertical track usage, which considers routing blockages is proposed and the main advantages of this algorithm are its accuracy and fast runtime.
Proceedings ArticleDOI

Estimating routing congestion using probabilistic analysis

TL;DR: A net-based stochastic model for computing expected horizontal and vertical track usage, which considers routing blockages is proposed, and the main advantages of this algorithm are accuracy and fast runtime.
Patent

Integrated circuit layout routing using multiprocessing

TL;DR: In this paper, a multithreaded wavefront routing system for simultaneously planning routes for wiring a semiconductor chip surface is presented, where the surface has a plurality of grids located thereon and routes are planned according to a predetermined netlist.
Journal ArticleDOI

A comparative study of two Boolean formulations of FPGA detailed routing constraints

TL;DR: It is demonstrated that the route-based formulation of Boolean SAT-based routing yields an easier-to-evaluate and more scalable routability Boolean function than the track-based method, providing empirical evidence that a smart/efficient Boolean formulation can achieve significant performance improvement in real-world applications.
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.