The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A linear filtering approach to the computation of discrete Fourier transform
Abstract
It is shown in this paper that the discrete equivalent of a chirp filter is needed to implement the computation of the discrete Fourier transform (DFT) as a linear filtering process. We show further that the chirp filter should not be realized as a transversal filter in a wide range of cases; use instead of the conventional FFT permits the computation of the DFT in a time proportional toN \log_{2} Nfor anyN, Nbeing the number of points in the array that is transformed. Another proposed implementation of the chirp filter requires N to be a perfect square. The number of operations required for this algorithm is proportional toN^{3/2}.
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
Brigham, E. O., & Morrow, R. E. (1967) · IEEE Spectrum · doi:10.1109/mspec.1967.5217220 · Cited by 588
What is the fast Fourier transform?
Cochran, W. T., Cooley, J. W., Favin, D. L., Helms, H. D., Kaenel, R. A., Lang, W. W., Maling, G. C., Nelson, D. E., Rader, C. M., & Welch, P. D. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.5957 · Cited by 493
The Chirp z-Transform Algorithm and Its Application
Rabiner, L. R., Schafer, R. W., & Rader, C. M. (1969) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1969.tb04268.x · Cited by 344
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
What is Fast Fourier Transform?
Gasmi, A. (2022) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.13140/rg.2.2.28731.49444 · Cited by 172
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
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Fast approximate computations with Cauchy matrices and polynomials
Pan, V. (2017) · Mathematics of Computation · doi:10.1090/mcom/3204 · Cited by 21
“We refer the reader to [B68/70], [BP94, Problem 1.”
Result
Metadata
- Authors
- Bluestein, L.
- Venue
- IEEE Transactions on Audio and Electroacoustics
- Published
- 1970-12
- Volume
- 18
- Issue
- 4
- Pages
- 451-455
- ISSN
- 0018-9278 (ISSN-L)
- OpenAlex
- W2022028092
- Cited by
- 462
- References
- 6
- FWCI
- 1.61
- 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: A linear filtering approach to the computation of discrete Fourier transform. https://app.cochat.ai/papers/10.1109/tau.1970.1162132
- The paper
- Bluestein, L. (1970). A linear filtering approach to the computation of discrete Fourier transform. IEEE Transactions on Audio and Electroacoustics. https://doi.org/10.1109/tau.1970.1162132
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.
