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

被引:0
|
作者
Liu Bin Xie Ping (Automation Department
机构
关键词
Radix-2 FFT and FHT; Permutation algorithm; Bit-reversed order; Upper-limit;
D O I
暂无
中图分类号
TP301.6 [算法理论];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:144 / 149
页数:6
相关论文
共 50 条