Theory of T-junction floorplans in terms of single-sequence

In a placement, two rectangles on a plane are non-overlapping if and only if the relationship between them is one of ABLR (above, below, left-of, right-of)-relations. From the standpoint that a system of ABLR-relations is specified by the designer to confine the placement, the first concern is its consistency, i.e. if there is a corresponding placement. The second is an efficient way to construct a corresponding placement. The third is a handy coding of the ABLR-system all the way. In this paper, the first concern is solved by an existence condition of the primal-and dual-orders of rectangles. The second is answered by a linear time construction algorithm of a T-junction floorplan. This is new in its speed and generality with respect to the number of rooms. The third is by a new coding single-sequence SS. Its unique suitability to handle the T-junction floorplan is remarkable. Using the merit that SS can control the distribution of empty rooms, a novel application is suggested to space-planning, a recent trend in VLSI physical design to budget the space for congestion relief and interference separation (though the detail is not contained here for the space).

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

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

[3]  Yoji Kajitani,et al.  Space-planning: placement of modules with controlled empty area by single-sequence , 2004 .

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

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

[6]  Xuliang Zhang Xuliang Zhang,et al.  Layer based area partition using single-sequence for preferable routes , 2003, ASIC, 2003. Proceedings. 5th International Conference on.

[7]  Yici Cai,et al.  Stairway compaction using corner block list and its applications with rectilinear blocks , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

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

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

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

[11]  Hidetoshi Onodera,et al.  Branch-and-bound placement for building block layout , 1991, 28th ACM/IEEE Design Automation Conference.

[12]  Israel Koren,et al.  Floorplans, planar graphs and layouts , 1988 .

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

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

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

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