By Topic

Easily Testable Iterative Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Friedman, Arthur D. ; Department of Electrical Engineering and Computer Science, University of Southern California

It has been shown that the number of tests required to detect all faults in a one-dimensional unilateral combinational iterative array consisting of p cells will, in general, be proportional to p. In this paper we consider properties of such systems that enable them to be tested with a fixed constant number of tests independent of p, the number of cells in the system. Such systems are referred to as C-testable. Necessary and sufficient conditions on the basic cell state table are derived for an iterative system to be C-testable. It is shown that an arbitrary N-state cell table can be augmented by the addition of, at most, one row and less than [log2 N]2 columns (for N ≥ 2) so as to be C-testable.

Published in:

Computers, IEEE Transactions on  (Volume:C-22 ,  Issue: 12 )