3D FFT on a Single FPGA
Department of Electrical and Computer Engineering, Boston University, Boston, MA
IEEE Symposium on Field Programmable Custom Computing Machines (FCCM 2014), 2014
@article{humphries2014fft,
title={3D FFT on a Single FPGA},
author={Humphries, Benjamin and Zhang, Hansen and Sheng, Jiayi and Landaverde, Raphael and Herbordt, Martin C.},
year={2014}
}
The 3D FFT is critical in many physical simulations and image processing applications. On FPGAs, however, the 3D FFT was thought to be inefficient relative to other methods such as convolution-based implementations of multigrid. We find the opposite: a simple design, operating at a conservative frequency, takes 4ms for 16^3, 21ms for 32^3, and 215ms for 64^3 single precision data points. The first two of these compare favorably with the 25ms and 29ms obtained running on a current Nvidia GPU. Some broader significance is that this is a critical piece in implementing a large scale FPGAbased MD engine: even a single FPGA is capable of keeping the FFT off of the critical path for a large fraction of possible MD simulations.
May 2, 2014 by hgpu
