Efficient Path Selection for Delay Testing Based on Path Clustering

  • Authors:
  • Seiichiro Tani;Mitsuo Teramoto;Tomoo Fukazawa;Kazuyoshi Matsuhiro

  • Affiliations:
  • NTT Network Innovation Laboratories, 1-1 Hikarinooka, Yokosuka City, Kanagawa, 239-0847, Japan. tanizo@exa.onlab.ntt.co.jp;NTT Network Innovation Laboratories, 1-1 Hikarinooka, Yokosuka City, Kanagawa, 239-0847, Japan. tera@exa.onlab.ntt.co.jp;NTT Network Innovation Laboratories, 1-1 Hikarinooka, Yokosuka City, Kanagawa, 239-0847, Japan. fuka@exa.onlab.ntt.co.jp;NTT Network Innovation Laboratories, 1-1 Hikarinooka, Yokosuka City, Kanagawa, 239-0847, Japan. mat@exa.onlab.ntt.co.jp

  • Venue:
  • Journal of Electronic Testing: Theory and Applications
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce a way of modeling the differencesbetween the calculated delays and the real delays, and propose anefficient path selection method for path delay testing based on themodel. Path selection is done by judging which of two paths has thelarger real delay by taking into account the ambiguity of calculateddelay, caused by imprecise delay modeling as well as processdisturbances. In order to make precise judgment under this ambiguity,the delays of only the unshared segments of the two paths areevaluated. This is because the shared segments are presumed to havethe same real delays on both paths.The experiments used the delays of gates and interconnects, which werecalculated from the layout data of ISCAS85 benchmark circuits using areal cell library. Experimental results show the method selects only about one percent of the paths selected by the most popular method.