Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lauther, U., A min-cut placement algorithm for general cell assemblies based on a graph representation, in Proceedings of 16th ACM/IEEE Design Automation Conference (DAC79) (ed. ACM, IEEE), 1979, 1–10.
Dai, W. M., Eschermann, B., Kuh, E. S. et al., Hierarchical placement and floorplanning in BEAR, in IEEE Trans. on Computer Aided Design, vol. CAD-8, 1989, (12): 1335–1349.
Sha, L., Dutton, W., An analytical algorithm for placement of arbitrary sized rectangular blocks, in Proceedings of 22nd ACM/IEEE Design Automation Conference (DAC85) (ed. ACM, IEEE), 1985, 602–608.
Wong, D. F., Liu, C. L., A new algorithm for floorplan design, Proceedings of 23rd ACM/IEEE Design Automation Conference (DAC86) (ed. ACM, IEEE), 1986, 101–107.
Onodera, H., Taniguychi, Y., Tamaru, K., Branch and bound placement for building block layout, in Proceedings of 28th ACM/IEEE Design Automation Conference (DAC91) (ed. ACM, IEEE), 1991, 423–439.
Murata, H., Fujiyoshi, K., Nakatake, S. et al., VLSI module placement based on rectangle-packing by the sequence pair, in IEEE Trans. on Computer Aided Design, 1996, 15(15): 1518–1524.
Nakatake, S., Murata, H., Fujiyoshi, K. et al., Module placement on BSG-structure and IC layout application, in Proceedings of IEEE/ACM International Conference on Computer Aided Design (ICCAD96) (ed. ACM, IEEE), 1996, 484–490.
Hong, X. L., Huang, G., Cai, Y. C. et al., Corner block list: An effective and efficient topological representation of non-slicing floorplan, in Proceedings of IEEE/ACM International Conference on Computer-Aided Design (ICCAD2000) (ed. ACM, IEEE), 2000, 8–12.
Guo, P. N., Cheng, C. K., An O-tree representation of non-slicing floorplan and its applications, in Proceedings of 36th ACM/IEEE Design Automation Conference (DAC99) (ed. ACM, IEEE), 1999, 268–273.
Takahashi, T., An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem, IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, 1996, VLD96: 31–35.
Ma Yuchun, Hong Xianlong, Dong Sheqin et al., VLSI floorplanning with fixed topology, Microelectronics (in Chinese), 2000, 30: 22–24.
Young, F. Y., Wong, D. F., Yang, H. H., Slicing floorplans with preplaced modules, in Proc. IEEE Int. Conf. Computer-Aided Design, 1998, 252–258.
Murata Hiroshi, Fujiyoshi Kunihiro, Kaneko Mineo, VLSI/PCB placement with obstacles based on sequence pair, in IEEE Trans. on Computer Aided Design, 1998, 17(1): 60–67.
Young, F. Y., Wong, D. F., Slicing floorplans with range constraint, in Proc. Intl. Symp. on Physical Design (ISPD99) (ed. IEEE), 1999, 97–102.
Young, F. Y., Wong, D. F., Yang, H. H., Slicing floorplans with boundary constraints, in IEEE Trans. on Computer Aided Design, 1999, 18(9): 1385–1389.
Kang, M., Dai, W. M., General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure, in Proceedings of IEEE Asia and South Pacific Design Automation Conference (ASP-DAC97) (ed. IEEE), 1997, 265–270.
Huang, G., Hong, X. L., Qiao, C. G. et al., A timing driven block placer based on sequence pair model, in Proceedings of IEEE Asia and South Pacific Design Automation Conference (ASP-DAC99) (ed. IEEE), 1999, 249–252.
Nagao, A., Shirakawa, I., Kambe, T., A layout approach to monolithic microwave, IEEE Trans. on Computer Aided Design, 1996, 17(12): 1262–1272.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hong, X., Ma, Y., Dong, S. et al. Corner block list representation and its application with boundary constraints. Sci China Ser F 47, 1–19 (2004). https://doi.org/10.1360/01yf0558
Received:
Issue Date:
DOI: https://doi.org/10.1360/01yf0558