Zero aliasing compression
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 254-263
- https://doi.org/10.1109/ftcs.1990.89373
Abstract
A compression technique, called periodic quotient compression, which eliminates the problem of aliasing is presented. The compression in signature analysis is based on polynomial division, where the remainder is the signature and the quotient is discarded. With this technique one looks at both the remainder and the quotient and assumes that the good circuit response is known a-priory during the design of the linear feedback shift register (LFSR). The concept of periodic polynomials is used to completely characterize the quotient, thus eliminating aliasing. The maximum number of bits required to compress an N-b response to achieve zero aliasing is determined. The authors provide an algorithm for constructing an LFSR to achieve this bound for any given circuit under test.Keywords
This publication has 7 references indexed in Scilit:
- Aliasing probability for multiple input signature analyzerIEEE Transactions on Computers, 1990
- Simultaneous signature and syndrome compressionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Aliasing Errors in Signature in Analysis RegistersIEEE Design & Test of Computers, 1987
- A Unified View of Test Compression MethodsIEEE Transactions on Computers, 1987
- Accumulator Compression TestingIEEE Transactions on Computers, 1986
- Syndrome-Testability Can be Achieved by Circuit ModificationIEEE Transactions on Computers, 1981
- Measures of the Effectiveness of Fault Signature AnalysisIEEE Transactions on Computers, 1980