ACM Home Page
Please provide us with feedback. Feedback
Floorplanning with abutment constraints and L-shpaed/T-shaped blocks baed on corner block list
Full text PdfPdf (263 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 38th annual Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 770 - 775  
Year of Publication: 2001
ISBN:1-58113-297-2
Authors
Yuchun Ma  Department of Computer Science and Technology, Tsinghua University, Beijing, China
Xianlong Hong  Department of Computer Science and Technology, Tsinghua University, Beijing, China
Sheqin Dong  Department of Computer Science and Technology, Tsinghua University, Beijing, China
Yici Cai  Department of Computer Science and Technology, Tsinghua University, Beijing, China
Chung-Kuan Cheng  Department of Computer Science and Engineering, University of California, San Diego
Jun Gu  Department of Computer Science, Science & Technology University of HongKong
Sponsors
EDAC : Electronic Design Automation Consortium
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): 19,   Citation Count: 7
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/378239.379063
What is a DOI?

ABSTRACT

The abutment constraint problem is one of the common constraints in practice to favor the transmission of data between blocks. Based on Corner Block List(CBL), a new algorithm to deal with abutment constraints is developed in this paper. We can obtain the abutment information by scanning the intermediate solutions represented by CBL in linear time during the simulated annealing process and fix the CBL in case the constraints are violated. Based on this algorithm, a new method to deal with L-shaped/T-shaped blocks is proposed. The shape flexibility of the soft blocks and the rotation and reflection of L-shaped/T-shaped blocks are exploited to obtain a tight packing. The experiment results are demonstrated by some benchmark data and the performance shows effectiveness of the proposed method.


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
Hiroshi Murata, Kunihiro Fujiyoshi, S.Nakatake and Y.Kajitani, "VLSI Block Placement Based on Rectangle- Packing by the Sequence Pair" in IEEE Trans. on CAD,vol.15, NO. 15, pp 1518-1524,1996.
 
2
3
4
 
5
 
6
M.Kang and W.W.M.Dai, "General Floorplanning with L- shaped, T- shaped and Soft Blocks Based on Bounded Slicing Grid Structure", IEEE Asia and South Pacific Design Automation Conference, pp. 265-270,1997.
 
7
F.Y.Young,Hannah H.Yang, D.F.Wong "On extending slicing floorplans to handle L/T-shaped blocks and abutment constraints" WCC'2000, pp.269-276,2000.
8
9

CITED BY  7

Collaborative Colleagues:
Yuchun Ma: colleagues
Xianlong Hong: colleagues
Sheqin Dong: colleagues
Yici Cai: colleagues
Chung-Kuan Cheng: colleagues
Jun Gu: colleagues