Research on evaluating wire length using fractal in placement

Xu Ning; He Songbai; Yu Juebang

Volume 25 Issue 1

Jan. 2003

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2003 > 25(1): 128-130

Xu Ning, He Songbai, Yu Juebang. Research on evaluating wire length using fractal in placement[J]. Journal of Electronics & Information Technology, 2003, 25(1): 128-130.

Citation:

Xu Ning, He Songbai, Yu Juebang. Research on evaluating wire length using fractal in placement[J]. Journal of Electronics & Information Technology, 2003, 25(1): 128-130.

Xu Ning, He Songbai, Yu Juebang. Research on evaluating wire length using fractal in placement[J]. Journal of Electronics & Information Technology, 2003, 25(1): 128-130.

Citation:

Xu Ning, He Songbai, Yu Juebang. Research on evaluating wire length using fractal in placement[J]. Journal of Electronics & Information Technology, 2003, 25(1): 128-130.

PDF( 453 KB)

Research on evaluating wire length using fractal in placement

Xu Ning^{①;何松柏},
He Songbai,
Yu Juebang

Received Date: 2000-10-20
Rev Recd Date: 2002-01-24
Publish Date: 2003-01-19

Abstract

Abstract

The target of placement problem is related to the wire length, and the time delay optimization is also related to it. But in placement stage, it has not finished final routing, and must be decided without any wire routing whether a kind of placement is good or not, there must have a simple and accurate estimation method of wire net length to evaluate wire length. This paper introduces some kinds of conventional methods which are used to evaluate the wire length, then a new method using fractal to evaluate the wire length is given.

FullText(HTML)

References(1)

References

W.M. Dai, E. S. Kuh, Simultaneous floor planning and global routing for hierarchical building block layout, IEEE Trans, on CAD, 1987, CAD-6(2), 828 837.[2]T. Hasegawa, A new placement algorithm minimizing path delays, New York, Proc. ICCAD,1991, 2052-2055.[3]U. Lauther, A min-cut placement algorithm for general cell assemblies based on a graph representation, ACM/IEEE Proc. 16th DAC, Paris, 1979, 1-10. [4]Tianmin Kong, Xianlong Hong, Changge Qiao, VEAP.[J].A global optimization based, placement algorithm for standard cell design, ASP-DAC97, Japan.1997,1:102-109[4]W.J. Sun, C. Sechen, Efficient and effective placement for very large circuits, Proc. Int. Conf.on CAD, Japan, 1993, 170-177.[5]B.B. Mandelbort, The Fractal Geometry of Nature, San Francisco, W. H. Freeman and Co.,1972, 35-100.[6]T.J. Bedford, The box dimension of selfaffine graphs and repellers, Nonlineanrity, 1989, 1(2),78-86.

Relative Articles

Supplements(0)

Cited By

Proportional views