A Genetic Algorithm for VLSI Floorplanning Using O-Tree Representation

Author(s):  
Maolin Tang ◽  
Alvin Sebastian

Floorplanning plays an important role within the physical design method of very large Scale Integrated (VLSI) chips. It’s a necessary design step to estimate the chip area before the optimized placement of digital blocks and their interconnections. Since VLSI floorplanning is an NP-hard problem, several improvement techniques were adopted to find optimal solution. In this paper, a hybrid algorithm which is genetic algorithm combined with music-inspired Harmony Search (HS) algorithm is employed for the fixed die outline constrained floorplanning, with the ultimate aim of reducing the full chip area. Initially, B*-tree is employed to come up with the first floorplan for the given rectangular hard modules and so Harmony Search algorithm is applied in any stages in genetic algorithm to get an optimum solution for the economical floorplan. The experimental results of the HGA algorithm are obtained for the MCNC benchmark circuits


1994 ◽  
Vol 4 (9) ◽  
pp. 1281-1285 ◽  
Author(s):  
P. Sutton ◽  
D. L. Hunter ◽  
N. Jan

Sign in / Sign up

Export Citation Format

Share Document