t-분포를 이용한 회로분할의 경계노드 탐색에 관한 연구

A Study on the Search for the Boundary node of Circuit Segmentation using t-Distribution

  • 이강현 (조선대학교 전자공학과) ;
  • 김용득 (아주대학교 전자공학과)
  • 발행 : 1990.09.01

초록

In this paper we propose the search algorithm of the boundary nodes that defined as the circuit segmentation when CUT is tested by pseudo-exhaustive testing. The algorithm treats the testability values of the nodes in CUT as the population composed of teh raw data, and after examines the level of significance a and then estimate the confidence interval of teh testability values. Thus One can easily searched the c9oundary nodes and PO of sub circuits. The proposed algorithm has been implemented under UNIX OS with C-language, applied to the combinational logic CUT. As a result, it is shown that the pseudo-exhaustive test patterns are least generated when \ulcornerhas 0.786. We confirmed that the rate of test pattern is 1.22%, compared with exhaustive test.

키워드