论文部分内容阅读
基于一维 DFT变换为多维 DFT的公因子算法 CFA,提出一种有效的修剪算法 .该算法首先利用 CFA算法将 DFT分解为内外两层若干组一维小点数 DFT,然后针对其特点对内外两层分别进行修枝 ,最大限度地减少了冗余计算 ,同时可实现任意点数截取或抽选输出 DFT的计算
An efficient pruning algorithm based on one-dimensional DFT transform to the CFA of multi-dimensional DFT is proposed.The algorithm firstly decomposes the DFT into several groups of one-dimensional small-DFTs of inner and outer layers using CFA algorithm, Layer pruning, respectively, to minimize the redundant calculation, at the same time be able to achieve any point truncation or lottery output DFT calculation