A Unified Expression for Split-radix dft Algorithms

摘要：

This paper presents a unified expression that covers all previously reported split-radix-2/2-, where m is an integer larger than one, algorithms. New split-radix algorithms can be also derived from this unified expression. These algorithms flexibly support DFT sizes N = q · 2-, where q is generally an odd integer. Comparisons show that the computational complexity required by the proposed algorithms for the DFT size N = q · 2- is generally not more than that for the DFT size N = 2-. In particular, our examples show that the split-radix-2/4 algorithm requires a smaller computational complexity compared to other split-radix algorithms and the prime factor algorithms.

作者: Guoan Bi Gang Li Xiumei Li

作者单位: School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore Coleage of Information Engineering, Zhe Jiang University of Technology, China School of Information Science and Engineering, Hangzhou Normal University, China

会议类型: 国际会议

会议名称: 2010 International Conference on Communications,Circuits and Systems(2010年通信、电路与系统国际会议)

会议地点: 成都

会议语种:英文

页码: 323-326

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