Abstract
In this paper, a simulation system of pseudo-random testing is described first to investigate the characteristics of pseudo-random testing. Several interesting experimental results are obtained. It is found out that initial states of pseudo-random sequences have little effect on fault coverage. Fixed connection between LFSR outputs and circuit inputs in which the number of LFSR stagesm is less than the number of circuit inputsn leads to low fault coverage, and the fault coverage is reduced asm decreases. The local unrandomness of pseudo-random sequences is exposed clearly. Generally, when an LFSR is employed as a pseudo-random generator, there are at least as many LFSR stages as circuit inputs. However, for large circuits under test with hundreds of inputs, there are drawbacks of using an LFSF with hundreds of stages. In the paper, a new design for a pseudo-random pattern generator is proposed in whichm<n. The relationship between test length and the number of LFSR stages is discussed in order to obtain necessary fault coverage. It is shown that the design cannot only save LFSR hardware but also reduce test length without loss of fault coverage, and is easy to implement. The experimental results are provided for the 10 Benchmark Circuits to show the effectiveness of the generator.
Similar content being viewed by others
References
P. H. Bardellet al., Built-In Test for VLSI: Pseudorandom Techniques. Wiley Somerset, NJ, 1987.
E. J. McCluskey, Logic Design Principles: With Emphasis on Testable Semicustom Circuits. Englewood Cliffs, NJ: Prentice-Hall, 1986.
K. D. Wagneret al., Pseudo-random testing.IEEE Trans. Comput., 1987, C-36(3), 332–343.
Y. K. Malaiya and S. Yang, The coverage problem for random testing. Proc. IEEE Int'l Test Conf., Nov. 1984, 237–245.
J. A. Waicukauskiet al., Fault simulation for structured VLSI.VLSI Systems Design, 1985, 6(12), pp20.
C. K. Chin and E. J. McCluskey, Test length for pseudo-random testing.IEEE Trans. Comput., 1987, C-36(2), 252–256.
E. B. Eichelberger and E. Lindbloom, Random-pattern coverage enchancement and diagnosis for LSSD logic self-test.IBM J. Res. Develop., 1983, 27(3), 265–272.
J. Savir and P. H. Bardell, On random pattern test length.IEEE Trans. Comput., 1984, C-33(6), 467–474.
K. D. Wagneret al., Fault Coverage of Pseudo-Random Testing. Proc. Int'l Conf. on Computer Aided Design, Nov. 1986, 48–51.
E. J. McCluskeyet al., Probability models for pseudo-random test sequences.IEEE Trans. CAD, 1988, 7(1), 68–74.
J. Saviret al., Random pattern testability.IEEE Trans. Comput., 1984, C-33(1), 79–90.
T. Williams, Test length in a self-testing environment.IEEE Des. Test, Apr. 1985, 59–63.
F. Brglez and H. Fujiwara, A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran. Proc. IEEE Int. Symp. Circuits and Systems; (Special Session on ATPG and Fault Simulation), June 1985.
S. W. Goldomb, Shift Register Sequence. San Francisco, CA: Holden Day, 1967.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Li, Z., Min, Y. Pseudo-random test generation for large combinational circuits. J. of Comput. Sci. & Technol. 7, 19–28 (1992). https://doi.org/10.1007/BF02946162
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946162