摘要
布局是VLSI物理设计阶段的关键步骤,用于确定模块在芯片上的位置,随着电路设计复杂度不断提高,高效的自动布局算法变得愈发重要。对布局问题进行了描述,总结了布局算法中常用的线长模型,分析了传统的3类布局算法及可布线性驱动的布局算法,并给出了布局算法的未来发展趋势。
Placement is a key step in VLSI physical design flow and it determines the positions of cir- cuit blocks. As the number of circuit elements and interconnections is still growing, automatic placement algorithms are in great need in the design flow. This paper first describes the placement problem. It then summarizes common wirelength models in placement algorithms, followed by analysis of three kinds of traditional pla.cement algorithms and routablity-driven placement algorithms. Last it pointes out the developing trends in the future.
出处
《信息工程大学学报》
2016年第5期597-604,共8页
Journal of Information Engineering University
基金
国家自然科学基金资助项目(61309020)
国家863计划资助项目(2014AA01A704)