Accelerating Discrete Fourier Transforms with dot-product engine

Discrete Fourier Transforms (DFT) are extremely useful in signal processing. Usually they are computed with the Fast Fourier Transform (FFT) method as it reduces the computing complexity from O(N2) to O(Nlog(N)). However, FFT is still not powerful enough for many real-time tasks which have stringent requirements on throughput, energy efficiency and cost, such as Internet of Things (IoT). In this paper, we present a solution of computing DFT using the dot-product engine (DPE) - a one transistor one memristor (1T1M) crossbar array with hybrid peripheral circuit support. With this solution, the computing complexity is further reduced to a constant O(λ) independent of the input data size, where λ is the timing ratio of one DPE operation comparing to one real multiplication operation in digital systems.

[1]  Martin Cadík,et al.  FFT and Convolution Performance in Image Filtering on GPU , 2006, Tenth International Conference on Information Visualisation (IV'06).

[2]  Miao Hu,et al.  ISAAC: A Convolutional Neural Network Accelerator with In-Situ Analog Arithmetic in Crossbars , 2016, 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA).

[3]  Andrew B. Watson,et al.  Image Compression Using the Discrete Cosine Transform , 1994 .

[4]  E. Sujatha,et al.  A Review on Optimized FFT/IFFT Architectures for OFDM Systems , 2015 .

[5]  Catherine Graves,et al.  Dot-product engine for neuromorphic computing: Programming 1T1M crossbar to accelerate matrix-vector multiplication , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[6]  Andreas Gerstlauer,et al.  Transforming a linear algebra core to an FFT accelerator , 2013, 2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors.

[7]  B. Hayes.  The American Scientist , 1962, Nature.

[8]  Pang Hao.  AN IMPROVED ALGORITHM FOR HARMONIC ANALYSIS OF POWER SYSTEM USING FFT TECHNIQUE , 2003 .

[9]  David Svoboda,et al.  Algorithms for Efficient Computation of Convolution , 2013 .

[10]  C. Loan.  Computational Frameworks for the Fast Fourier Transform , 1992 .

[11]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[12]  Martin Greiner,et al.  Wavelets , 2018, Complex..

[13]  Qing Wu,et al.  Hardware realization of BSB recall function using memristor crossbar arrays , 2012, DAC Design Automation Conference 2012.

[14]  Don H. Johnson,et al.  Gauss and the history of the fast Fourier transform , 1984, IEEE ASSP Magazine.

[15]  T. Parks,et al.  A prime factor FFT algorithm using high-speed convolution , 1977 .

[16]  Jack J. Dongarra,et al.  Guest Editors Introduction to the top 10 algorithms , 2000, Comput. Sci. Eng..