Linear Dependencies in Linear Feedback Shift Registers

Linear feedback shift registers have been proposed to generate test patterns for the self-test of logic networks. The probability of linear dependence among k bit positions of a subset of k bits in a maximum length shift register sequence is an outstanding problem. In this correspondence, we derive a formula for the calculation of the probability.

[1]  Thomas Williams,et al.  Test Length in a Self-Testing Environment , 1985, IEEE Design & Test of Computers.

[2]  Gary S. Ditlow,et al.  Random Pattern Testability , 1984, IEEE Transactions on Computers.

[3]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[4]  Donald T. Tang,et al.  Iterative Exhaustive Pattern Generation for Logic Testing , 1984, IBM J. Res. Dev..

[5]  Paul H. Bardell,et al.  Self-Testing of Multichip Logic Modules , 1982, International Test Conference.

[6]  Parker,et al.  Design for Testability—A Survey , 1982, IEEE Transactions on Computers.

[7]  Donald T. Tang,et al.  Logic Test Pattern Generation Using Linear Codes , 1984, IEEE Transactions on Computers.

[8]  Jacob Savir,et al.  On Random Pattern Test Length , 1984, IEEE Transactions on Computers.

[9]  F. MacWilliams,et al.  Pseudo-random sequences and arrays , 1976, Proceedings of the IEEE.

[10]  Eric Lindbloom,et al.  Random-Pattern Coverage Enhancement and Diagnosis for LSSD Logic Self-Test , 1983, IBM J. Res. Dev..