The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Effects of finite register length in digital filtering and the fast Fourier transform
Abstract
When digital signal processing operations are implemented on a computer or with special-purpose hardware, errors and constraints due to finite word length are unavoidable. The main categories of finite register length effects are errors due to A/D conversion, errors due to roundoffs in the arithmetic, constraints on signal levels imposed by the need to prevent overflow, and quantization of system coefficients. The effects of finite register length on implementations of linear recursive difference equation digital filters, and the fast Fourier transform (FFT), are discussed in some detail. For these algorithms, the differing quantization effects of fixed point, floating point, and block floating point arithmetic are examined and compared. The paper is intended primarily as a tutorial review of a subject which has received considerable attention over the past few years. The groundwork is set through a discussion of the relationship between the binary representation of numbers and truncation or rounding, and a formulation of a statistical model for arithmetic roundoff. The analyses presented here are intended to illustrate techniques of working with particular models. Results of previous work are discussed and summarized when appropriate. Some examples are presented to indicate how the results developed for simple digital filters and the FFT can be applied to the analysis of more complicated systems which use these algorithms as building blocks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Bennett, W. R. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01340.x · Cited by 970
Gold, B., & Rader, C. M. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 940
Fast Fourier Transforms: for fun and profit
Gentleman, W. M., & Sande, G. (1966) · Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall) · doi:10.1145/1464291.1464352 · Cited by 542
Rounding Errors in Algebraic Processes
(1964) · Nature · doi:10.1038/202016a0 · Cited by 456
On the Interaction of Roundoff Noise and Dynamic Range in Digital Filters*
Jackson, L. B. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01763.x · Cited by 278
Statistical analysis of amplitude-quantized sampled-data systems
Widrow, B. C. (1961) · Transactions of the American Institute of Electrical Engineers Part II Applications and Industry · doi:10.1109/tai.1961.6371702 · Cited by 261
Digital filter design techniques in the frequency domain
Rader, C. M., & Gold, B. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.5434 · Cited by 215
Roundoff-noise analysis for fixed-point digital filters realized in cascade or parallel form
Jackson, L. (1970) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1970.1162084 · Cited by 200
A fixed-point fast Fourier transform error analysis
Welch, P. (1969) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1969.1162035 · Cited by 163
Error analysis of floating-point computation
Wilkinson, J. H. (1960) · Numerische Mathematik · doi:10.1007/bf01386233 · Cited by 133
The effect of quantization in sampled-feedback systems
Bertram, J. E. (1958) · Transactions of the American Institute of Electrical Engineers Part II Applications and Industry · doi:10.1109/tai.1958.6369028 · Cited by 103
Accumulation of Round-Off Error in Fast Fourier Transforms
Kaneko, T., & Liu, B. (1970) · Journal of the ACM · doi:10.1145/321607.321613 · Cited by 84
Some Practical Considerations in the Realization of Linear Digital Filters
(1969) · The MIT Press eBooks · doi:10.7551/mitpress/5222.003.0006 · Cited by 59
Analysis of digital and analog formant synthesizers
Gold, B., & Rabiner, L. R. (1968) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1968.1161954 · Cited by 42
Designing simple, effective digital filters
Tufts, D. W., Rorabacher, D., & Mosier, W. E. (1970) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1970.1162094 · Cited by 36
Cited by
Computing Fourier Transforms and Convolutions on the 2-Sphere
Driscoll, J. R., & Healy, D. M. (1994) · Advances in Applied Mathematics · doi:10.1006/aama.1994.1008 · Cited by 881
Statistical theory of quantization
Widrow, B., Kollar, I., & Liu, M.-C. (1996) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/19.492748 · Cited by 530
Interpolation Algorithms for Discrete Fourier Transforms of Weighted Signals
Grandke, T. (1983) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.1983.4315077 · Cited by 461
Digital signal processing for sonar
Knight, W. C., Pridham, R. G., & Kay, S. M. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12186 · Cited by 410
Fast Convolution using fermat number transforms with applications to digital filtering
Agarwal, R., & Burrus, C. (1974) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1974.1162555 · Cited by 295
Metadata
- Authors
- Oppenheim, A. V., & Weinstein, C. J.
- Venue
- Proceedings of the IEEE
- Published
- 1972
- Volume
- 60
- Issue
- 8
- Pages
- 957-976
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2170142399
- Cited by
- 305
- References
- 16
- FWCI
- 12.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.