An Algorithm for Computing 4(M)-Point DFT Based on 4-Point DFT Block

作者：Li Haijun^*; Zou Hongbo; Ji Peirong; Zhou Xuejun

来源：9th International Conference for Young Computer Scientists, 2008-11-18 to 2008-11-21.

• Algorithm
• 4-point DFT block
• radix-4 FFT
• 4(M)-point DFT
• DSP technology

An algorithm for computing 4(M)-point DFT based on 4-point LIFT block is developed. The new algorithm, in comparison to radix-4 FFT algorithm, requires the same number of additions and multiplications, but employs a dissimilar flow-graph. In the flow-graph of the new algorithm, the 4-point DFT blocks replace the accustomed butterfly computational networks. The new algorithm permits one 4(M)-point DFT to be computed using a 4-point DFT block, and the block requirements is Mx4(M-1). Because the total number of computational requirements of directly computing a 4-point DFT is only 16 real additions, a command block and hardware block for computing 4-point DFT may be obtained. When using a processor which integrates with a fast 4-point DFT block to compute 4(M)-point DFT, the speed of DFT will be faster than that of radix-4 FFT The algorithm based on 4-point LIFT block will be helpful to improve the DSP technology and speed.

• 出版日期2008
• 单位三峡大学