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

动态可重构FPGA布局算法

更新时间:2020-07-29 13:22:30 大小:293K 上传用户:zhiyao6查看TA发布的资源 标签:fpga 下载积分:5分 评价赚积分 (如何评价?) 打赏 收藏 评论(0) 举报

资料介绍

SRAM( Static Random Access Memory )型FPGA凭借其动态结构调整的灵活性等特点,被广泛应用于工业领域。针对动态可重构功能单元的布局问题,分析了模拟退火解决方案的局限性,提出了基于电路分层划分和时延驱动的在线布局算法。算法首先按最小分割原则将电路划分为一定数目的层,然后按自顶向下的原则在芯片的每一层中布局划分出的层,同时保证电路关键路径的延时最小。实验结果表明,所述算法在时延、线长和运行时间方面均优于VPR算法。

Due to their flexibility in dynamic structural adjustment,Static Random Access Memory ( SRAM) based Field Programmable Gate Arrays ( FPGAs) are widely applied in industry and other fields .Aimed at the layout problem of modules on the reconfigurable functional unit,a hierarchical circuit partitioning-based timing-driven placement algorithm was proposed based on analysis to the limitation of the simulated annealing circuit was first divided into limited number of tiers based on principle of minimum cut,and then the layout of each tier was implemented according to top-down principle .The algorithm can also attain the minimum critical path delay .Experimental results show that:compared VPR algorithm,the p...

部分文件列表

文件名 大小
动态可重构FPGA布局算法.pdf 293K

全部评论(0)

暂无评论

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

  • 打赏
  • 30日榜单

推荐下载