Accession Number : ADA267559


Title :   Computing the Pipelined Phase-Rotation FFT


Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE


Personal Author(s) : Withers, Langhorn P , Jr ; Whelchel, John E ; O'Hallaron, David R ; Lieu, Peter J


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a267559.pdf


Report Date : 13 Jul 1993


Pagination or Media Count : 21


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.


Descriptors :   *ALGORITHMS , *APPLIED MATHEMATICS , INPUT , COMPUTATIONS , COMPUTERS , BANDWIDTH , MULTIPLICATION , BALANCES , ROTATION , PHASE , CONSTANTS , PIPELINES , FAST FOURIER TRANSFORMS


Subject Categories : Numerical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE