The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Discrete Fourier transforms when the number of data samples is prime
Abstract
The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation. This can be recognized by rearranging the members of the sequence and the transform according to a rule involving a primitive root of N. This observation permits the discrete Fourier transform to be computed by means of a fast Fourier transform algorithm, with the associated increase in speed, even though N is prime.
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
What is the fast Fourier transform?
Cochran, W., Cooley, J., Favin, D., Helms, H., Kaenel, R., Lang, W., Maling, G., Nelson, D., Rader, C., & Welch, P. (1967) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1967.1161899 · Cited by 490
Self-citationHigh-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
Cited by
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
A guided tour of the fast Fourier transform
Bergland, G. D. (1969) · IEEE Spectrum · doi:10.1109/mspec.1969.5213896 · Cited by 673
Fully homomorphic SIMD operations
Smart, N. P., & Vercauteren, F. (2014) · Designs, Codes and Cryptography · doi:10.1007/s10623-012-9720-4 · Cited by 656
High-dimensional integration: The quasi-Monte Carlo way
Dick, J., Kuo, F. Y., & Sloan, I. H. (2013) · Acta Numerica · doi:10.1017/s0962492913000044 · Cited by 615
On computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613
Metadata
- Authors
- Rader, C. M.
- Venue
- Proceedings of the IEEE
- Published
- 1968
- Volume
- 56
- Issue
- 6
- Pages
- 1107-1108
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W1966904279
- Cited by
- 535
- References
- 2
- FWCI
- 2.89
- 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.