The Fast Fourier Transform (FFT) is a key computational workload for seismic imaging. Acceleration of this workload can significantly reduce the run-time of seismic imaging applications. In this abstract, we describe methods for accelerating single-precision, two-dimensional, complex-to-complex, FFT calculations using the Cell Broadband Engine (BE) processor™. In particular, we focus on the Prime Factor Algorithm (PFA) FFT because of its flexibility and efficiency in handling a variety of FFT sizes. Our results demonstrate 12x to 18x improvements over state-of-the-art solutions on dual-core, Intel Woodcrest and AMD Opteron processors.
By: Jizhu Lu; Acie Nobles; Michael Perrone
Published in: RC24244 in 2007
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .