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
Book ChapterDOI

Timing-Driven Interconnect Synthesis

TL;DR: This chapter addresses performance-driven interconnect synthesis, which seeks to optimize circuit performance by minimizing signal delays to critical sinks, and details key historical research developments that helped usher in the era of high-performance interConnect synthesis.
Proceedings Article

Simulated annealing based VLSI circuit partitioning for delay minimization

TL;DR: Two way partitioning of a circuit represented as a graph is made using simulated annealing procedure and delay between the partitions is minimized, proving the effectiveness of proposed method.
Journal ArticleDOI

A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints

TL;DR: This work presents an algorithm that is a factor of √ n faster for dense graphs in which many chord endpoints are shared, and argues that these assumptions are practical.
Proceedings ArticleDOI

Hierarchial clasterization, decomposition and multilevel macromodeling—the effective and efficient tools to solve the sigh and very high size combinatorial circuit type problems (abstract only)

TL;DR: The paper gives a generalization of author and his scientific group recent works in combinatorial non-polynomial high and very high size problems that appear in physical design automation of electronic devices including VLSI and SoC.
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.