Parallel Signature Analysis Design with Bounds on Aliasing

Authors:
Nirmal R. Saxena;Edward J. McCluskey
Affiliations:
Silicon Graphics;Stanford Univ., Stanford, CA
Venue:
IEEE Transactions on Computers
Year:
1997

Citing 8
Cited 6

Pseudorandom built-in self-test methodology and implementation for the IBM RISC System/6000 processor

IBM Journal of Research and Development
Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression

IEEE Transactions on Computers
Simple Bounds on Serial Signature Analysis Aliasing for Random Testing

IEEE Transactions on Computers - Special issue on fault-tolerant computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Refined Bounds on Signature Analysis Aliasing for Random Testing

Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
Aliasing and Diagnosis Probability in MISR and STUMPS Using a General Error Model

Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
The theory of signature testing for VLSI

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Correction to the Proof of Theorem 2 in "Parallel Signature Analysis Design with Bounds on Aliasing"

IEEE Transactions on Computers
Aliasing-Free Space and Time Compactions with Limited Overhead

ISQED '00 Proceedings of the 1st International Symposium on Quality of Electronic Design
Response compaction with any number of unknowns using a new LFSR architecture

Proceedings of the 42nd annual Design Automation Conference
Aliasing Probability Calculations for Arbitrary Compaction under Independently Selected Random Test Vectors

IEEE Transactions on Computers
A hybrid scheme for compacting test responses with unknown values

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A combinatorial approach to X-tolerant compaction circuits

IEEE Transactions on Information Theory

Quantified Score

Hi-index	15.05

Visualization

Abstract

This paper presents parallel signature design techniques that guarantee the aliasing probability to be less than 2/L, where L is the test length. Using y signature samples, a parallel signature analysis design is proposed that guarantees the aliasing probability to be less than (y/L)y/2. Inaccuracies and incompleteness in previously published bounds on the aliasing probability are discussed. Simple bounds on the aliasing probability are derived for parallel signature designs using primitive polynomials.