The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1980 vol.29)
pp: 1020-1025
K.K. Saluja , Department of Electrical Engineering, University of Newcastle
ABSTRACT
It will be shown that a single-input n-definite machine realized by a universal modular tree, in which each module consists of AND-EXCLUSIVE-OR-DELAY (AND-EOR-DELAY) as a basic element, can be tested for single stuck-type-faults by tests of length 2n + 3 only. This is a marked improvement over the previous results for trees consisting of AND-OR-DELAYS, which are known to have test lengths of exponential growth.
INDEX TERMS
universal modular tree, Combination circuits, fault detection, sequential machines, single-feedback realization, test sequence
CITATION
K.K. Saluja, "Synchronous Sequential Machines: A Modular and Testable Design", IEEE Transactions on Computers, vol.29, no. 11, pp. 1020-1025, November 1980, doi:10.1109/TC.1980.1675499
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool