PROJECT TITLE :

Undetectable transition faults under broadside tests with constant primary input vectors

ABSTRACT:

In a broadside test, a scan-in operation is followed by two functional clock cycles where primary input vectors, denoted by v0 and v1, are applied. Because of tester limitations that prevent the primary input vectors from being changed at speed, broadside tests are computed under the constraint where v0=v1. This results in a loss of delay fault coverage. This study develops a fast procedure for identifying transition faults that are undetectable by broadside tests under the constraint v0=v1. Faults that are undetectable because of this constraint are undetectable because of tester limitations and not because of the logic in the circuit. These faults may be able to affect the circuit during functional operation, when the primary input vectors are unconstrained. In this case the faults are important to detect. A fast procedure for identifying undetectable transition faults under the constraint v0=v1 provides a quantitative measure of the effect of this constraint on the achievable fault coverage without performing test generation. If it turns out that the effect on fault coverage is unacceptable, other solutions may be used without first performing test generation.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here


PROJECT TITLE : PSR A Lightweight Proactive Source Routing Protocol For Mobile Ad Hoc Networks - 2014 ABSTRACT: Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networking,
PROJECT TITLE : Multi-Core Embedded Wireless Sensor Networks Architecture and Applications - 2014 ABSTRACT: Technological advancements in the silicon industry, as predicted by Moore's law, have enabled integration of billions
PROJECT TITLE : Joint Routing and Resource Allocation for Delay Minimization in Cognitive Radio Based Mesh Networks - 2014 ABSTRACT: This paper studies the joint design of routing and resource allocation algorithms in cognitive
PROJECT TITLE :Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks - 2013ABSTRACT:In this paper, we introduce the notion of sufficient set and necessary set for distributed processing of probabilistic
PROJECT TITLE : A General Framework of Multipopulation Methods With Clustering in Undetectable Dynamic Environments ABSTRACT : To solve dynamic optimization issues, multiple population ways are used to reinforce the population

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry