ACG-adjacent constraint graph for general floorplans

ACG (adjacent constraint graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG are between modules close to each other, thus the physical distance of two modules can be measured directly in the graph; since an ACG is a constraint graph, the floorplan area and module positions can be simply found by longest path computations. A natural combination of horizontal and vertical relations within one graph renders a beautiful data structure with full symmetry. The direct correspondence between geometrical positions of modules and ACG structures also makes it easy to incrementally change a floorplan and evaluate the result. Experimental results show the superiority of this representation.

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

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

[3]  Edwin Kinnen,et al.  Rectangular duals of planar graphs , 1985, Networks.

[4]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

[5]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, Proceedings of International Conference on Computer Aided Design.

[6]  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).

[7]  Martin D. F. Wong,et al.  FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.

[8]  Sartaj Sahni,et al.  A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[9]  Yao-Wen Chang,et al.  TCG-S: orthogonal coupling of P*-admissible representations for general floorplans , 2004, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[10]  Yoji Kajitani,et al.  Rectangle-packing-based module placement , 1995, ICCAD.

[11]  Majid Sarrafzadeh,et al.  Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules , 1993, SIAM J. Comput..

[12]  Evangeline F. Y. Young,et al.  Twin binary sequences: a non-redundant representation for general non-slicing floorplan , 2002, ISPD '02.

[13]  Yao-Wen Chang,et al.  TCG-S: orthogonal coupling of P/sup */-admissible representations for general floorplans , 2002, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

[15]  Yao-Wen Chang,et al.  B*-Trees: a new representation for non-slicing floorplans , 2000, DAC.

[16]  Yao-Wen Chang,et al.  TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[17]  Evangeline F. Y. Young,et al.  Twin binary sequences: a non-redundant representation for general non-slicing floorplan , 2002, ISPD '02.

[18]  Yen-Tai Lai,et al.  Algorithms for floorplan design via rectangular dualization , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..