TY - GEN
T1 - Mapping 1D-FFT on an energy efficient 3D FPGA-DRAM architecture
AU - Gadfort, Peter
AU - Dasu, Aravind
AU - Akoglu, Ali
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/11/24
Y1 - 2015/11/24
N2 - The one-dimensional Fast Fourier Transform (1D-FFT) is a fast method of computing the Discrete Fourier Transform (DFT) that is pervasive in signal processing applications. In this paper we present details on the mapping of the 1D-FFT on a power efficient 3D FPGA-DRAM architecture [1], with four data sizes: 256pt, 1024pt, 4096pt and 32768pt to achieve 29 GFLOPs/W with a 65nm technology.
AB - The one-dimensional Fast Fourier Transform (1D-FFT) is a fast method of computing the Discrete Fourier Transform (DFT) that is pervasive in signal processing applications. In this paper we present details on the mapping of the 1D-FFT on a power efficient 3D FPGA-DRAM architecture [1], with four data sizes: 256pt, 1024pt, 4096pt and 32768pt to achieve 29 GFLOPs/W with a 65nm technology.
KW - Adders
KW - Computer architecture
KW - Energy efficiency
KW - Field programmable gate arrays
KW - Ports (Computers)
KW - Random access memory
KW - Three-dimensional displays
UR - http://www.scopus.com/inward/record.url?scp=84962086081&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84962086081&partnerID=8YFLogxK
U2 - 10.1109/E3S.2015.7336816
DO - 10.1109/E3S.2015.7336816
M3 - Conference contribution
AN - SCOPUS:84962086081
T3 - 2015 4th Berkeley Symposium on Energy Efficient Electronic Systems, E3S 2015 - Proceedings
BT - 2015 4th Berkeley Symposium on Energy Efficient Electronic Systems, E3S 2015 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 4th Berkeley Symposium on Energy Efficient Electronic Systems, E3S 2015
Y2 - 1 October 2015 through 2 October 2015
ER -