摘要
本文提出一种适于基-2FFT或FHT的更为高效的整序算法,使以往算法的运算量、算法结构等性能都有明显改善,尤其当N较大时有很大优势,可以进一步提高FFT和FHT的运算效率。
A more efficient permutation algorithm which has less computer operation and better structure is presented here for radix-2 FFT (FHT). It can fasten the FFT and FHT efficiently when N becomes large.
关键词
整序算法
位序倒置
换序上限
数字信号处理
Radix-2 FFT and FHT, Permutation algorithm, Bit-reversed order, Upper limit
