Aliasing probability transients |
| |
Authors: | John P Robinson |
| |
Affiliation: | (1) Electrical & Computer Engineering, University of Iowa, 52242 Iowa City, Iowa, USA |
| |
Abstract: | Test data reduction for digital systems is often accomplished through the use of a feedback shift register. This method, known as signature analysis, can exhibit error masking or aliasing. Recent analysis has shown that the use of a primitive polynomial for the register feedback can reduce the probability of aliasing. In this work we demonstrate that not all primitive polynomials are created equal. Some primitive polynomials can have very large transients in their aliasing probability. For example, 1 +X
13 +X
33 can exhibit an aliasing probability more than a million times larger than its asymptotic value of 2–33. An evaluation procedure is presented which can identify polynomials with good transient characteristics. Some recommended feedback polynomials are given. |
| |
Keywords: | Aliasing probability aliasing transients data compaction primitive polynomials signature analysis |
本文献已被 SpringerLink 等数据库收录! |
|