A New Timing- Driven Placement Algorithm Based on Table- Lookup Delay Model  

作　　者：于泓 洪先龙 姚波 蔡懿慈 

出　　处：《Journal of Semiconductors》2000年第11期1129-1138,共10页半导体学报（英文版）

基　　金：Project Supported by National Natural Science Foundation of China!( No.697760 2 7) and by973 National Key Project( No.G1 9980)

摘　　要：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.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.

关 键 词：二次布局 定时驱动布局 延迟模式 算法 

分 类 号：TN402[电子电信—微电子学与固体电子学]