Vinodh Kumar, C. and Sastry, K.R.K. (2017) Design and Implementation of FFT Pruning Algorithm on FPGA. 7th International Conference on Cloud Computing, Data Science & Engineering, Noida, 12-13 January 2017, 739-743.
https://doi.org/10.1109/CONFLUENCE.2017.7943248

has been cited by the following article:

• TITLE: Reconfigurable Multi-Butterfly Parallel Radix-r FFT Processor

  AUTHORS: Jiyang Yu, Bowen Cheng, Zongling Li, Weiwei Liu, Luyuan Wang

  KEYWORDS: FFT, Reconfigurable, Multi-Butterfly, Parallel Processing

  JOURNAL NAME: Journal of Data Analysis and Information Processing, Vol.7 No.3, July 25, 2019

  ABSTRACT: The design of reconfigurable multi-butterfly parallel radix-r FFT (Fast Fourier Transform) processors is proposed. FFT is widely used in signal processing, and the application needs real-time and high performance, while most of the traditional designs are limited to the power of two, which wastes the buffers and multipliers in big data. In response to the problem, we improve the parallel FFT algorithm with the design of reconfigurable control machine combined with buffer/multiplier, and the cost function with the input of radix/number/paddling number/time consuming is deduced. Constrained with the number of buffer and multipliers, the radix and number can be computed with the optimum cost function, and the resolution space of computing performance and hardware cost is presented. The proposed guarantees the real-time performance with better flexibility compared with the previous literature, and the comparison also suggests the effectiveness of the design.