arrow
返回

Probabilistic optimization for FPGA board level routing problems

delete2006-04-01
delete3
delete
OA
AI
贺飞 封面图
贺飞 (Fei He) *
X
Xiaoyu Song
M
Ming Gu
G
Guowu Yang
W
William N. N. Hung
J
Jiaguang Sun
DOI:10.1109/TCSII.2005.859569delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Field programmable gate arrays (FPGAs) are an enabling technology in circuit designs. We consider the board-level multi-terminal net assignment in the FPGA-based logic emulation. A novel probabilistic optimization method is devised for solving the net assignment problem. The approach incorporates randomized rounding, genetic algorithm, and solution-improvement strategies. Experimental results demonstrate promising performance.
Keyword:
board-level routing
Chernoff bound
field programmable gate array (FPGA)
randomized rounding
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

I
IEEE Transactions on Circuits and Systems and Express Briefs
IF:
4.9
论文数:
8.8K
被引数:
2.5W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
没有更多内容