ACM Home Page
Please provide us with feedback. Feedback
VLSI floorplanning with boundary constraints based on corner block list
Full text PdfPdf (292 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2001 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
Pages: 509 - 514  
Year of Publication: 2001
ISBN:0-7803-6634-4
Authors
Yuchun Ma  Department of Computer Science and Technology, Tsinghua University, Beijing, China
Sheqin Dong  Department of Computer Science and Technology, Tsinghua University, Beijing, China
Xianiong Hong  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, La Jolla, CA
Jun Gu  Department of Computer Science, Science & Technology University of HongKong
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IPSJ : Information Processing Society of Japan
IEEE HK CAS : IEEE HK CAS and Comm. Joint Chapter
IEICE : Inst of Electronics, Info & Communication Engineers
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

In floorplanning of typical VLSI design, some modules are required to satisfy some placement constraints in the final packing. Boudary Constraint is one kind of those placement constraints to pack some modules along one of the four sides: on the left, on the right, at the bottom or at the top of the final floorplan. We implement the boundary constraint algorithm for general floorplan by extending the Corner Block List (CBL) - a new efficient topology representation for non-slicing floorplan. Our contribution is to find the necessary and sufficient characterization of the modules along the boundary represented by Corner Block List. So that we can check the boundary constraints by scanning the intermediate solutions in the linear time during the simulated annealing process and fix the corner block list in case the constraints are violated. The experiment results are demonstrated by several examples of MCNC benchmarks and the performance is remarkable.


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
F.Y.Young, D.F.Wong, and Hannah H.Yang, "Slicing Floorplans with Boundary Constraints," in IEEE Trans. on Computer Aided Design,vol.18, NO. 9,pp 1385-1389,1999.
 
2
Hiroshi Murata, Kunihiro Fujiyoshi, Mineo Kaneko, "VLSI/PCB Placement with Obstacles Based on Sequence Pair" in IEEE Trans. on Computer Aided Design,vol.17, NO. 1, pp 60-67,1998.
 
3
4
 
5
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.
 
6
Hiroshi Murata, Kunihiro Fujiyoshi, S.Nakatake and Y.Kajitani, "VLSI Module Placement Based on Rectangle-Packing by the Sequence Pair" in IEEE Trans. on Computer Aided Design,vol.15, NO. 15, pp 1518- 1524,1996.
 
7
 
8
 
9
10

CITED BY  10

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