Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.35
FFT is a widely used algorithm, of which parallelization is a very important topic. There were a lot of works for this field and many parallel algorithms were published in several decades. In this paper, an algorithm named Computation Oriented Parallel FFT (COPF) is proposed. COPF which dates from the classic parallel radix-2 FFT focuses on the butterfly structure in FFT and adopts a proper strategy in parallel phrase on distributed system. In the serial phrase, COPF takes FFTW3 to accelerate the serial process and extends the application.
Pengzhen Li, Weiqing Dong, "Computation Oriented Parallel FFT Algorithms on Distributed Computer", Parallel Architectures, Algorithms and Programming, International Symposium on, vol. 00, no. , pp. 369-373, 2010, doi:10.1109/PAAP.2010.35