This paper presents a unified expression that covers all previously reported split-radix-2/2m, 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 · 2r, where q is generally an odd integer. Comparisons show that the computational complexity required by the proposed algorithms for the DFT size N = q · 2r is generally not more than that for the DFT size N = 2r. 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.
展开▼
机译:本文提出了一个统一的表达式,该表达式涵盖了所有先前报告的split-radix-2 / 2 m sup>,其中m是大于1的整数。新的拆分基数算法也可以从该统一表达式中导出。这些算法灵活地支持DFT大小N = q·2 r sup>,其中q通常是一个奇数整数。比较表明,所提出的算法对于DFT大小N = q·2r所需的计算复杂度通常不大于DFT大小N = 2 r sup>所要求的。尤其是,我们的示例表明,与其他拆分基数算法和素数算法相比,拆分基数2/4算法所需的计算复杂度更低。
展开▼