Computation of Seeds for LFSR-Based Diagnostic Test Generation


This paper describes a procedure that computes seeds for linear-feedback shift register-based mostly diagnostic take a look at generation. A typical method 1st computes take a look at cubes, and then computes seeds that manufacture them by solving sets of linear equations. With this method, a seed may not exists for a given test cube. To address this issue, the procedure described during this paper produces seeds directly. Staring from a seed for fault detection, it modifies the seed such that the take a look at it produces can distinguish a pair of faults. The procedure is applied in 2 modes. The first mode does not require diagnostic check cubes. In this mode, the procedure tries to modify a seed for fault detection thus on lose the detection of 1 of the faults on one amongst the outputs where the faults are detected. The procedure so uses the concept of take a look at elimination that was used earlier for diagnostic take a look at generation. The second mode is guided by a diagnostic test cube for a fault try that should be distinguished. The procedure modifies a seed so as to reduce the distance between the check that the seed produces and also the test cube. Without the need to match all the specified values of the test cube, the procedure will manufacture a seed for distinguishing the combine of faults even when a seed for the given check cube does not exist. Experimental results are presented to demonstrate the effectiveness of the procedure.

Did you like this research project?

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

PROJECT TITLE :On the Use of Extrinsic Probabilities in the Computation of Non-Bayesian Cramér–Rao Bounds for Coded Linearly Modulated Signal - 2018ABSTRACT:This contribution considers the non-Bayesian Cramér-Rao bound (CRB)
PROJECT TITLE :Joint Optimization of Computation and Communication Power in Multi-User Massive MIMO Systems - 2018ABSTRACT:With the growing interest within the deployment of massive multiple-input-multiple-output (MIMO) systems
PROJECT TITLE :Computation Rate Maximization for Wireless Powered Mobile-Edge Computing With Binary Computation Offloading - 2018ABSTRACT:Finite battery lifetime and low computing capability of size-constrained wireless devices
PROJECT TITLE :Longest Increasing Subsequence Computation over Streaming Sequences - 2018ABSTRACT:In this Project, we tend to propose a information structure, a quadruple neighbor list (QN-list, for short), to support real time
PROJECT TITLE : On the Maximum Rate of Networked Computation in a Capacitated Network - 2017 ABSTRACT: We tend to are given a capacitated communication network and many infinite sequences of source knowledge each of which is

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

Project Enquiry