AN IMPROVED DIGITAL-REVERSED PERMUTATION ALGORITHM FOR THE FAST FOURIER ANDHARTLEY TRANSFORMS

作     者：Liu Bin Xie Ping (Automation Department, Vansnan University, Qinhuangdao 066004) Liu Bin Xie Ping (Automation Department, Vansnan University, Qinhuangdao 066004)

作者机构：Automation Department Yanshan University Qinhuangdao 

出 版 物：《Journal of Electronics(China)》 (电子科学学刊（英文版）)

年 卷 期：1998年第15卷第2期

页      面：144-149页

学科分类：08[工学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Radix-2 FFT and FHT Permutation algorithm Bit-reversed order Upper-limit 

摘      要：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.