计算机应用与软件2011，Vol.28Issue(2)：93-95,3.
快速傅立叶变换中的一种倒位序生成法
AN ALGORITHM TO GENERATE REVERSE SEQUENCE IN FAST FOURIER TRANSFORM
摘要
Abstract
Fast Fourier transform is a fast algorithm of discrete Fourier transform, its appearance greatly simplifies the calculation of DFT,and the computation time can be shortened by one or two orders of magnitude thereby. For the reason of that, the discrete Fourier transform has been widely used in signal analysis and processing fields. The issue of reverse sequence is involved in programming designs of beth application software and hardware for achieving fast Fourier transform algorithm. In light of this, in the paper a generation algorithm for reverse sequence is proposed. It directly calculates the values of reverse ordinals in each natural sequential position, and then through the operation of addresses variation the ordering of reverse sequence of the primary sequence is achieved. For any FFT meets the point of N = 2M, this algorithm can quickly realise the reverse sequence ordering of the transform. The method only involves the reverse sequence decimal numeral and ordinal decimal numeral, but does not need to transform the binary numeral, it is simple and easy to implement. Simulation results show that the algorithm is reliable and effective.关键词
快速傅立叶变换/离散傅立叶变换/倒位序/倒位序生成法引用本文复制引用
王芳,张学锋,程增会..快速傅立叶变换中的一种倒位序生成法[J].计算机应用与软件,2011,28(2):93-95,3.基金项目
安徽省教育厅项目(2008jq1032). （2008jq1032）
