Algorithms for VLSI Design Automation

ISBN-13: 9780471984894 / Angielski / Twarda / 1999 / 340 str.

Sabih H. Gerez;Gerez

Opis

Modern microprocessors such as Intel's Pentium chip typically contain millions of transitors. Known generically as Very Large-Scale Integrated (VLSI) systems, the chips have a scale and complexity that has necessitated the development of CAD tools to automate their design. This book focuses on the algorithms which are the building blocks of the design automation software which generates the layout of VLSI circuits. One of the first books on the subject, this guide covers all stages of design.

Spis treści

PRELIMINARIES.

Introduction to Design Methodologies.

A Quick Tour of VLSI Design Automation Tools.

Algorithmic Graph Theory and Computational Complexity.

Tractable and Intractable Problems.

General–purpose Methods for Combinatorial Optimization.

SELECTED DESIGN PROBLEMS AND ALGORITHMS.

Layout Compaction.

Placement and Partitioning.

Floorplanning.

Routing.

Simulation.

Logic Synthesis and Verification.

High–level Synthesis.

Appendices.

References.

Index.

O autorze

The author, Sabih Gerez, has based the book on a course given to his students at the University of Twente, Enschede, in the Netherlands. As an assistant professor at the Department of Electrical Engineering, he teaches courses on circuit theory and VLSI design. His research focuses on VLSI design automation, especially high–level synthesis. Dr Gerez holds an M.Sc. degree (with honors) in Electrical Engineering and a Ph.D. degree in Applied Sciences, both from the University of Twente.

Blurb

Very large scale integrated (VLSI) circuits nowadays contain many millions of components, and cannot be designed without the aid of design automation tools. This book provides an insight into the algorithms used inside these computer–aided design (CAD) tools, and will be a good starting point for designers who want to specialize in building CAD tools themselves. Highlights of the book include:
∗ Special attention to background knowledge from mathematics and computer science: graph theory, complexity of algorithms, and general–purpose methods for combinatorial optimization
∗ About 50 algorithms (from graph theory, layout design, simulation, logic synthesis and high–level synthesis) presented in depth by means of pseudo–code and step–by–step examples
It will be an ideal text for students in Computer Science or Electronic Engineering taking VLSI design automation courses, and for chip designers or programmers in industry developing CAD tools.