By Topic

Recursion and Testing of Combinational Circuits

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

2 Author(s)
Turcat, C. ; ENSIMAG, University of Grenoble ; Verdillon, A.

This correspondence shows how recursion can be used to simplify testing of combinational circuits. Necessary and sufficient conditions for testing simple iterative arrays (one-dimensional) with a fixed number of tests (independent of the number of cells) are given. Multiple faults and diagnosis in such circuits are also studied. The extension of the concept of simple iteration to complex iteration that may realize more complex recursive functions, is defined. Examples of such complex iterative circuits are studied.

Published in:

Computers, IEEE Transactions on  (Volume:C-25 ,  Issue: 6 )