【24h】

A Floorplanning Algorithm For Block Placement In SoC Design

机译:SoC设计中用于块放置的布局规划算法

获取原文

摘要

With the dramatic increase in size and complexity of systems on chip (SoC),there might be as much as hundreds of macro blocks and millions of standard cells integrated into a single chip. To facilitate signal routing and P/G network construction,one approach is to place macros around the boundary of chip and the remainder is used for arrangement of standard cells. To deal with such kind of placement,we propose an algorithm based on simulated annealing using B*-tree. The proposed algorithm guarantees a feasible solution through perturbation of B*-tree and the experimental results prove it very efficient.
机译:随着片上系统(SoC)的大小和复杂性的急剧增加,单个芯片中可能集成了多达数百个宏块和数百万个标准单元。为了促进信号路由和P / G网络的构建,一种方法是将宏放置在芯片边界周围,其余部分用于布置标准单元。针对这种情况,我们提出了一种基于模拟退火的B *树算法。所提算法通过扰动B *-树保证了可行的解法,实验结果证明了该算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号