一种带时延约束的FPGA布局算法
PLACEMENT WITH TIME CONSTRAINTS FOR FPGA DESIGN
-
摘要: 基于SRAM编程结构的FPGA由于编程MOS管的导通电阻,与ASIC相比连线时延较大,为使电路能正常工作,很多情况下设计者必须对电路中某些路径的延迟作出限制.例如,对某些关键路径,要求时延小于某个值;或对一组路径,要求其中任意2条路径的时延差不能大于某个值.提出的一种能考虑这些时间约束条件的FPGA模拟退火布局算法--PTCP,用约束条件指导模拟退火的方向.为了提高实现约束条件的成功率和获得更优化的结果,在模拟退火过程中,不是按常规单向降低温度,而是在适当的时刻提高温度,反复退火.最后,给出了实例证明PTCP算法的有效性.Abstract: Because of the resistance of CMOS configerable switches,SRAM-based FPGA has long delay on the connecting lines between CLB(IOB) s.Usually designers have to make some constraints on the delay of some paths.For example,the difference of delays between any two of a group of paths or the delays of some critical paths must be less than some determined value.In this paper,a FPGA placement algorithm,which can consider time constraints,is proposed.Instead of treating time constraints as part of the cost function,they are used to orientate the direction of simulated annealing,with the cost function only considering performance and routibility.Our model for path delay estimation is a good trade-off between accuracy and algorithm complexity.
下载: