An improved P-admissible floorplan representation based on corner block list

The corner block list representation (CBL) introduced in 2000 is an efficient and effective model for floorplanning and placement while still having some limitations such as redundancy and incompleteness. In this paper, we present an auxiliary 3-route model to eliminate the redundancy and insert empty rooms to resolve the incompleteness. Finally we attain a P-admissible representation ECBL (2) which has higher performances than the original CBL and the count of its solution space is O((2n)!2/sup 6n//n!n/sup 4/).

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

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

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

[4]  Jun Gu,et al.  ECBL: an extended corner block list with solution space including optimum placement , 2001, ISPD '01.

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

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

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

[8]  Yoji Kajitani,et al.  An enhanced Q-sequence augmented with empty-room-insertion and parenthesis trees , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.