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
Proceedings ArticleDOI
HW/SW co-design architecture exploration for VLSI maze routing
TL;DR: This work demonstrate that the architecture composed of a soft-core processor directly connected to the hardware accelerator with fully utilized FIFO channel achieves the best power-delay product among all the investigated architectures.
Journal ArticleDOI
Signed Power-of-Two Expression for Multipliers of Lifting Wavelet for Image Compression
TL;DR: This paper proposes a method in which the coefficient values of each multiplier are provided by the signed power-of-two (SPT) representation, using a sum of powers of 2 with as small a (finite) number of terms as possible, so that the error caused by coefficient mismatch is smaller than theerror caused by quantization.
Journal ArticleDOI
Pole-Aware Analog Layout Synthesis Considering Monotonic Current Flows and Wire Crossings
TL;DR: In this article , a pole-aware analog layout synthesis methodology is proposed to minimize the total wire load and wire crossings while satisfying different symmetry and topological routing constraints using a strong-connectivity approach to the group Steiner problem.
Dissertation
A Multiple-objective ILP based Global Routing Approach for VLSI ASIC Design
TL;DR: A power efficient multi-pin global routing technique (PIRT) is proposed in this thesis and results indicate that an average power savings as high as 32% for the 130-nm technology can be achieved with no impact on the maximum chip frequency.
Journal ArticleDOI
Topological transformation of submicron VLSIs for the double lithographic mask technology
TL;DR: In this paper, the advantages and disadvantages of the suggested approaches are discussed, which are oriented towards the application of high-performance computing systems, as well as the results of experimental investigations, which were performed using the developed software.
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.