Some FFT Algorithms for Small-Length Real-Valued Sequences

Applied Sciences

Dorota Majorkowska-Mech¹  Aleksandr Cariow¹ 

[1] Faculty of Comuter Science and Information Technology, West Pomeranian University of Technology, Zolnierska 49, 71-210 Szczecin, Poland;

关键词: discrete Fourier transform;    fast algorithm;    matrix–vector notation;   

DOI  :  10.3390/app12094700

来源: DOAJ

【 摘 要 】

This paper proposes fast algorithms for computing the discrete Fourier transform for real-valued sequences of lengths from 3 to 9. Since calculating the real-valued DFT using the complex-valued FFT is redundant regarding the number of needed operations, the developed algorithms do not operate on complex numbers. The algorithms are described in matrix–vector notation and their data flow diagrams are shown.

【 授权许可】

Unknown