Radix- N Algorithm for Computing N2n -Point DFT Approximations

doi:10.1109/LSP.2022.3200573

Radix- N Algorithm for Computing N2n -Point DFT Approximations

2022-01-01

2

PRE

AI

DOI：10.1109/LSP.2022.3200573

Original

Original request for help

Save

Abstract

En 中文

The ever increasing technological demand for the DFT computation poses several challenges both to theory and hardware realization. The design of usual fast Fourier transform (FFT) algorithms seems to have reached a stage of diminishing returns in terms of performance. Alternatively, approximate transform methods have been demonstrated to provide substantial gains in terms of energy-efficiency and performance by tolerating small inaccuracies in the results. In this letter, we present a transform scaling method variant of the Cooley-Tukey algorithm to obtain DFT approximations of large blocksize. The proposed method scales up a given N -point transformation to an N-2-point transformation. Such scaling can be successively applied leading to N-2n -point transformations. We have fully presented the 32(4)-point DFT approximation which stems from a multiplierless 32-point DFT approximation. The proposed approximation is equipped with a fast algorithm; we also supply the arithmetic complexity assessment and an error analysis.

Keywords:

Discrete Fourier transform

fast Fourier transform

approximation

Radix- N Algorithm for Computing N2n -Point DFT Approximations

Abstract

Journal

Organization