.png){kind=icon}
返回
Radix- N Algorithm for Computing N2n -Point DFT Approximations
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2022.3200573.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Discrete Fourier transform
fast Fourier transform
approximation
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
On the reproductive biology of the females of the shrimp Crangon crangon (L.) (Decapoda, Crangonidae).png)
Oceanology
OceanologyIF0
PREAI
分享收藏分享收藏
Generic position of Melaleuca punicea: Petraeomyrtus, gen. nov. (Myrtaceae)红桉属 Melaleuca punicea 的属级分类地位：Petraeomyrtus，新属 (桃金娘科)
PREAI
分享收藏
查看更多内容