Aliasing in a linear FSM used as a multiple-input signature analyzer under uniform and nonuniform error models
Sandeep Bhatia, Alexander Albicki, N.K. Jha · 2003
A simple model for computing the aliasing probability for any linear finite state machine (LFSM) used as a multiple-input signature analyzer (MISA) is presented. It is shown that the whole class of cyclic LFSMs has transient and steady-state aliasing probabilities under the uniform error model that are identical to those of any LFSR when it is used as an MISA. Some other functional circuits, such as accumulators, can also be used for data compression with similar performance to that of any LFSR. The steady-state aliasing probability is also derived for an LFSM used as an MISA under arbitrary error models.>