Floorplanning with abutment constraints and L-shpaed/T-shaped blocks baed on corner block list

Authors:
Yuchun Ma;Xianlong Hong;Sheqin Dong;Yici Cai;Chung-Kuan Cheng;Jun Gu
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Engineering, University of California, San Diego;Department of Computer Science, Science & Technology University of HongKong
Venue:
Proceedings of the 38th annual Design Automation Conference
Year:
2001

Citing 7
Cited 8

Module placement on BSG-structure and IC layout applications

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Arbitrary convex and concave rectilinear block packing using sequence-pair

ISPD '99 Proceedings of the 1999 international symposium on Physical design
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
B*-Trees: a new representation for non-slicing floorplans

Proceedings of the 37th Annual Design Automation Conference
VLSI floorplanning with boundary constraints based on corner block list

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
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
VLSI module placement based on rectangle-packing by the sequence-pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

An optimum placement search algorithm based on extended corner block list

Journal of Computer Science and Technology
Stairway Compaction using Corner Block List and Its Applications with Rectilinear Blocks

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Stairway compaction using corner block list and its applications with rectilinear blocks

ACM Transactions on Design Automation of Electronic Systems (TODAES)
On handling arbitrary rectilinear shape constraint

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Multi-bend bus driven floorplanning

Proceedings of the 2005 international symposium on Physical design
A fast algorithm for rectilinear block packing based on selected sequence-pair

Integration, the VLSI Journal
Multi-bend bus driven floorplanning

Integration, the VLSI Journal
Hierarchical congregated ant system for bottom-up VLSI placements

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.