推荐星级:
  • 1
  • 2
  • 3
  • 4
  • 5

一种基于遗传算法的SPI后端布局设计算法研究与实现

更新时间:2020-05-13 11:52:36 大小:1M 上传用户:songhuahua查看TA发布的资源 标签:遗传算法 下载积分:3分 评价赚积分 (如何评价?) 打赏 收藏 评论(0) 举报

资料介绍

标准单元的布局设计前承布图规划与电路划分,后接时钟树综合与布线设计,是大规模数字集成电路后端设计环节中十分重要的步骤,而布局算法又是该实现环节的核心.提出一种基于整数排列编码的遗传布局算法.该算法基于基本遗传算法,采用整数编码的方式将各标准单元唯一编号,使用改进的交叉与变异算子实现遗传进化.最后基于标准单元库和一个已综合的SPI网表,完成该算法的布局设计验证.

After the floor-plan and circuit partition,the placement of standard cells is one of the most important procedures in the backend design of very large scale integrated circuits,which is followed by clock tree synthesis and routing. And the placement algorithm is the key of this process. This paper proposes an algorithm which is based on the genetic algorithm using the permutation of integer coding,which means that every single standard cell is numbered as a unique integer. The improved crossover and mutation operators are used in this algorithm to realize the evolution of generations. The verification of this placement algorithm is done on a synthesized Verilog netlist based on a library of standard cells at last.

部分文件列表

文件名 大小
一种基于遗传算法的SPI后端布局设计算法研究与实现.pdf 1M

【关注B站账户领20积分】

全部评论(0)

暂无评论

上传资源 上传优质资源有赏金

  • 打赏
  • 30日榜单

推荐下载