The Journal of China Universities of Posts and Telecommunications ›› 2024, Vol. 31 ›› Issue (5): 71-84.doi: 10.19682/j.cnki.1005-8885.2024.0015

Previous Articles     Next Articles

Fast Fourier transform convolutional neural network accelerator based on overlap addition

  

  • Received:2023-03-20 Revised:2024-01-02 Online:2024-10-31 Published:2024-10-31
  • Contact: jizeng weijizengwei E-mail:weijizeng@tju.edu.cn

Abstract:

In convolutional neural networks ( CNNs), the floating-point computation in the traditional convolutional layer is enormous, and the execution speed of the network is limited by intensive computing, which makes it challenging to meet the real-time response requirements of complex applications. This work is based on the principle that the time domain convolution result equals the frequency domain point multiplication result to reduce the amount of floating- point calculations for convolution. The input feature map and the convolution kernel are converted to the frequency domain by the fast Fourier transform( FFT), and the corresponding point multiplication is performed. Then the frequency domain result is converted back to the time domain, and the output result of the convolution is obtained. In the shared CNN, the input feature map is much larger than the convolution kernel, resulting in many invalid operations. The overlap addition method is proposed to reduce invalid calculations and speed up network execution better. This work designs a hardware accelerator for frequency domain convolution and verifies its efficiency on the Xilinx Zynq UltraScale + MPSoC ZCU102 board. Comparing the calculation time of visual geometry group 16 ( VGG16 ) under the ImageNet dataset faster than the traditional time domain convolution, the hardware acceleration of frequency domain convolution is 8. 5 times.

Key words: convolutional neural network ( CNN), fast Fourier transform ( FFT), overlap addition