srfft
代码说明:
计算复序列的分裂基快速傅里叶变换,分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中,分裂基算法具有最少的运算量,且仍保留结构规则、原位计算等优点。(Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in the base class, the split-based algorithm has the least amount of computation and structural rules remain in situ calculation and so on.)
文件列表:
说明.txt,790,2011-12-23
下载说明:请别用迅雷下载,失败请重下,重下不扣分!