中文摘要：

针对工程实践中傅里叶变换的输入序列一般为实序列的情况，充分利用FFT（快速傅里叶变换）奇偶虚实的对称性质，提出了一种实序列FFT的加速算法。将2N点的实序列DFT转换为N点的复序列DFT，并行计算使运算量明显减少；并给出了基于FPGA的硬件实现方法。

英文摘要：

Regarding the input of FFT being generally real sequence in engineering practices, making full use of symmetrical property, this papar proposed a improvement algorithm for real FFT. Real FVF computation of 2N points were transformed to complex FFT computation of N points. The amount of calculation could significantly reduce while parallel calculating. And gave a hardware implementation on FPGA.