Improved test generation for high-activity circuits

An implementation of a test-pattern generator based on the Podem (path-oriented decision-making) algorithm is proposed. Podem uses a depth-first search from the fault location to assign primary input values. The result of these assignments at internal nodes is then determined by logic simulation (implication). Podem must compute primary input combinations that both excite the fault and propagate it to primary outputs. The algorithm can be improved for high-activity circuits by packing more than one signal value into a word during implication. Packing introduces parallelism into the implication part of test generation and can be used to examine both the normal assignment and the alternative assignment to an input variable in parallel. With parallelism, the input space can be searched faster. To assess the benefits of such a scheme, compiled-code and event-driven version of the 'imply' function in Podem were implemented with and without the parallelism offered by value packing. Results show that conventional Podem with event-driven implication performs better for low-activity circuits, whereas Podem with compiled code and packed signal values performs better for high-activity circuits.<<ETX>>

[1]  Barry K. Rosen,et al.  HSS--A High-Speed Simulator , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  J. Paul Roth,et al.  Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits , 1967, IEEE Trans. Electron. Comput..

[3]  Hideo Fujiwara,et al.  On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.

[4]  Amtliches Mitteilungsblatt,et al.  August , 1890, The Hospital.

[5]  John J. Zasio,et al.  SSIM: A Software Levelized Compiled-Code Simulator , 1987, 24th ACM/IEEE Design Automation Conference.

[6]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[7]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[8]  James E. Smith,et al.  Dynamic instruction scheduling and the Astronautics ZS-1 , 1989, Computer.