Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Multiplierless Processing Element for Non-Power-of-Two FFTs

Abstract : This paper presents hardware-efficient building blocks for non-power-of-two Fast Fourier transform (FFT) algorithms. A reconfigurable unified multiplierless mixed radix-2/3/4/5 FFT design is proposed. In addition, standalone designs for the computation of the multiplierless radix-3 and radix-5 processing elements are illustrated. These architectures are based on Wingorad Fourier transform algorithm , which uses constant multipliers instead of general complex-valued multipli-ers. In this paper we propose to further reduce the hardware complexity by replacing the constant multipliers by shift-and-add structures. In addition, we show that the unified architecture is achieved by adding only a small number of multiplexers. The implementation results for field-programmable gate arrays (FPGAs) with Look-Up Table based logic are provided. In all of them, the proposed designs achieve significant reduction in area (around 30%) with respect to state of the art.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Anastasia Volkova Connect in order to contact the contributor
Submitted on : Tuesday, January 23, 2018 - 2:28:40 PM
Last modification on : Tuesday, October 25, 2022 - 4:18:33 PM
Long-term archiving on: : Thursday, May 24, 2018 - 12:03:23 PM


Files produced by the author(s)


  • HAL Id : hal-01690832, version 1


Fahad Qureshi, Anastasia Volkova, Thibault Hilaire, Jarmo Takala. Multiplierless Processing Element for Non-Power-of-Two FFTs. 2018. ⟨hal-01690832⟩



Record views


Files downloads