Are Primitive Polynomials Always Best in Signature Analysis?

Authors:
A. Ahmad;N. K. Nanda;K. Garg
Affiliations:
-;-;-
Venue:
IEEE Design & Test
Year:
1990

Citing 0
Cited 3

Investigating some special sequence lengths generated in an external exclusive-NOR type LFSR

Computers and Electrical Engineering
Selection of polynomials for cyclic redundancy check for the use of high speed embedded: an algorithmic procedure

WSEAS Transactions on Computers
Investigation of some quite interesting divisibility situations in a signature analyzer implementation

WSEAS Transactions on Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.