A fast algorithm for rectilinear block packing based on selected sequence-pair

• Published in: Integration (Amsterdam) Vol. 40; no. 3; pp. 274 - 284
• Main Authors: Fujiyoshi, Kunihiro, Kodama, Chikaaki, Ikeda, Akira
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01-04-2007; Elsevier Science
• Subjects: Applied sciences; Design. Technologies. Operation analysis. Testing; Electronics; Exact sciences and technology; Floorplan; Integrated circuits; Packing; Placement; Rectilinear block; Selected sequence-pair; Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices; Sequence-pair; Sequence-pair; Selected sequence-pair; Floorplan; Rectilinear block; Packing; Placement; Performance evaluation; Lower bound; Circuit design; Integrated circuit layout; Partitioning; Fast algorithm; Time complexity; Computer aided design; Comparative study
• ISSN: 0167-9260; 1872-7522
• DOI: 10.1016/j.vlsi.2006.01.003

In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain a rectilinear block packing in
O
(
(
p
+
1
)
n
)
time keeping all the constraints imposed by a given SSP. Here,
p
is the number of rectilinear blocks excluding rectangles and
n
is that of rectangle sub-blocks obtained by partitioning each rectilinear block. So far, the fastest method based on a sequence-pair required
O
(
n
2
+
ℓ
3
)
time, where
ℓ
is the number of rectilinear blocks. If
p
is constant, the proposed algorithm requires
O
(
n
)
time, which is equal to the trivial lower bound of the time complexity for decoding. The effectiveness of the proposed method was confirmed by the experimental comparisons, especially when
p
is constant.