다층 레벨 조합논리 회로의 Net list를 이용한 Pseudo-exhaustive Test에 관한 연구

A Study on the Pseudo-exhaustive Test using a Netlist of Multi-level Combinational Logic Circuits

  • 이강현 (조선대학교 전자공학과) ;
  • 김진문 (조선대학교 전자공학과) ;
  • 김용덕 (아주대학교 전자공학과)
  • 발행 : 1993.05.01

초록

In this paper, we proposed the autonomous algorithm of pseudo-exhaustive testing for the multi-level combinational logic circuits. For the processing of shared-circuit that existed in each cone-circuit when it backtracked the path from PO to PI of CUT at the conventional verification testing, the dependent relation of PI-P0 is presented by a dependence matrix so it easily partitioned the sub-circuits for the pseudo-exhaustive testing. The test pattern of sub-circuit's C-inputs is generated using a binary counter and the test pattern of I-inputs is synthesized using a singular cover and consistency operation. Thus, according to the test patterns presented with the recipe cube, the number of test pattrens are reduced and it is possible to test concurrently each other subcircuits. The proposed algorithm treated CUT's net-list to the source file and was batch processed from the sub-circuit partitioning to the test pattern generation. It is shown that the range of reduced ration of generated pseudo-exhaustive test pattern exhibits from 85.4% to 95.8% when the average PI-dependency of ISACS bench mark circuits is 69.4%.

키워드