说明：  实际中需做快速傅里叶变换(FFT)的多为实序列数据，而其变换算法都是以复数序列作为输入。文中利用频域的性质，将实序列数据变换为复数序列，再进行FFT 变换，以提高FFT对于实序列输入的变换效率，最后用C 语言实现该算法并与传统算法进行实验对比，从结果可看到优化后效率提高很多。
(Practice to be done fast Fourier transform (FFT) for the implementation of multi-sequence data, and its transformation algorithm are based on complex sequence as input. The system uses frequency-domain nature of the real sequence data transformation is a complex number sequence, then the FFT transform, to enhance the FFT for the real sequence input conversion efficiency, and finally with the C language implementation of the algorithm with the traditional algorithm experimental comparison, from the results see a lot more efficient after optimization.)