摘要
文章通过对快速傅立叶变换(FFT)的算法原理分析,根据线性相关和卷积的数学特征及物理含义,针对长序列信号,提出了一种基于FFT的长序列快速相关及卷积算法,用C++进行了算法编程,在计算机上得到较好的实验效果,提高了运行速度.并结合算术傅立叶变换进行了改进。
Based on the analysis of the principle of conventional Fast Fourier Transform (FFT) algorithm, considering the mathematical characteristics and the physical meaning of linear correlation and convolution, A fast correlation andconvolution algorithm for long sequences FFT is proposed. This algorithm has been implemented using C++ programming language. Computer simulation results indicate that the proposed algorithm can accelerate the execution of FFT. Finally, this algorithm is improved in combination with arithmetic Fourier transform.
出处
《电路与系统学报》
CSCD
2001年第4期78-83,共6页
Journal of Circuits and Systems
基金
国家自然科学基金资助项目(69772024)
关键词
快速傅立叶变换
快速卷积
算术傅立叶变换
多媒体
算法
fast Fourier transform
fast correlation
fast convolution
arithmetic Fourier transform
