VLSI Floorplan Based on Less Flexibility First Principle and Linear Programming

This paper presents an efficient algorithm for fixed-outling floorplanning based on a quasi-human rectangle packing principle named as "Less Flexibility First" and linear programming. The proposed algorithm consists of a global floorplanning, whose main objective is to fulfill the floorplan in the fixed-outline, and a detailed floorplanning whose main objective is wire length optimization. In the global floorplanning, we use the "Less Flexibility First" principle to get a legal floorplan. And in the detailed floorplannig, we use a linear programming approach to optimize the wire length. In our approach, the floorplan is optimized by iterating these global and detailed floorplannings. Experimental results demonstrate that our method shows a great advantage in floorplan.