【摘要】 利用离散付里叶变换的对称性质,本文提出了一种使FFT流图具有称性质的FFT算法,该算法的实现流图中输入和输出序列均为自然排列顺序,其流图表达简明。该算法的矩阵表达式比基-2FFT的矩阵表达式更为简明,并减少一倍的矩阵形式.在某些特殊场合下.可以使指令形式大为减少。更多还原

【Abstract】 A new FFT algorithm is presented in this paper which leads theflow graph be expressed as symmetrical geometry, by utilizing the symmetricalproperty of DFT. The flow graph of the algorithm is very simple and bothinput and output are normally ordered rather than bit-reversed. The expressionof the algorithm in matrix form is more simple than other algorithms and nearlyif of matrix form be reduced, which can result in simplication or reductioninstructions in some special situations.更多还原