Removing operation of empty rooms on sequence-pair

In order to specify wiring channels on a given module placement, a method to obtain a floorplan using sequence-pair from a module placement was recently proposed. In the method, empty rooms which are redundant but are generated to keep topology between modules are removed locally on a floorplan. However, this operation is hard to implement because of many operations on a planar graph. In this paper, we reveal underlying theorems in the removing operation of empty rooms, and propose this removing operation not via floorplan but only on sequence-pair

[1]  Chikaaki Kodama,et al.  Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair , 2003, ASP-DAC '03.

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

[3]  Majid Sarrafzadeh,et al.  NRG: global and detailed placement , 1997, ICCAD 1997.

[4]  Chikaaki Kodama,et al.  A novel encoding method into sequence-pair , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[5]  Dinesh P. Mehta,et al.  The quarter-state-sequence floorplan representation , 2003 .

[6]  Yoji Kajitani,et al.  A mapping from sequence-pair to rectangular dissection , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[7]  Takeshi Yoshimura,et al.  Floorplanning using a tree representation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[9]  R. Forbes Heuristic Acceleration of Force-Directed Placement , 1987, 24th ACM/IEEE Design Automation Conference.