芯片布局问题的求解算法研究  

Research on Solving Algorithm of Chip Layout Problem

作　　者：管瑶 GUAN Yao(Hubei Women's Cadre School,Wuhan Hubei 430000)

机构地区：[1]湖北省妇女干部学校,湖北武汉430000

出　　处：《数字技术与应用》2018年第9期98-98,100,共2页Digital Technology & Application

摘　　要：本文基于布局问题及其特点,提出了以先初始布局再改善布局的解决布局问题的基本思想。对于初始布局,提出了中心生长法和模拟拼图法两种算法。对于改善布局提出二类基于迭代改善的算法。Based on the layout problem and its characteristics,this paper puts forward the basic idea of solving the layout problem by improving the layout first.For the initial layout,two algorithms of central growth and simulation mosaic are proposed.Two improvements based on iterative algorithm are proposed for improving layout.

关 键 词：布图规划 中心生长法 模拟拼图法 

分 类 号：TN401[电子电信—微电子学与固体电子学]