The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
FFT pruning
Abstract
There are basically four modifications of the N=2Mpoint FFT algorithm developed by Cooley and Tukey which give improved computational efficiency. One of these, FFT pruning, is quite useful for applications such as interpolation (in both the time and frequency domain), and least-squares approximation with trignometric polynomials. It is shown that for situations in which the relative number of zero-valued samples is quite large, significant time-saving can be obtained by pruning the FFT algorithm. The programming modifications are developed and shown to be nearly trivial. Several applications of the method for speech analysis are presented along with Fortran programs of the basic and pruned FFT algorithm. The technique described can also be applied effectively for evaluating a narrow region of the frequency domain by pruning a decimation-in-time algorithm.
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
Cited by
Spectrum analysis—A modern perspective
Kay, S. M., & Marple, S. L. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12184 · Cited by 3,146
Metadata
- Authors
- Markel, J.
- Venue
- IEEE Transactions on Audio and Electroacoustics
- Published
- 1971-12
- Volume
- 19
- Issue
- 4
- Pages
- 305-311
- ISSN
- 0018-9278 (ISSN-L)
- OpenAlex
- W2296520333
- Cited by
- 274
- References
- 1
- FWCI
- 4.31
- 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: FFT pruning. https://app.cochat.ai/papers/10.1109/tau.1971.1162205
- The paper
- Markel, J. (1971). FFT pruning. IEEE Transactions on Audio and Electroacoustics. https://doi.org/10.1109/tau.1971.1162205
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.
