A novel fixed-outline floorplanner with zero deadspace for hierarchical design

Fixed-outline floorplanning, which enables hierarchical design, is considered more and more important nowadays. In this paper, a novel SA-based Fixed-outline Floorplanner with the Optimal Area utilization named SAFFOA is introduced to improve the total wirelength. The basic idea is to build and solve a group of four quadratic equations in four variables iteratively, which can handle the fixed-outline constraint of any aspect ratio. A new topological representation called Ordered Quadtree is then custom-made for this basic idea to facilitate its integration into SA iterations. After the fixed-outline constraint with 100% area utilization is achieved, we will solve the tradeoff between the chip area and wirelength and thus concentrate on the latter in SA process. Experimental results show that the chip wirelength is decreased by about 16.8% and 8.6% on average, compared with two previous fixed-outline floorplanners on soft modules, which are both proved to be better than Parquet. Besides, our method is still competitive on the wirelength, even if compared with some leading-edge outline-free floorplanners. At last, Local Refinement is also adopted to guide the SA process and reshape soft modules to meet the constraint on their aspect ratios (ARs). With its help, SAFFOA can still generate feasible floorplans with no deadspace under a strict AR constraint such as [0.5,2].

[1]  Yoji Kajitani,et al.  Fixed-outline floorplanning with constraints through instance augmentation , 2005, 2005 IEEE International Symposium on Circuits and Systems.

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

[3]  Yici Cai,et al.  Corner block list representation and its application to floorplan optimization , 2004, IEEE Transactions on Circuits and Systems II: Express Briefs.

[4]  Yan Feng,et al.  A fixed-die floorplanning algorithm using an analytical approach , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[5]  Hai Zhou,et al.  ACG-adjacent constraint graph for general floorplans , 2004, IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings..

[6]  Yao-Wen Chang,et al.  Modern floorplanning based on B/sup */-tree and fast simulated annealing , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  J. Cong,et al.  Fast floorplanning by look-ahead enabled recursive bipartitioning , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  S. Hakimi,et al.  Globally optimal floorplanning for a layout problem , 1996 .

[9]  Evangeline F. Y. Young,et al.  Handling soft modules in general nonslicing floorplan usingLagrangian relaxation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  De-Sheng Chen,et al.  Fixed-outline floorplanning through evolutionary search , 2004 .

[11]  Joseph R. Shinnerl,et al.  An area-optimality study of floorplanning , 2004, ISPD '04.

[12]  Yoji Kajitani,et al.  The quarter-state sequence (Q-sequence) to represent the floorplan and applications to layout optimization , 2000, IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394).

[13]  R. Otten Automatic Floorplan Design , 1982, DAC 1982.

[14]  Pinhong Chen,et al.  Floorplan sizing by linear programming approximation , 2000, Proceedings 37th Design Automation Conference.

[15]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[16]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[17]  G. Clark,et al.  Reference , 2008 .

[18]  Takeshi Yoshimura,et al.  A stable fixed-outline floorplanning method , 2007, ISPD '07.

[19]  Chikaaki Kodama,et al.  A Graph Based Soft Module Handling in Floorplan , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[20]  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.

[21]  Igor L. Markov,et al.  Fixed-outline floorplanning: enabling hierarchical design , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[22]  Yao-Wen Chang,et al.  TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.

[23]  Yeong-Dae Kim,et al.  A linear programming-based algorithm for floorplanning in VLSI design , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  Hai Zhou,et al.  A Revisit to Floorplan Optimization by Lagrangian Relaxation , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[25]  Yao-Wen Chang,et al.  Modern floorplanning based on fast simulated annealing , 2005, ISPD '05.

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