A Fixed-outline Floorplanning Method Based on 2.5D

In this paper, a fixed-outline floorplanning algorithm based on 2.5D is proposed. By using constraints of area and number of pins to divide the modules into 4 layers, it confines the variations of the widths of the floorplans to a small region through common subsequence of sequence pair representation. The goal of minimizing the area is consistent with that of satisfying the given outline. A set of benchmarks is used for test. Experiments show that the proposed algorithm can achieve high successful probabilities in short run time, even with tight outlines and large aspect ratios are imposed.

[1]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Igor L. Markov,et al.  Fixed-outline floorplanning through better local search , 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

[3]  Yici Cai,et al.  Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[4]  Andrew B. Kahng,et al.  Classical floorplanning harmful? , 2000, ISPD '00.

[5]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

[6]  Chang-Tzu Lin,et al.  Robust fixed-outline floorplanning through evolutionary search , 2004, ASP-DAC.

[7]  Takeshi Yoshimura,et al.  An enhanced perturbing algorithm for floorplan design using the O-tree representation , 2000, ISPD '00.

[9]  Yao-Wen Chang,et al.  B*-trees: a new representation for non-slicing floorplans , 2000, Proceedings 37th Design Automation Conference.