检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学射频与光电集成电路研究所,南京210096
出 处:《东南大学学报(自然科学版)》2012年第2期239-243,共5页Journal of Southeast University:Natural Science Edition
基 金:国家高技术研究发展计划(863计划)资助项目(2009AA11Z219)
摘 要:分析了扫描测试过程中功耗产生的原因,研究了扫描触发器跳变对内部组合逻辑锥的影响,并对其进行建模,将计算得到的影响函数值作为扫描链重排序的依据.然后,基于扫描链结构的特殊性,分析了布线约束对扫描链重新排序的影响,并将布线约束简化,提出了一种同时兼顾低功耗和布线约束的算法.该算法不需要迭代,通过一次运行即可得到扫描链重排序的结果,在保证后端设计可行性的前提下,尽可能减少了高影响值扫描单元上的跳变次数,实现了对扫描测试功耗的优化.基于电路测试算例以及ISCAS89基准电路集中的电路s298和s5378,进行了仿真实验,结果表明:所提算法可以使扫描测试功耗降低12%,对故障覆盖率以及测试时间没有任何影响,而且不需要任何硬件开销,可应用于芯片的量产测试.The causes of the power consumption during the scan test are analyzed. The effects of the scan flip-top's transitions on the internal combinational logic cone are studied and modeled. The cal- culated values of the influence function are used as the basis for the scan chain reordering. Then, the effects of the routing constraints on the scan chain reordering are analyzed based on the special scan chain structure. With the simplification of the routing constraints, an algorithm taking both low pow- er consumption and routing constraints into account is presented. This algorithm can get rid of itera- tions and obtain the result of the scan chain reordering by a single run. The transition times of the scan cells can be reduced with the high impact value under the premise of the feasible back-end de- sign, improving the scan test power consumption. The simulation experiments are performed on the test case and the circuits s298 and s5378 in the ISCAS89 benchmark circuits. The results show that this algorithm can reduce the scan test power by 12% without any effect on fault coverage and test time. Moreover, it does not require any hardware overhead and can be used for silicon production test.
分 类 号:TN407[电子电信—微电子学与固体电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229