Conference proceeding
Zero aliasing compression
[1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium, pp.254-263
Fault-Tolerant Computing, 20 (Newcastle Upon Tyne, England, UK, 06/26/1990 - 06/28/1990)
1990
DOI: 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.< >
Details
- Title: Subtitle
- Zero aliasing compression
- Creators
- S.K Gupta - Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USAD.K Pradhan - Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USAS.M Reddy
- Resource Type
- Conference proceeding
- Publication Details
- [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium, pp.254-263
- Conference
- Fault-Tolerant Computing, 20 (Newcastle Upon Tyne, England, UK, 06/26/1990 - 06/28/1990)
- Publisher
- IEEE Comput. Soc. Press
- DOI
- 10.1109/FTCS.1990.89373
- ISSN
- 0731-3071
- eISSN
- 2375-124X
- Language
- English
- Date published
- 1990
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197912202771
Metrics
1 Record Views