Hybrid algorithm for floorplanning using B*-tree representation

  • Authors:
  • Fubing Mao;Ning Xu;Yuchun Ma

  • Affiliations:
  • School of Computer Science and Technology, Wuhan University of Technology, Wuhan, P.R. China;School of Computer Science and Technology, Wuhan University of Technology, Wuhan, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China

  • Venue:
  • IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Floorplanning is an important step in the physical design of VLSI circuits. Since the variety of packing is uncountable, it is hard to be solved exactly in practical applications. The key issue is how to find the optimal solution in the finite solution space. In this paper, we proposed hybrid algorithm which based on B*-tree representation to improve the area utilization. The simulated annealing was embedded into tabu search for floorplanning. Experimental results show that our approach can improve the area utilization in shorter time. As we can see from the experimental results, we can improve area utilization and obtain the optimal results in a short runtime. It shows that the method we proposed is effective and efficient.