Computing Seeds for LFSR-Based Test Generation From Non test Cubes - 2016 PROJECT TITLE : Computing Seeds for LFSR-Based Test Generation From Non test Cubes - 2016 ABSTRACT: In check knowledge compression methods that are primarily based on the utilization of a linear-feedback shift register (LFSR), a seed that produces a check for a target fault is computed based on a take a look at cube for the fault. With a given LFSR, a seed might not exist for a given check cube, even though a seed could exist for a totally different test cube that detects the identical fault. This issue is addressed during this temporary by computing seeds for LFSR-based take a look at generation while not using test cubes. Instead, the procedure described in this transient relies on the utilization of nontest cubes. A nontest cube for a fault must be avoided in any test or take a look at cube for the fault so as to permit the fault to be detected. Therefore, nontest cubes do not limit the flexibility of the procedure to compute seeds with a given LFSR. Experimental results demonstrate the benefits that the utilization of nontest cubes provides, and also the associated computational cost. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Fault Diagnosis Logic Testing Data Compression Automatic Test Pattern Generation Shift Registers Design for Testability of Sleep Convention Logic - 2016 A Normal I/O Order Radix-2 FFT Architecture to Process Twin Data Streams for MIMO - 2016
