摘要
分析典型的基2快速傅立叶变换实现过程,提出了一种高效的快速傅立叶变换方法实现,采用了逆序映射方法和改进生成法的编程技术,对FFT的位序倒置算法的实现作了改进.实验表明:本方法在计算n个信号序列的傅立叶变换的运算时间减少近一半.
By analyzing realization process of classic the Fast Fourier Transform based 2, the more improving method is given to realize the Fast Fourier Transform for the digital image processiong. Adopting on reversing - order maping method and programming technique of improved making method, bitreversing arithmetic in FFT gets more improving. By testing in PC and comparing to the old method, It has been proved that these improving methods for the Fast Fourier Transform are the mor efficient.
出处
《怀化学院学报》
2008年第2期60-63,共4页
Journal of Huaihua University