The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A new approach to pipeline FFT processor
Abstract
A new VLSI architecture for a real-time pipeline FFT processor is proposed. A hardware-oriented radix-2/sup 2/ algorithm is derived by integrating a twiddle factor decomposition technique in the divide-and-conquer approach. The radix-2/sup 2/ algorithm has the same multiplicative complexity as the radix-4 algorithm, but retains the butterfly structure of the radix-2 algorithm. The single-path delay-feedback architecture is used to exploit the spatial regularity in the signal flow graph of the algorithm. For length-N DFT computation, the hardware requirement of the proposed architecture is minimal on both dominant components: log/sub 4/N-1 complexity multipliers and N-1 complexity data memory. The validity and efficiency of the architecture have been verified by simulation in the hardware description language VHDL.
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
Theory and Application of Digital Signal Processing
Rabiner, L. R., Gold, B., & Yuen, C. K. (1978) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1978.4309918 · Cited by 2,797
Theory and application of digital signal processing
Trick, T. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162708 · Cited by 906
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
Wold, & Despain (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676458 · Cited by 299
Fourier Transform Computers Using CORDIC Iterations
Despain, A. M. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223800 · Cited by 264
A fast single-chip implementation of 8192 complex point FFT
Bidet, E., Castelain, D., Joanblanq, C., & Senn, P. (1995) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.364445 · Cited by 168
A radix 4 delay commutator for fast Fourier transform processor implementation
Swartzlander, E. E., Young, W. K. W., & Joseph, S. J. (1984) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1984.1052211 · Cited by 127
Very Fast Fourier Transform Algorithms Hardware for Implementation
Despain (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675363 · Cited by 116
Cited by
FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption
Van Beirendonck, M., D'Anvers, J.-P., Turan, F., & Verbauwhede, I. (2023) · Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3576915.3623159 · Cited by 38
Metadata
- Authors
- He, S., & Torkelson, M.
- Venue
- Proceedings of International Conference on Parallel Processing
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-23
- Pages
- 766-770
- ISSN
- 0190-3918 (ISSN-L)
- OpenAlex
- W1923763959
- Cited by
- 370
- References
- 7
- FWCI
- 7.55
- Type
- conference paper
- 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 new approach to pipeline FFT processor. https://app.cochat.ai/papers/10.1109/ipps.1996.508145
- The paper
- He, S., & Torkelson, M. (2002). A new approach to pipeline FFT processor. Proceedings of International Conference on Parallel Processing. https://doi.org/10.1109/ipps.1996.508145
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.