基4的FFT算法程序，它是要通过将长度为N的数据序列转化成大小为4的DFT来实现高速化。从理论上讲，它比执行时间缩短为基2的FFT的3/4。该程序性能优越，可用性很强。下载即可用！-4 FFT algorithm based procedures, it is to be adopted will be a length of N data sequence into a size of 4 to achieve high-speed DFT. In theory, shorter than t