Computing the Pipelined Phase-Rotation FFT
Abstract
The phase-rotation FFT is a new form of the FFT that replaces data movement with multiplications by constant phasor multipliers. The result is an FFT that is simple to pipeline. This paper reports some fundamental new improvements to the original phase-rotation FFT design, provides a complete description of the algorithm directly in terms of the parallel pipeline, and describes a radix-2 implementation on the iWarp computer system that balances computation and communication to run at the full-bandwidth of the communications links, regardless of the input data set size.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 13, 1993
- Accession Number
- ADA267559
Entities
People
- David R. O'hallaron
- John E. Whelchel
- Langhorn P. Withers Jr.
- Peter J. Lieu
Organizations
- Carnegie Mellon University