DocumentCode
2621379
Title
Timing-driven placement for general cell layout
Author
Ogawa, Yasushi ; Pedram, Massoud ; Kuh, Ernest S.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
fYear
1990
fDate
1-3 May 1990
Firstpage
872
Abstract
A hierarchical technique is presented for the timing-driven placement of the general cells. It is assumed that maximum interconnection delays for nets are given. These timing constraints are transformed to net length constraints using technology-and process-dependent parameters, circuit-specific data such as input capacitance and output drivability, and the structural description, of the circuit. The problem is divided into a bottom-up clustering phase and a top-down enumerative placement phase. Both the natural connectivities and the net length constraints are considered during the bottom-up phase in order to generate a hierarchical cluster tree. During the top-down placement phase, they place each node of the cluster tree so that the layout area and total interconnection length are minimized while satisfying the net length constraints
Keywords
circuit layout; network topology; trees (mathematics); bottom-up clustering phase; circuit-specific data; general cell layout; hierarchical cluster tree; hierarchical technique; input capacitance; layout area; maximum interconnection delays; natural connectivities; net length constraints; output drivability; process-dependent parameters; structural description; timing constraints; timing-driven placement; top-down enumerative placement phase; total interconnection length; Capacitance; Computer science; Constraint optimization; Delay; Fabrication; Integrated circuit interconnections; Integrated circuit layout; Laboratories; Routing; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location
New Orleans, LA
Type
conf
DOI
10.1109/ISCAS.1990.112226
Filename
112226
Link To Document