利用逆序循环实现FFT运算中倒序算法的优化  

Use Bit-Reverse Loop to realize the optimization of Bit-scramble algorithm in FFT

作　　者：方志红[1] 张长耀[1] 俞根苗[1] 

机构地区：[1]中国电子科技集团公司第38所成像中心

出　　处：《信号处理》2004年第5期533-535,共3页Journal of Signal Processing

摘　　要：在数字信号处理中,FFT运算所占角色日趋重要。FFT的运算性能可以在很大程度上影响整个信号处理系统的性能。传统FFT算法中需要进行倒序以得到正确结果。倒序的运算速度取决于两个方面:逆序数的计算效率及取数存数时间。本文提出了逆序循环的概念并在此基础上提出一种新的倒序优化算法。在MPC7400芯片上进行的实验表明,采用本文提出的方法可以大大提高传统倒序算法性能。The Fast Fourier Transform (FFT) plays an important role in Digital Signal Processing (DSP). The speed of FFT algorithm can greatly influent the performance of DSP system. Bit-scramble is needed to get correct result in traditional algorithms. The speed of bit-scramble mainly depends on two factors: the computation load for bit-reverse and the load-save time for swap data. In this paper, we have given out a new concept: bit-reverse loop and proven a new kind solution based on it. The simulation on MPC7400 has proved the new solution can improve the performance of traditional bit-scramble algorithm greatly.

关 键 词：倒序 运算性能 角色 传统 概念 序优化 基础 算法 运算速度 芯片 

分 类 号：TP332[自动化与计算机技术—计算机系统结构] G305[自动化与计算机技术—计算机科学与技术]