摘要
本文以动态规划和网络流理论为基础,提出一种新的求解基于LUT结构的FPGA工艺映射算法,并证明了它能获得最小延时目标电路。
Based on the dynamic programming and the theorem of network flow, this paper presents a new technology mapping algorithm for delay optimization in LUT-based FPGA design in polynomial time. It is proved that the algorithm can minimize the delay in the target circuit. Its theoretical results are better.
出处
《软件学报》
EI
CSCD
北大核心
1996年第10期626-633,共8页
Journal of Software
基金
"8.5同构型多处理机系统结构"经费资助
关键词
CAD
FPGA
工艺映射
延时分析
算法
ICCAD, FPGA, technology mapping, timing analysis, algorithm.