Fast Algorithm and Implementation for 576=24×24-Point DFT

摘要：

A fast algorithm and implementation for computing 576-point DFT is developed. The fast algorithm subdivides a DFT of length N=576 into 24 24-point DFTs in a double factor algorithm. In the algorithm, one 576point DFT requires about 16324 additions and multiplications, which is less than 17936 additions and multiplications of a 512-point DFT in the radix-2 algorithm, and slightly more than 15369 of 512-point DFT in the split-radix algorithm. Comparing the fast algorithms for computing 512-point DFT, the fast algorithm for computing 576-point DFT requires a much simpler operation process. The algorithm and implementation provides a reference train of thought for computing some specific transform lengths DFT of communication systems.

关键词： 576-point DFT 24-point DFT radix-2 double factors algorithm specific length DFT

作者: Haijun Li Ran Fei Caojun Yan

作者单位: Electrical and New energy College, China Three Gorge University 8 University Avenue, Yichang 443002, Department of Information Engineering, Hubei Three Gorges Polytechnic 31 Stadium Avenue, Yichang 443

会议类型: 国际会议

会议名称: 2010 International Conference on Image Analysis and Signal Processing(2010 图像分析与信号处理国际会议 IASP 10)

会议地点: 厦门

会议语种:英文

页码: 434-438

在线出版日期: 2010-04-12（万方平台首次上网日期，不代表论文的发表时间）