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
Hybrid evolutionary algorithm of planning VLSI
V.B. Lebedev,A.N. Samoylov +1 more
TL;DR: The mechanisms of genetic search and collective alternative adaptation at planning VLSI are described and it is shown that the former is superior to the latter in terms of both simplicity and efficiency.
Proceedings ArticleDOI
Effect of Module Order on VLSI Floor Planning using Simulated Annealing
Ashwini Desai,Uday Wali +1 more
TL;DR: The proposed algorithm uses the number of blocks as specified in Microelectronics Centre of North Carolina (MCNC) benchmark circuits and the best floor-plan is chosen as a near optimal solution.
Deterministic versus Non-Deterministic Placement Algorithms for Automatic Layout Synthesis Tools
Fernando Moraes,A. Josep Velasco +1 more
TL;DR: The goal of this paper is the comparison of performance of both strategies, studying the silicon area consumption and the CPU requirements, using an automatic layout synthesis tool.
Proceedings ArticleDOI
FPGA Placement Improvement Using a Genetic Algorithm and the Routing Algorithm as a Cost Function
TL;DR: It is shown that using the routing algorithm as a cost function improves the placement in the optimization of the final critical path and has advantages over the traditional simulated annealing method.
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.