首页 | 本学科首页   官方微博 | 高级检索  
     


Efficient Path Selection for Delay Testing Based on Path Clustering
Authors:Seiichiro Tani  Mitsuo Teramoto  Tomoo Fukazawa  Kazuyoshi Matsuhiro
Affiliation:(1) NTT Network Innovation Laboratories, 1-1 Hikarinooka, Yokosuka City, Kanagawa, 239-0847, Japan
Abstract:In this paper, we introduce a way of modeling the differences between the calculated delays and the real delays, and propose an efficient path selection method for path delay testing based on the model. Path selection is done by judging which of two paths has the larger real delay by taking into account the ambiguity of calculated delay, caused by imprecise delay modeling as well as process disturbances. In order to make precise judgment under this ambiguity, the delays of only the unshared segments of the two paths are evaluated. This is because the shared segments are presumed to have the same real delays on both paths.The experiments used the delays of gates and interconnects, which were calculated from the layout data of ISCAS85 benchmark circuits using a real cell library. Experimental results show the method selects only about one percent of the paths selected by the most popular method.
Keywords:delay testing  path delay  delay fault  clustering
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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