Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 308

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A prime factor FFT algorithm using high-speed convolution

Kolba, D., Parks, T.·1977·IEEE Transactions on Acoustics, Speech, and Signal Processing

Abstract

Two recently developed ideas, the conversion of a discrete Fourier transform (DFT) to convolution and the implementation of short convolutions with a minimum of multiplications, are combined to give efficient algorithms for long transforms. Three transform algorithms are compared in terms of the number of multiplications and additions. Timing for a prime factor fast Fourier transform (FFT) algorithm using high-speed convolution, which was programmed for an IBM 370 and an 8080 microprocessor, is 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tassp.1977.1162973

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 308

Metadata

Authors
Kolba, D., & Parks, T.
Venue
IEEE Transactions on Acoustics, Speech, and Signal Processing
Published
1977-08
Volume
25
Issue
4
Pages
281-294
ISSN
0096-3518 (ISSN-L)
OpenAlex
W1985765205
Cited by
308
References
1
FWCI
11.26
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 prime factor FFT algorithm using high-speed convolution. https://app.cochat.ai/papers/10.1109/tassp.1977.1162973
The paper
Kolba, D., & Parks, T. (1977). A prime factor FFT algorithm using high-speed convolution. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1977.1162973

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.