Design optimisation of multiplier-free parallel pipelined FFT on field programmable gate array

• Published in: IET circuits, devices & systems Vol. 14; no. 7; pp. 995 - 1000
• Main Authors: Godi, Prasanna Kumar, Krishna, Battula Tirumala, Kotipalli, Pushpa
• Format: Journal Article
• Language: English
• Published: Stevenage The Institution of Engineering and Technology 01.10.2020; John Wiley & Sons, Inc
• Subjects: Algorithms; complex twiddle factors; Complexity; design optimisation; Design optimization; Digital imaging; digital signal; Digital signal processing; digital signal processing chips; discrete Fourier transforms; efficient FFT architecture; Fast Fourier transformations; fast Fourier transforms; FFT implementation; FFT operations; FFT stores; field programmable gate array; Field programmable gate arrays; Fourier transforms; frequency domain; frequency method; general filtering; hardware description languages; Image filters; Image processing; Intellectual property; Logic; mathematics computing; Multiplication; multiplication process; multiplier‐free parallel; pipeline processing; R2DIF method; radix‐2 decimation; Random access memory; Research Article; shift‐add method; Signal processing; spread‐spectrum communications; time domain; uniform Montgomery algorithm; Wireless communications; fast Fourier transforms; time domain; spread-spectrum communications; field programmable gate arrays; general filtering; uniform Montgomery algorithm; mathematics computing; FFT implementation; hardware description languages; design optimisation; frequency domain; field programmable gate array; R2DIF method; efficient FFT architecture; complex twiddle factors; image processing; FFT operations; discrete Fourier transforms; digital signal; shift-add method; radix-2 decimation; frequency method; FFT stores; pipeline processing; multiplier-free parallel; digital signal processing chips; multiplication process
• ISSN: 1751-858X; 1751-8598; 1751-8598
• DOI: 10.1049/iet-cds.2019.0512

Fast Fourier transform (FFT) is utilised to minimise the complexity of discrete Fourier transform by converting signals from frequency domain to time domain and conversely. Digital signal processing systems like image processing, general filtering, sonar, spread-spectrum communications and convolutions use this FFT operations. Radix-2 decimation in frequency (R2DIF) method is designed to execute an efficient FFT architecture in this study. Each and every state of the FFT stores the input and output the data using the R2DIF method. Also, the complex twiddle factors in FFT are replaced by the proposed uniform Montgomery algorithm. This technique simply performs the shift-add method instead of the multiplication process which also enhances the convergence of the calculation. So, the FFT implementation is done with the help of the proposed method which reduces the usage of chips in the process. Based on this approach, it performs the operation of FFT from 16 points to 1024 points and the performance of this proposed method is compared with existing approaches. Moreover, it does not require expensive dedicated functional blocks and uses only distributed logic resources. The simulation is carried out by the Xilinx platform using Verilog coding. The proposed design outperforms conventional methods in terms of less usage power and high speed.