This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Aliasing Errors in Signature in Analysis Registers
March/April 1987 (vol. 4 no. 2)
pp. 39-45
T.W. Williams, IBM Boulder
W. Daehn, Universitaet Hannover, FRG
M. Gruetzner, Universitaet Hannover, FRG
C.W. Starke, IBM Boeblingen, FRG
The authors discuss aliasing errors in signature analysis registers for self-testing networks and review analytical results.The results show that when p, the probability that an error will occur at a network output, is close to 1/2, there is a boundof the aliasing error. The analysis uses a graph to represent the probability of transition, the Markov process, and z-transformsto analyze the behavior of the signature analysis register. For very small p(p?0) and very large p(p?1), the aliasing errorsolution for primitive polynomials is a series of terms (1-?)n in magnitude (where n is the number of random patterns beingapplied to the network or the length of the network output sequence). As compared with nonprimitive polynomials, whose solutionis n(1-?)n or n2(1-?)n, in general primitive polynomials are much better with respect to aliasing. Simulation results areshown for aliasing errors for these polynomials, which give insight as to how aliasing occurs.
Citation:
T.W. Williams, W. Daehn, M. Gruetzner, C.W. Starke, "Aliasing Errors in Signature in Analysis Registers," IEEE Design & Test of Computers, vol. 4, no. 2, pp. 39-45, March-April 1987, doi:10.1109/MDT.1987.295105
Usage of this product signifies your acceptance of the Terms of Use.