TIMING OPTIMIZATION BY GATE RESIZING AND CRITICAL PATH IDENTIFICATION

Authors
Citation
Cl. Fang et Wb. Jone, TIMING OPTIMIZATION BY GATE RESIZING AND CRITICAL PATH IDENTIFICATION, IEEE transactions on computer-aided design of integrated circuits and systems, 14(2), 1995, pp. 201-217
Citations number
39
Categorie Soggetti
Computer Application, Chemistry & Engineering","Computer Science Hardware & Architecture
ISSN journal
02780070
Volume
14
Issue
2
Year of publication
1995
Pages
201 - 217
Database
ISI
SICI code
0278-0070(1995)14:2<201:TOBGRA>2.0.ZU;2-M
Abstract
Due to the rapid progress in VLSI technology, the overall complexity o f the chip has increased dramatically. There is a simultaneous need fo r more functions and higher speed in modern VLSI engineering. Therefor e, use of a minimum amount of extra hardware to meet timing requiremen ts is becoming a major issue in VLSI design. Here, we propose an effic ient method for timing optimization using gate resizing. To control th e hardware overhead, a minimum (or as small as possible) number of gat es are selected for resizing with the aid of a powerful benefit functi on. To guarantee the performance of timing optimization, a modified ve rsion of PODEM [1], called tau PODEM, ensures that each resized gate i s located on at least one critical path. Thus, resizing a gate definit ely reduces circuit delay. Simulation results demonstrate that our tim ing optimization method can efficiently reduce circuit delay with a li mited amount of gate resizing.