Improving the efficiency of error identification via signature analysis

  • Authors:
  • C. E. Stroud;T. R. Damarla

  • Affiliations:
  • -;-

  • Venue:
  • VTS '95 Proceedings of the 13th IEEE VLSI Test Symposium
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

Abstract: Efficient identification of all single bit errors in the input polynomial to signature analysis registers is achieved by using characteristic polynomial f(x)=f/sub a/(x)f/sub b/(x) where f/sub a/(x) and f/sub b/(x) have different degrees and are of the form f/sub n/(x)=x/sup n/+x/sup n-1/+1. The input polynomial must be of degree lcm(ord(f/sub a/(x)), ord(f/sub b/(x))), where lcm denotes the least common multiple. Diagnostic aliasing for multiple bit errors is reduced by using non-primitive polynomials for f/sub a/(x) and/or f/sub b/(x).