Abstract
Interval algebras are considered as media in which to simulate digital filters for the purpose of analyzing quantization effects due to finite wordlength. The techniques from the basis of a computer-aided analysis that is suitable for both fixed-point and floating-point arithmetic, as well as both recursive and nonrecursive filters of arbitrary order and configuration. Absolute interval analysis is discussed as well as a probabilistic interval algebra which serves to generate confidence intervals for situations in which an absolute bond is too pessimistic. The techniques are applied to a fourth order lowpass Butterworth filter in the direct, cascade, and parallel configurations.
| Original language | English (US) |
|---|---|
| Pages | 703-707 |
| Number of pages | 5 |
| State | Published - Jan 1 1974 |
| Event | IEEE Int Symp on Circuits and Syst, 7th, Proc - San Francisco, CA, USA Duration: Apr 22 1974 → Apr 25 1974 |
Other
| Other | IEEE Int Symp on Circuits and Syst, 7th, Proc |
|---|---|
| City | San Francisco, CA, USA |
| Period | 4/22/74 → 4/25/74 |
All Science Journal Classification (ASJC) codes
- General Engineering