摘要
快速傅立叶变换 ( FFT)属于数字信号处理中最基础的运算 ,已广泛应用于通讯、医学电子学、雷达或无线电天文学等领域。对 FFT的主要算法进行了概述 ,并对其特性和运算工作量进行了分析和对比 ,期望对快速傅立叶变换算法有一个清晰的认识。
Fast Fourier Transform(FFT) is one of the basal operations in DSP, which has been widely applied in communication, medical electronics, radar and wireless astronomy This paper focuses on the FFT algorithm , and provides the comparison and analyzing of it's characteristics and compute complexity, expects to give a clear understanding of the FFT algorithm
出处
《现代电子技术》
2001年第8期11-14,共4页
Modern Electronics Technique
