An efficient partitioning algorithm of combinational CMOS circuits

This paper presents an efficient algorithm to partition combinational CMOS circuits for pseudoexhaustive testing. We present the effect of the partitioning algorithm on critical paths. Our objective is to reduce the delay penalty of test cell insertion for pseudoexhaustive testing. Pseudoexhaustive testing of a combinational circuit involves applying all possible input patterns to test all of its individual cones. Our testing ensures detection of all nonredundant combinational faults. We have developed an optimization process that can be used to find the optimal size of primary input cone (N) and fanout (F) values, to be used for partitioning a given circuit. In our work, the designer can choose between the fewest number of partitioning points and the least delay in critical path. ISCAS´85 benchmark circuits have been successfully partitioned, and when our results are compared to other partitioning methods, our algorithm makes fewer partitions