Reduced Hamming count and its aliasing probability

Hardware overhead reduction through counter selection is considered for the Hamming count compaction test. A method to choose the most effective syndrome and input variable counter pair is given. Both simulation and theoretical analysis illustrate that this method produces an optimal pairing. The aliasing probability of this two-counter test is developed and shown to reduce the exhaustive ones count aliasing probability by half an order.<<ETX>>

[1]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[2]  Edward McCluskey,et al.  Built-In Self-Test Techniques , 1985, IEEE Design & Test of Computers.

[3]  Stanley L. Hurst,et al.  Spectral techniques in digital logic , 1985 .

[4]  S. L. Hurst,et al.  Rademacher–Walsh spectral transform: a new tool for problems in adigital-network fault diagnosis? , 1978 .

[5]  Wen-Ben Jone,et al.  Hamming count-a compaction testing technique , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[6]  William C. Carter,et al.  Signature Testing with Guaranteed Bounds for Fault Coverage , 1982, ITC.

[7]  Jacob Savir,et al.  Syndrome-Testable Design of Combinational Circuits , 1980, IEEE Transactions on Computers.

[8]  Sharad C. Seth,et al.  An Analysis of the Use of Rademacher-Walsh Spectrum in Compact Testing , 1984, IEEE Trans. Computers.

[9]  Nirmal R. Saxena,et al.  Simultaneous signature and syndrome compression , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Jacob Savir,et al.  Built In Test for VLSI: Pseudorandom Techniques , 1987 .

[11]  Alfred K. Susskind,et al.  Testing by Verifying Walsh Coefficients , 1983, IEEE Transactions on Computers.