FLUTE: fast lookup table based wirelength estimation technique
Author:
- 22 February 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 696-701
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- FastPlace: efficient analytical placement using cell shifting, iterative local refinement,and a hybrid net modelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005
- Efficient Steiner tree construction based on spanning graphs2003
- Refined single trunk tree2002
- Exact Algorithms for Plane Steiner Tree Problems: A Computational Study2000
- Closing the gap: near-optimal Steiner trees in polynomial timeIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Steiner tree problemsNetworks, 1992
- On computing all north-east nearest neighbors in the L1 metricInformation Processing Letters, 1983
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966