摘要： 分析基于静态随机访问内存的FPGA开关盒互连资源，提出一种自动生成且与应用无关的测试配置集算法，通过建立布线资源图，根据线网的走向动态设定各边的权重，利用改进的Kruskal算法，自动产生测试配置集。对于FPGA不同的互连结构，该算法对互连资源中的开路和短路故障的覆盖率能够达到100%，且具有测试配置个数少、运行速度快以及与具体硬件结构无关等优点。
关键词:
布线资源图,
Kruskal算法,
静态随机访问内存
Abstract: The interconnect resource for Field Programmable Gate Array(FPGA) based on Static Random Access Memory(SRAM) is analyzed. A test matched sets algorithm with automatic generation is presented, which has no relation to application. By constructing the routing resource graph, this algorithm assigns a dynamic weight of each edge by the direction of nets and runs the modified Kruskal algorithm to obtain the minimum numbers of test configurations. For different FPGA routing architectures, the cover rate to faults of stuck-open and stuck-closed reaches 100%, and has some characteristics such as few number of testing configurations, high operating speed and has no relation to hardware structure.
Key words:
routing resource graph,
Kruskal algorithm,
Static Random Access Memory(SRAM)
中图分类号:
代 莉;梁绍池;王伶俐. 基于布线资源图的FPGA互连测试算法[J]. 计算机工程, 2009, 35(14): 258-260.
DAI Li; LIANG Shao-chi; WANG Ling-li. FPGA Interconnect Test Algorithm Based on Routing Resource Graph[J]. Computer Engineering, 2009, 35(14): 258-260.