This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Are Primitive Polynomials Always Best in Signature Analysis?
July/August 1990 (vol. 7 no. 4)
pp. 36-38

It is shown that in testing technique based on linear-feedback shift registers, the use of primitive polynomials in a signature-analysis register is not always better than using nonprimitive polynomials. The results show how some primitive polynomials may actually yield maximum aliasing errors. These results are based on the simulation of single stuck-at faults, but they also hold for certain multiple stuck-at faults. The best testing technique appears to be one that uses a binary counter in test-pattern generation with a primitive polynomial in signature analysis.

Citation:
A. Ahmad, N.K. Nanda, K. Garg, "Are Primitive Polynomials Always Best in Signature Analysis?," IEEE Design & Test of Computers, vol. 7, no. 4, pp. 36-38, July-Aug. 1990, doi:10.1109/54.57912
Usage of this product signifies your acceptance of the Terms of Use.