Skip Navigation

The Computer Journal 1987 30(3):258-267; doi:10.1093/comjnl/30.3.258
© 1987 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wey, C.-L.
Right arrow Articles by Lombardi, F.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On a Novel Self-test Approach to Digital Testing

C.-L. Wey1 * ¶ and F. Lombardi2 § {ddagger}

1 Department of Electrical Engineering, Michigan State University, East Lansing, MI 48824, USA, 2 Department of Electrical and Computer Engineering, University of Colorado, Campus Box 425 Boulder, CO 80309, USA

In this paper, a new approach to digital testing is presented. This is based on a dynamical modelling technique for the system under test (SUT). The proposed technique consists of an iterative self-test approach, that has been proved to be applicable to analogue fault analysis. A Discrete Component Connection Model (DCCM) is presented as a basis of modelling analysis. The DCCM describes a digital system by using a large-scale dynamic model for a reduction in computation. In this model, difference connection and component equations are simultaneously solved. Fault identification is accomplished by generating a pseudo-system partition of the SUT; a decision process is then executed to validate test results. The decision process is based on a novel Boolean technique for verification of results using a fault bound. This approach is applicable to testing of both sequential and combinatorial logic. Complexity of this testing technique is analysed; a reduction of complexity is accomplished by using covering set theory. Algorithms are presented for both the self-test and the decision processes.

The benefits of this approach are computational compatibility to existing complex simulation packages and lower order of complexity of the decision process for single and multiple fault detection and location. Illustrative examples are presented.


Received January 1986. revised April 1986.

* Supported in part by the Division of Engineering Research, Michigan State University, East Lansing, MI 48824.

§ To whom correspondence should be addressed. Supported in part by a grant from AT&T and by the Engineering Foundation's Research Initiation Grant.

Department of Electrical Engineering, Michigan State University, East Lansing, MI 48824, USA

{ddagger} Department of Electrical and Computer Engineering, University of Colorado, Campus Box 425 Boulder, CO 80309, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.