**1** Publications

- Page
**1**of**1**

Proc IEEE Int Symp Field Program Cust Comput Mach 2014 May;2014:68-71

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 multi-grid. We find the opposite: a simple design, operating at a conservative frequency, takes 4s for 16, 21s for 32, and 215s for 64 single precision data points. The first two of these compare favorably with the 25s and 29s obtained running on a current Nvidia GPU. Some broader significance is that this is a critical piece in implementing a large scale FPGA-based 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.

## Download full-text PDF |
Source |
---|---|

http://dx.doi.org/10.1109/FCCM.2014.28 | DOI Listing |

http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4652940 | PMC |

May 2014

-->