By Topic

Simple bounds on serial signature analysis aliasing for random testing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Saxena, N.R. ; Stanford Univ., CA, USA ; Franco, P. ; McCluskey, E.J.

It is shown that the aliasing probability is bounded above by (1+ε)/L≈1/L (ε small for large L ) for test lengths L less than the period, Lc, of the signature polynomial; for test lengths L that are multiples of Lc, the aliasing probability is bounded above by 1; for test lengths L greater than Lc and not a multiple of Lc, the aliasing probability is bounded above by 2/( Lc+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 β intermediate signatures is bounded by ((1+ε)βββ)/L β, for β<L and L/β<Lc. By using intermediate signatures the aliasing probability can be substantially reduced

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 5 )