The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Number theoretic transforms to implement fast digital convolution
Abstract
Transforms using number theoretic concepts are developed as a method for fast and error-free calculation of finite digital convolution. The transforms are defined on finite fields and rings of integers with arithmetic carried out modulo an integer and it is shown that under certain conditions this gives the same results as conventional digital convolution. Because of these characteristics they are ideally suited to digital computation by taking into account quantization of amplitude as well as time in their definition. When the modulus is chosen as a Fermat number a transform results that requires only on the order of N log N additions and word shifts but no multiplications. In addition to being efficient, they have no roundoff error and do not require storage of basis functions. There is a restriction on sequence length imposed by word length and a problem with overflow but methods for overcoming these are presented. Results of an implementation on an IBM 370/155 are presented and compared with the fast Fourier transform showing a substantial improvement in efficiency and accuracy. Variations on the basic number theoretic transforms are also presented.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
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
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Gold, B., & Rader, C. M. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 940
An algorithm for computing the mixed radix fast Fourier transform
Singleton, R. (1969) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1969.1162042 · Cited by 539
The fast Fourier transform in a finite field
Pollard, J. M. (1971) · Mathematics of Computation · doi:10.1090/s0025-5718-1971-0301966-0 · Cited by 467
High-speed convolution and correlation
Stockham, T. G. (1966) · Proceedings of the April 26-28, 1966, Spring joint computer conference on XX - AFIPS '66 (Spring) · doi:10.1145/1464182.1464209 · Cited by 319
Effects of finite register length in digital filtering and the fast Fourier transform
Oppenheim, A. V., & Weinstein, C. J. (1972) · Proceedings of the IEEE · doi:10.1109/proc.1972.8820 · Cited by 305
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
Self-citationOn 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
Cited by
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Metadata
- Authors
- Agarwal, R. C., & Burrus, C. S.
- Venue
- Proceedings of the IEEE
- Published
- 1975
- Volume
- 63
- Issue
- 4
- Pages
- 550-560
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2104943391
- Cited by
- 269
- References
- 16
- FWCI
- 22.90
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Number theoretic transforms to implement fast digital convolution. https://app.cochat.ai/papers/10.1109/proc.1975.9791
- The paper
- Agarwal, R. C., & Burrus, C. S. (1975). Number theoretic transforms to implement fast digital convolution. Proceedings of the IEEE. https://doi.org/10.1109/proc.1975.9791
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.