An Incremental Floorplanning Algorithm with Less Flexibility First Principles
To support incremental changes on the existing floorplan derived from some changes in the high level synthesis is becoming an increasingly important problem in order to cope with the complexity of the merging of VLSI design phases and the necessary of alternation between synthesis and physical design. In this paper, we present an incremental floorplanning algorithm with Less Flexibility First (LFF) Principles (LFF_IFP algorithm). LFF principle is a deterministic algorithm through humans accumulated experience. In this paper, the horizontal and vertical constraint graphs are built up based on the packing of the initial floorplanning result within linear time, and the accumulated slack distances among blocks are computed. The flexibility of blocks to be inserted to the initial floorplan (‘incremental block’ is also called here for short) is computed and every slack space belongs to the block in the initial floorplan also has different degree of flexibility for a given incremental block. The experimental results demonstrate that the algorithm is effective and promising in building block layout application.
Liu Yang Sheqin Dong Xianlong Hong
EDA Lab., Dept. of Computer Science & Technology, Tsinghua University, Beijing 100084, China
国际会议
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
广西桂林
英文
2464-2468
2006-06-25（万方平台首次上网日期，不代表论文的发表时间）