基于核心生长-力矢量算法的门阵列布局  

A New Method for Gate Array Placement Based on Core Growth-Force Directed Algorithm

作　　者：解光军[1] 程心[1] 范海秋[1] 

机构地区：[1]合肥工业大学理学院,安徽合肥230009

出　　处：《微电子学与计算机》2008年第11期174-177,共4页Microelectronics & Computer

基　　金：安徽省优秀青年科技基金(06042086)

摘　　要：结合核心生长和力矢量算法的思想,构成核心生长-力矢量(CGFD)算法来实现门阵列模式布局.其中,先利用核心生长将核心单元安置在布局的中心位置,再分别以核心单元为中心,在它们周围放置与之联系紧密的次核心单元,依次类推以减少连线长度;同时运用力矢量法,计算单元之间的拉力,使所受合力最小,从而较大地改善布局结果.实验表明,此算法可行,且对于门阵列布局问题性能优越.A new method for gate array placement problem is presented.It is resulted from the combination of the core growth and the force directed algorithm,the core growth algorithm is served to install the core cells with some sub-core cells all around to reduce the length of interconnecting wire,the force directed algorithm computes the force among cells to adjust the optimization of placement.The experiment results show that this algorithm is feasible,and its performance is superior to those other former methods.

关 键 词：门阵列 布局 核心生长 力矢量 

分 类 号：TN702[电子电信—电路与系统]