123

  用C或者matlab编写基2 FFT快速算法，输入点数是2的幂次方，序列视作既包含实部也包含虚部。要求一个函数计可以做正变换，也可以做反变换。编写输入序列，先进行正反向变换，得到离散频谱，再将离散频谱加载到输入端进行验证，从输出端获取序列，和原来的序列进行比较，看看是否相等。序列可随意设为2的幂次项！(Written by C or matlab base 2 FFT fast algorithm, the input power of 2 points is the sequence includes both the real part as the imaginary part is also included. Require a meter to do is change the function, you can also do the inverse transform. The preparation of the input sequence, first the forward and reverse transformation, discrete spectrum, discrete spectrum and then loaded into the input validation, access to sequence from the output side, and the original sequences were compared to see if equal. Sequence can be arbitrarily set to a power of 2 items!)