摘要： 为提高运算速度,降低查找表规模,在原有查找表算法的基础上,提出一种单基快速傅里叶变换原址倒序算法。设计新的查找表构造算法,优化原有查找表的计算方法,并得出在不同倒序计算规模下最优查找表规模选取的一般规律。仿真结果表明,该算法查找表规模可变,通过循环访问查找表平衡选取查找表规模,可减少循环次数,并提高计算速度。
关键词:
快速傅里叶变换倒序,
查找表,
规模,
初始倒序对,
派生倒序对
Abstract: A single-radix Fast Fourier Transform(FFT) in-place permutation algorithm is proposed according to the original lookup table algorithm.A new lookup table configuration method is designed,and the computing method of original lookup table is optimized.The general law of selecting the optimal lookup table scale under different permutation calculation scale is obtained.Simulation results show that the scale of the lookup table is variable.The table can be searched by the cycle, the scale of the lookup table can be selected,the number of cycles can be reduced and the computing speed can be improved.
Key words:
Fast Fourier Transform(FFT) permutation,
lookup table,
scale,
initial permutation,
derived permutation
中图分类号: