资 源 简 介
这个傅立叶实例算法使用了基2、基3、基4、基5、基8、基10……混合算法，几乎可以计算任意长度的FFT。说明白点也就是当序列长度n为2、3、5、7、11等这些比较小的素数时，或者n的最大素因数<=37时，可计算这个序列的FFT。-The Fourier algorithm uses an instance of the base 2, base 3, base 4, base 5, base 8, base 10 ... ... hybrid algorithm can calculate almost any length of FFT. Say clearly that that is when the sequence length n for 2,3,5,7,11 and so on these relatively small prime numbers, or when n, the largest prime factor "= 37 hours, calculate the sequence of the FFT.
