A fast packing algorithm based on single-sequence

The single-Sequence (SS) is simply a sequence of integers 1, 2, 3, ..., n. But it leads a unique set of ABLR-relations (above. below, left-of, right-of) that hold among n objects on a plane. In this paper, we propose a fast packing algorithm based on SS, For an SS, we generate direct relation set (DRS) for each room. The module packing is directly obtained from DRS in linear time. DRS can be reused for all packing under the same floorplan. This will dramatically speed up the computation. As a feature of SS, this algorithm covers all possible placements. if our objective is in bounding-box area minimization. Experimental results show that the proposed algorithm is pretty fast and efficient compared with the performances attained by conventional algorithms.

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

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

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

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

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

[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]  Chikaaki Kodama,et al.  Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair , 2003, ASP-DAC '03.