半导体学报2000，Vol.21Issue(11)：1129-1138,10.
A New Timing-Driven Placement Algorithm Based on Table-Lookup Delay Model
A New Timing-Driven Placement Algorithm Based on Table-Lookup Delay Model
摘要
Abstract
An algorithm is presented for obtaining placements of cell-based very large scale integrated circuits, subject to timing constraints based on table-lookup model. A new timing delay model based on some delay tables of fabricators is first simplified and deduced; then it is formulated as a constrained programming problem using the new timing delay model. The approach combines the well-known quadratic placement with bottom-up clustering, as well as the slicing partitioning strategy, which has been tested on a set of sample circuits from industry and the results obtained show that it is very promising.关键词
table-lookup/timing/clustering/quadratic placementKey words
table-lookup/timing/clustering/quadratic placement分类
信息技术与安全科学引用本文复制引用
于泓,洪先龙,姚波,蔡懿慈..A New Timing-Driven Placement Algorithm Based on Table-Lookup Delay Model[J].半导体学报,2000,21(11):1129-1138,10.基金项目
Project Supported by National Natural Science Foundation of China (No. 69776027) and by 973 National Key Project(No. G1998030413). （No. 69776027）
