Simple Bounds on Serial Signature Analysis Aliasing for Random Testing

Authors:
Nirmal R. Saxena;Piero Franco;Edward J. McCluskey
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Year:
1992

Citing 4
Cited 7

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

IBM Journal of Research and Development
A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression

IEEE Transactions on Computers
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

HALSIM—a very fast SPARC V9 behavioral model

ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
Parallel Signature Analysis Design with Bounds on Aliasing

IEEE Transactions on Computers
A Unified Analytical Expression for Aliasing Error Probability Using Single-Input External- and Internal-XOR LFSR

IEEE Transactions on Computers
Aliasing Error for a Mask ROM Built-In Self-Test

IEEE Transactions on Computers
HALSIM - A Very Fast SPARC-V9 Behavioral Model

MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Aliasing Probability Calculations for Arbitrary Compaction under Independently Selected Random Test Vectors

IEEE Transactions on Computers
Trust-Based Design and Check of FPGA Circuits Using Two-Level Randomized ECC Structures

ACM Transactions on Reconfigurable Technology and Systems (TRETS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

It is shown that the aliasing probability is bounded above by (1+ epsilon )/L approximately=1/L ( epsilon small for large L) for test lengths L less than the period, L/sub c/, of the signature polynomial; for test lengths L that are multiples of L/sub c/, the aliasing probability is bounded above by 1; for test lengths L greater than L/sub c/ and not a multiple of L/sub c/, the aliasing probability is bounded above by 2/(L/sub c/+1). These simple bounds avoid any exponential complexity associated with the exact computation of the aliasing probability. Simple bounds also apply to signature analysis based on any linear finite state machine (including linear cellular automaton). From these simple bounds it follows that the aliasing probability in a signature analysis design using beta intermediate signatures is bounded by ((1+ epsilon )/sup beta / beta /sup beta /)/L/sup beta /, for beta L and L/ beta L/sub c/. By using intermediate signatures the aliasing probability can be substantially reduced.