首页 | 官方网站   微博 | 高级检索  
     

一种新型的自动化FPGA互连测试算法
引用本文:孙磊,朱春,梁传增,王健,来金梅.一种新型的自动化FPGA互连测试算法[J].计算机工程,2013,39(2):250-253.
作者姓名:孙磊  朱春  梁传增  王健  来金梅
作者单位:复旦大学专用集成电路与系统国家重点实验室,上海,201203
基金项目:国家“863”计划基金资助项目(2012AA012001)
摘    要:针对FPGA结构中出现特殊互连资源的现状,提出一种基于改进型深度优先搜索的测试算法。该算法将所有可编程互连开关等价对待,互连资源以图的形式表示,给每条边设定权重并选择最小权重边连入测试线网,对互连资源进行遍历搜索,以测试互连资源开路和短路故障。实验结果表明,该算法能够覆盖FPGA结构中出现的特殊互连资源,具有高度自动化的特点。

关 键 词:深度优先搜索  现场可编程门阵列  互连测试  自动化  布线资源图  开关盒
收稿时间:2012-04-12
修稿时间:2012-05-22

A Novel Automated FPGA Interconnect Test Algorithm
SUN Lei , ZHU Chun , LIANG Chuan-zeng , WANG Jian , LAI Jin-mei.A Novel Automated FPGA Interconnect Test Algorithm[J].Computer Engineering,2013,39(2):250-253.
Authors:SUN Lei  ZHU Chun  LIANG Chuan-zeng  WANG Jian  LAI Jin-mei
Affiliation:(State Key Lab of ASIC & Systems, Fudan University, Shanghai 201203, China)
Abstract:Considering the fact that special interconnects begin to exist in new Field Programmable Gate Array(FPGA) architectures. This paper proposes an algorithm based on improved depth-first search. Each programmable interconnecting point is equally treated. After a graph representation of interconnects is got, a weight parameter for each edge is set and the edge with the minimum weight is picked to be part of a test net, thereby testing open faults and short faults of interconnects. Experimental results show that the proposed algorithm can be utilized to cover special interconnects of FPGA architectures and exhibits high automation.
Keywords:depth-first search  Field Programmable Gate Array(FPGA)  interconnect test  automation  wiring resource graph  Switch Matrix(SM)
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号