Corner block list representation and its application with boundary constraints

Floorplanning is a critical phase in physical design of VLSI circuits. The stochastic optimization method is widely used to handle this NP-hard problem. The key to the floorplanning algorithm based on stochastic optimization is to encode the floorplan structure properly. In this paper, corner block list (CBL)—a new efficient topological representation for non-slicing floorplan—is proposed with applications to VLSI floorplan. Given a corner block list, it takes only linear time to construct the floorplan. In floorplanning of typical VLSI design, some blocks are required to satisfy some constraints in the final packing. Boundary constraint is one kind of those constraints to pack some blocks along the pre-specified boundaries of the final chip so that the blocks are easier to be connected to certain I/O pads. We implement the boundary constraint algorithm for general floorplan by extending CBL. Our contribution is to find the necessary and sufficient characterization of the blocks along the boundary represented by CBL. We can check the boundary constraints by scanning the intermediate solutions in 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.

[1]  Mineo Kaneko,et al.  VLSI/PCB placement with obstacles based on sequence-pair , 1997, ISPD '97.

[2]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

[3]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[4]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

[5]  Isao Shirakawa,et al.  A layout approach to Monolithic Microwave IC , 1995, ASP-DAC '95.

[6]  Yici Cai,et al.  Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[7]  Evangeline F. Y. Young,et al.  Slicing floorplans with boundary constraints , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Wayne Wei-Ming Dai,et al.  General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[9]  Isao Shirakawa,et al.  A layout approach to monolithic microwave IC , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Wayne Wei-Ming Dai,et al.  Hierarchical placement and floorplanning in BEAR , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Robert W. Dutton,et al.  An Analytical Algorithm for Placement of Arbitrarily Sized Rectangular Blocks , 1985, 22nd ACM/IEEE Design Automation Conference.

[12]  Hidetoshi Onodera,et al.  Branch-and-bound placement for building block layout , 1991, 28th ACM/IEEE Design Automation Conference.

[13]  Evangeline F. Y. Young,et al.  Slicing floorplans with pre-placed modules , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[14]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Yici Cai,et al.  A timing-driven block placer based on sequence pair model , 1999, Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198).

[16]  Evangeline F. Y. Young,et al.  Slicing floorplans with range constraint , 1999, ISPD '99.