Issue No. 06 - June (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.90257
<p>The authors present a test algorithm for finite state machines called branch testing. Based on branch testing, a design-for-test (DFT) method is proposed. Comparisons to other DFT methods show the method to be competitive relative to circuit overhead. A minimum set of paths containing all primary and internal gate-level input/output lines is found. Each of these paths is then sensitized so as to detect all single stuck-at faults. The authors demonstrated that the one-hot encoded FSMs can be easily and thoroughly tested via a simple algorithm. It is demonstrated that the use of scan paths is not necessary if a one-hot encoded state assignment is made. The synthesis and simulation resulting have shown that the package of one-hot encoding and branch testing constitutes a viable design and test approach.</p>
branch testing; test algorithm; finite state machines; design-for-test; gate-level input/output lines; stuck-at faults; scan paths; simulation; automatic testing; fault location; logic testing.
R.-Z. Makki, C. Tianshang, S. Bou-Ghazale, "Automatic Test Pattern Generation with Branch Testing", IEEE Transactions on Computers, vol. 40, no. , pp. 785-791, June 1991, doi:10.1109/12.90257