论文信息 - FLUTE: fast lookup table based wirelength estimation technique

FLUTE: fast lookup table based wirelength estimation technique

Wirelength estimation is an important tool to guide the design optimization process in early design stages. In this paper, we present a wirelength estimation technique called FLUTE. Our technique is based on pre-computed lookup table to make wirelength estimation very fast and very accurate for low degree nets. We show experimentally that for FLUTE, RMST, and HPWL, the average error in wirelength are 0.72%, 4.23%, and -8.71%, respectively, and the normalized runtime are 1, 1.24, and 0.16, respectively.

Chris C. N. Chu

[1] Hans Jürgen Prömel,et al. The Steiner Tree Problem , 2002 .

[2] Hai Zhou. Efficient Steiner tree construction based on spanning graphs , 2004, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3] Chris C. N. Chu,et al. FastPlace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4] Majid Sarrafzadeh,et al. An Introduction To VLSI Physical Design , 1996 .

[5] Jeffrey S. Salowe,et al. Closing the gap: near-optimal Steiner trees in polynomial time , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6] Chih-Liang Eric Cheng. RISA: accurate and efficient placement routability modeling , 1994, ICCAD.

[7] Feng Zhou,et al. Refined single trunk tree: a rectilinear steiner tree generator for interconnect prediction , 2002, SLIP '02.

[8] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

[9] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .

[10] Leonidas J. Guibas,et al. On Computing All North-East Nearest Neighbors in the L1 Metric , 1983, Inf. Process. Lett..

[11] David M. Warme,et al. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .