Tree-structured LFSR synthesis scheme for pseudo-exhaustive testing of VLSI circuits

A new test architecture, called TLS (tree-LFSR/SR), generates pseudo-exhaustive test patterns for both combinational and sequential VLSI circuit is presented. Instead of using a single scan chain, the proposed test architecture routes a scan tree driven by the LFSR to generate all possible input patterns for each output cone. The new test architecture is able to take advantages of both signal sharing and signal reuse. The benefits are: the difficulty of test architecture synthesis can be eased by accelerating the searching process of appropriate residues; and the number of XOR gates to satisfy the pseudo-exhaustive test criterion can be reduced. The TLS test scheme mainly contains three phases: backbone generation, tree growing, and XOR-tree generation. Experimental results obtained by simulating combinational and sequential benchmark circuits are very encouraging.

[1]  Chien-In Henry Chen,et al.  Automated synthesis of pseudo-exhaustive test generator in VLSI BIST design , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Melvin A. Breuer,et al.  Novel test pattern generators for pseudo-exhaustive testing , 1993, Proceedings of IEEE International Test Conference - (ITC).

[3]  Fillia Makedon,et al.  A method for pseudo-exhaustive test pattern generation , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  M. W. Roberts,et al.  An algorithm for the partitioning of logic circuits , 1984 .