A new approach of fractal-dimension based module clustering for VLSI layout

This paper describes a new clustering approach for VLSI placement, which is based on a fractal dimension analysis for the topological structure of modules in a logic diagram. A distinctive feature of this approach is that the concept of a fractal dimension has been introduced into a logic diagram in such a way that clustering of modules is iterated while the fractal dimension of clustered modules remains in a prescribed range. A part of experimental results is also shown, which demonstrates that our clustering approach achieves better solutions than the conventional placement without clustering.<<ETX>>

[1]  Martine D. F. Schlag,et al.  Spectral K-Way Ratio-Cut Partitioning and Clustering , 1993, 30th ACM/IEEE Design Automation Conference.

[2]  P. Christie,et al.  A fractal analysis of interconnection complexity , 1993, Proc. IEEE.

[3]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Jason Cong,et al.  A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design , 1993, 30th ACM/IEEE Design Automation Conference.

[6]  Sivanarayana Mallela,et al.  Clustering based simulated annealing for standard cell placement , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[7]  A. Kahng,et al.  A new approach to effective circuit clustering , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[8]  Toshiro Akino,et al.  PLACEMENT OPTIMIZATION BY TREMBLING SPOT-CHECK , 1989 .

[9]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .