Skip to main content
Top

1993 | Book

Design Automation for Timing-Driven Layout Synthesis

Authors: Sachin S. Sapatnekar, Sung-Mo Kang

Publisher: Springer US

Book Series : The International Series in Engineering and Computer Science

insite
SEARCH

About this book

Moore's law [Noy77], which predicted that the number of devices in­ tegrated on a chip would be doubled every two years, was accurate for a number of years. Only recently has the level of integration be­ gun to slow down somewhat due to the physical limits of integration technology. Advances in silicon technology have allowed Ie design­ ers to integrate more than a few million transistors on a chip; even a whole system of moderate complexity can now be implemented on a single chip. To keep pace with the increasing complexity in very large scale integrated (VLSI) circuits, the productivity of chip designers would have to increase at the same rate as the level of integration. Without such an increase in productivity, the design of complex systems might not be achievable within a reasonable time-frame. The rapidly increasing complexity of VLSI circuits has made de- 1 2 INTRODUCTION sign automation an absolute necessity, since the required increase in productivity can only be accomplished with the use of sophisticated design tools. Such tools also enable designers to perform trade-off analyses of different logic implementations and to make well-informed design decisions.

Table of Contents

Frontmatter
Chapter 1. Introduction
Abstract
Moore’s law [Noy77], which predicted that the number of devices integrated on a chip would be doubled every two years, was accurate for a number of years. Only recently has the level of integration be gun to slow down somewhat due to the physical limits of integration technology. Advances in silicon technology have allowed IC designers to integrate more than a few million transistors on a chip; even a whole system of moderate complexity can now be implemented on a single chip.
Sachin S. Sapatnekar, Sung-Mo Kang
Chapter 2. Delay Estimation
Abstract
Finding the delay of a digital circuit accurately is an important part of the design and verification process. Various levels of simulation can be used, depending on the accuracy desired, and the amount of CPU time that is affordable.
Sachin S. Sapatnekar, Sung-Mo Kang
Chapter 3. Transistor Sizing Algorithms: Existing Approaches
Abstract
Circuit delays in integrated circuits often have to be reduced to obtain faster response times. A typical digital integrated circuit consists of multiple stages of combinational logic blocks that lie between latches that are clocked by system clock signals. For such a circuit, delay reduction must ensure that valid signals are produced at each output latch of a combinational block, before any transition in the signal clocking the latch. In other words, the worst-case input-output delay of each combinational stage must be restricted to be below a certain specification.
Sachin S. Sapatnekar, Sung-Mo Kang
Chapter 4. A Convex Programming Approach to Transistor Sizing
Abstract
In Chapter 3, the transistor sizing problem was defined, and various approaches that have been used to tackle this problem were described. The chief shortcoming of most of these approaches, as pointed out in Section 3.7, was that the simplifying assumptions made by these algorithms to make the optimization problem more tractable may lead to a suboptimal solution.
Sachin S. Sapatnekar, Sung-Mo Kang
Chapter 5. Global Routing Using Zero-one Integer Linear Programming
Abstract
In recent years, the Application Specific Integrated Circuits (ASIC) market has been dominated by gate arrays and their improved form — the sea-of-gates (SOG) arrays [DD89]. The latter provides the advantages of quick turnaround times, high packing density and high performance circuits. With the introduction of large, channelless SOG arrays, conventional routers may no longer be able to handle the ever-increasing complexity of the VLSI interconnection problem. In this chapter, a new global router using Zero-one Integer Linear Programming (0–1 ILP) is presented for the case of sea-of-gates arrays. This global router can be used efficiently in high-performance custom layouts, as will be shown in Sections 5.5 and 6.4.
Sachin S. Sapatnekar, Sung-Mo Kang
Chapter 6. Timing-driven CMOS Layout Synthesis
Abstract
For high-performance custom VLSI chips, the layout of integrated circuits has often relied on the expertise of manual layout artists. The process of creating such manual layouts is time-consuming, tedious, and error-prone. As the size and complexity of VLSI circuits increase, the time required to create the layout, verify its correctness, and ensure that the timing specifications are met, increases drastically. At the same time, the available design cycle time has remained constant or even decreased. As a result, a strong need exists for intelligent tools to create correct layouts for various designs. Ideally, these tools should be able to generate layouts that are more compact, or at least as compact as those produced manually with a shorter turnaround time. In addition, the layout of circuits should meet all of the timing requirements specified by the designer.
Sachin S. Sapatnekar, Sung-Mo Kang
Backmatter
Metadata
Title
Design Automation for Timing-Driven Layout Synthesis
Authors
Sachin S. Sapatnekar
Sung-Mo Kang
Copyright Year
1993
Publisher
Springer US
Electronic ISBN
978-1-4615-3178-4
Print ISBN
978-1-4613-6393-4
DOI
https://doi.org/10.1007/978-1-4615-3178-4