The systolic phase rotation FFT-a new algorithm and parallel processor architecture
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1021-1024 vol.2
- https://doi.org/10.1109/icassp.1990.116067
Abstract
A new FFT algorithm and its implementation in a VLSI-based parallel processor are described. The innovation provided by the new algorithm is the high degree of localization of data shuffle storage locations between successive computational stages in a pipeline or recursive FFT. This allows the simultaneous transformation of R* log/sub R/(N) data channels in a recursive N-point FFT processor, where R is the radix of the transform. The pipeline processor has a constant geometry architecture. The throughput rate achievable with this pipeline architecture is R times the required processor and memory access rates. The new architecture eliminates the delay commutator switches which characterize the Purdy McClellan processor and replaces them with distributed random access memories and phase rotations at each stage to perform the data shuffling.Keywords
This publication has 3 references indexed in Scilit:
- Recent developments in parallel processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A radix 4 delay commutator for fast Fourier transform processor implementationIEEE Journal of Solid-State Circuits, 1984
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968