The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
New algorithms for digital convolution
Abstract
It is shown how the Chinese Remainder Theorem (CRT) can be used to convert a one-dimensional cyclic convolution to a multi-dimensional convolution which is cyclic in all dimensions. Then, special algorithms are developed which, compute the relatively short convolutions in each of the dimensions. The original suggestion for this procedure was made in order to extend the lengths of the convolutions which one can compute with number-theoretic transforms. However, it is shown that the method can be more efficient, for some data sequence lengths, than the fast Fourier transform (FFT) algorithm. Some of the short convolutions are computed by methods in an earlier paper by Agarwal and Burrus. Recent work of Winograd, consisting of theorems giving the minimum possible numbers of multiplications and methods for achieving them, are applied to these short convolutions.
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
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
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 Interaction Algorithm and Practical Fourier Analysis
Good, I. J. (1958) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1958.tb00300.x · Cited by 509
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
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-citationNumber theoretic transforms to implement fast digital convolution
Agarwal, R. C., & Burrus, C. S. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9791 · Cited by 269
Self-citationCooley, J. W., Lewis, P. A. W., & Welch, P. D. (1970) · Journal of Sound and Vibration · doi:10.1016/0022-460x(70)90075-1 · Cited by 252
Self-citationHistorical notes on the fast Fourier transform
Cooley, J., Lewis, P., & Welch, P. (1967) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1967.1161903 · Cited by 201
Self-citationThe use of finite fields to compute convolutions
Reed, I., & Truong, T.-K. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055352 · Cited by 168
Some bilinear forms whose multiplicative complexity depends on the field of constants
Winograd, S. (1976) · Mathematical Systems Theory · doi:10.1007/bf01683270 · Cited by 165
Cited by
The Fractional Fourier Transform and Applications
Bailey, D. H., & Swarztrauber, P. N. (1991) · SIAM Review · doi:10.1137/1033097 · Cited by 333
A prime factor FFT algorithm using high-speed convolution
Kolba, D., & Parks, T. (1977) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1977.1162973 · Cited by 308
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
Wold, & Despain (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676458 · Cited by 299
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Numerical Fourier and Bessel transforms in logarithmic variables
Talman, J. D. (1978) · Journal of Computational Physics · doi:10.1016/0021-9991(78)90107-9 · Cited by 274
Metadata
- Authors
- Agarwal, R., & Cooley, J.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1977-10
- Volume
- 25
- Issue
- 5
- Pages
- 392-410
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2142603808
- Cited by
- 253
- References
- 14
- FWCI
- 15.01
- 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: New algorithms for digital convolution. https://app.cochat.ai/papers/10.1109/tassp.1977.1162981
- The paper
- Agarwal, R., & Cooley, J. (1977). New algorithms for digital convolution. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1977.1162981
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.