Skip to main content
The design of a test response compactor called a Block Compactoris given. Block Compactors belong to a new class of compactorscalled Finite Memory Compactors. Different from spacecompactors, finite memory compactors contain memory... more
The design of a test response compactor called a Block Compactoris given. Block Compactors belong to a new class of compactorscalled Finite Memory Compactors. Different from spacecompactors, finite memory compactors contain memory elements.Also unlike time compactors, finite memory compactors havefinite impulse response. These properties give finite memorycompactors the ability to achieve higher compaction ratios thanspace compactors and still be able to tolerate unknown values intest responses. The proposed Block Compactors, as an instance offinite memory compactors generate a signature of response data inseveral scan cycles. Results presented on several industrial designsshow that Block Compactors provide better test quality and higherdata compaction than earlier works on test response compactors.
ABSTRACT
Research Interests:
Research Interests:
Research Interests:
Itc
Research Interests:
Itc
ABSTRACT
Research Interests:
Research Interests:
ABSTRACT
Research Interests:
ABSTRACT
Research Interests:
Research Interests:
VTS
ABSTRACT
Research Interests:
Research Interests:
Research Interests:
ABSTRACT
ABSTRACT
ABSTRACT
Research Interests:
Itc
ABSTRACT
Research Interests:
Research Interests:
ABSTRACT
Research Interests:
ABSTRACT
Research Interests:
ABSTRACT
ABSTRACT
ABSTRACT
ABSTRACT
ABSTRACT
Research Interests:
ABSTRACT
Research Interests:
Research Interests:
Research Interests:
Ats
ABSTRACT
Research Interests:
Research Interests:
ABSTRACT
Research Interests:
We consider a class of symmetric Hopfield Networks, with nonpositive synapses and zero thresholds and address a variety of design and analysis issues conected with Unidirectional Error Correcting Coding applications of this class. We show... more
We consider a class of symmetric Hopfield Networks, with nonpositive synapses and zero thresholds and address a variety of design and analysis issues conected with Unidirectional Error Correcting Coding applications of this class. We show that this class is naturally suited to work in a unidirectional error environment We give a necessary and sufficient condition for a set of vectors to be storable in a Nonpositive Network. We propose a simple word storage algorithm, which is amenable to on line implementation, and guarantees storage of all storage compatible words. We show that the storage algorithm creates a maximally fault tolerant network which is free from spurious stationary points, whenever that freedom is possible. We also give a word forgetting algorithm; a tight, deterministic bound on the storage capacity, and give conditions under which the network created by our storage scheme tolerates a given number of arbitrary physical faults.
Research Interests:
ABSTRACT
ABSTRACT
Research Interests:
Research Interests:
ABSTRACT
When multiple copies of the same functional unit are available in a design, fault detection can be achieved by comparing the output responses of two copies (or two identical circuits). This obviates the need for storing test responses or... more
When multiple copies of the same functional unit are available in a design, fault detection can be achieved by comparing the output responses of two copies (or two identical circuits). This obviates the need for storing test responses or for computing signatures of test responses. The paper proposes the testing of identical circuits using a deterministic test sequence by running
Research Interests:
Research Interests:
Research Interests:
ABSTRACT
ABSTRACT
ABSTRACT

And 541 more