| Floorplanning with abutment constraints and L-shpaed/T-shaped blocks baed on corner block list |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 19, Citation Count: 7
|
|
|
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
|
Shigetoshi Nakatake , Kunihiro Fujiyoshi , Hiroshi Murata , Yoji Kajitani, Module placement on BSG-structure and IC layout applications, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.484-491, November 10-14, 1996, San Jose, California, United States
|
 |
3
|
Pei-Ning Guo , Chung-Kuan Cheng , Takeshi Yoshimura, An O-tree representation of non-slicing floorplan and its applications, Proceedings of the 36th ACM/IEEE conference on Design automation, p.268-273, June 21-25, 1999, New Orleans, Louisiana, United States
[doi> 10.1145/309847.309928]
|
 |
4
|
Yun-Chih Chang , Yao-Wen Chang , Guang-Ming Wu , Shu-Wei Wu, B*-Trees: a new representation for non-slicing floorplans, Proceedings of the 37th conference on Design automation, p.458-463, June 05-09, 2000, Los Angeles, California, United States
[doi> 10.1145/337292.337541]
|
| |
5
|
Xianlong Hong , Gang Huang , Yici Cai , Jiangchun Gu , Sheqin Dong , Chung Kuan Cheng , Jun Gu, Corner block list: an effective and efficient topological representation of non-slicing floorplan, Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, November 05-09, 2000, San Jose, California
|
| |
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
|
Yuchun Ma , Sheqin Dong , Xianiong Hong , Yici Cai , Chung-Kuan Cheng , Jun Gu, VLSI floorplanning with boundary constraints based on corner block list, Proceedings of the 2001 conference on Asia South Pacific design automation, p.509-514, January 2001, Yokohama, Japan
[doi> 10.1145/370155.370521]
|
 |
9
|
|
CITED BY 7
|
|
Sheqin Dong , Shuo Zhou , Xianlong Hong , Chungkuan Cheng , Jun Gu , Yici Cai, An optimum placement search algorithm based on extended corner block list, Journal of Computer Science and Technology, v.17 n.6, p.699-707, November 2002
|
|
|
|
|
|
|
|
|
Yuchun Ma , Xianlong Hong , Sheqin Dong , Yici Cai , Chung-Kuan Cheng , Jun Gu, Stairway compaction using corner block list and its applications with rectilinear blocks, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.9 n.2, p.199-211, April 2004
|
|
|
|
|
|
Yuchun Ma , Xianlong Hong , Sheqin Dong , Yici Cai , Chung-Kuan Cheng , Jun Gu, Stairway Compaction using Corner Block List and Its Applications with Rectilinear Blocks, Proceedings of the 2002 conference on Asia South Pacific design automation/VLSI Design, p.387, January 07-11, 2002
|
|
|
|
|