Abstract
The problem of detecting permanent faults in sequential circuits by random testing is analyzed utilizing a continuous parameter Markov model. Given a sequential circuit with certain stuck faults specified, the original state table and its error version can be readily derived from an analysis of the circuit under fault-free and faulty conditions, respectively. By simulation of these two tables on a computer, the parameters of the desired Markov model can be obtained. The approach does not require formulation of a product state table corresponding to the fault-free state table and its faulty version, which is rather difficult, when dealing with large circuits. For a specified confidence degree, it is easy to derive the parameters of the model and to calculate the required lengths of random test patterns or the maximum testing time. A complete mathematical analysis of the model is given. It provides insight into the nature of faults in relation to random testing and the associated confidence degree.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man, and Cybernetics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
