ACM Home Page
Please provide us with feedback. Feedback
Topology constrained rectilinear block packing for layout reuse
Full text PdfPdf (1.04 MB)
Source International Symposium on Physical Design archive
Proceedings of the 1998 international symposium on Physical design table of contents
Monterey, California, United States
Pages: 179 - 186  
Year of Publication: 1998
ISBN:1-58113-021-X
Authors
Maggie Zhi-Wei Kang  Dept. of Computer Engineering, University of California, Santa Cruz
Wayne Wei-Ming Dai  Dept. of Computer Engineering, University of California, Santa Cruz
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 14,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/274535.274562
What is a DOI?

ABSTRACT

In this paper, we formulate the problem of top olo gy constrained rectiline ar blo ck packing in la yout reuse. A specific class of rectilinear shaped blocks, ordered convex r ectiline ar blo cks, is represen ted in bounded slicing grid (BSG) structure. The Non-overlapped pac king is guaranteed. Based on both sequence pair (SP) and BSG structures, w e propose an algorithm to compact the ordered con vexbloc ks under the topological constrain ts, in whic hthe x and y directions are independently compacted. By augumenting or further partitioning the arbitrary rectilinear blocks in to the ordered con vexshapes, this method can be extended to handle the topology constrained rectilinear block pac king. Furthermore, our recent theoretical progress is briefly reported at the end of this paper, in which arbitrarily rectilinear shaped blocks are represented in SP structure. Three necessary and sufficient constrain ts are deriv ed on the sequence pair, such that the non-overlapping compaction is guaranteed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Nakatake, H. Murata, K. Fujiyoshi, and Y. Kajitani, "Bounded-Slicing Structure for Module Placement," Tech. Rep. 313, Institute of Electronics, Information and Communication Engineers of Japan, 1994.
 
2
 
3
M. Kang and W. W.-M. Dai, "General Floorplanning with L- shaped, T-shaped and Soft Blocks Based on Bounded Slicing Grid Structure," in Proc. of Asia and South Pacific Design Automation Conf. 1997, (Chiba, Japan), pp. 265-270, Feburaxy 1997.
 
4
J. Dufour, tL McBride, P. Zhang, and C.-K. Cheng, "A Building Block Placement Tool," in Proc. 1997 Aisa and South Pacific Design Automation Conf., (Chiba, Japan), pp. 271- 276, January 1997.
 
5

CITED BY  8

Collaborative Colleagues:
Maggie Zhi-Wei Kang: colleagues
Wayne Wei-Ming Dai: colleagues