Realization of a Better Signature Analysis Scheme by Adding a Bit to the Size of 8k
Afaq Ahmad · 2013
Signature analyzers equipped with primitive characteristic polynomials are known to be effective in minimizing aliasing errors. However several parameters exist which contribute to the issue of aliasing errors. Some of these issues are nonexistence of primitive trinomials over GF(2) of length 8k (where, k is a positive integer), length of signature analyzer and use of primitive characteristic polynomials realized with higher number of taps and power dissipation. This paper is aimed to look into the alternative of using of 8k length signature analyzer. Through a simulation experiment it is demonstrated that the use of 8k+1 length signature analyzer will prove better than the use of a length of an 8k.