Abstract: We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation.The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results.Based on the critical path and the accumulated slack distances we define,we choose the best position for insertion and do a series of operations incrementally,such as deleting modules,adding modules,and resizing modules quickly.This incremental floorplanning algorithm has a very high speed less than 1μm,which is one of the most important measures in this research.The algorithm preserves the original good performances on area and wire length.It can also supply other tools with good physical estimates for area,wire length,and other performance guidelines.

Key words: incremental floorplanning, corner block list, adjacency graph, balance node