The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
Abstract
In some signal processing applications, it is desirable to build very high performance fast Fourier transform (FFT) processors. To meet the performance requirements, these processors are typically highly pipelined. Until the advent of VLSI, it was not possible to build a single chip which could be used to construct pipeline FFT processors of a reasonable size. However, VLSI implementations have constraints which differ from those of discrete implementations, requiring another look at some of the typical FFT'algorithms in the light of these constraints.
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
The CORDIC Trigonometric Computing Technique
Volder, J. E. (1959) · IRE Transactions on Electronic Computers · doi:10.1109/tec.1959.5222693 · Cited by 2,647
A unified algorithm for elementary functions
Walther, J. S. (1971) · Proceedings of the May 18-20, 1971, spring joint computer conference on - AFIPS '71 (Spring) · doi:10.1145/1478786.1478840 · Cited by 1,036
On computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613
Fast Fourier Transforms: for fun and profit
Gentleman, W. M., & Sande, G. (1966) · Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall) · doi:10.1145/1464291.1464352 · Cited by 542
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
Discrete Fourier transforms when the number of data samples is prime
Rader, C. M. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6477 · Cited by 535
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
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
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
Cited by
A new approach to pipeline FFT processor
He, S., & Torkelson, M. (2002) · Proceedings of International Conference on Parallel Processing · doi:10.1109/ipps.1996.508145 · Cited by 370
Metadata
- Authors
- Wold, & Despain
- Venue
- IEEE Transactions on Computers
- Published
- 1984-05
- Volume
- C-33
- Issue
- 5
- Pages
- 414-426
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W1900969659
- Cited by
- 299
- References
- 19
- FWCI
- 7.05
- 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: Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations. https://app.cochat.ai/papers/10.1109/tc.1984.1676458
- The paper
- Wold, & Despain. (1984). Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1984.1676458
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.