| 利用对称性加速实序列FFT的方法及其FPGA实现* |
| |
| 引用本文： | 邓宏贵,郭晟伟.利用对称性加速实序列FFT的方法及其FPGA实现*[J].计算机应用研究,2009,26(1):92-93. |
| |
| 作者姓名： | 邓宏贵 郭晟伟 |
| |
| 作者单位： | 中南大学,物理学院,电信系,长沙,410083 |
| |
| 基金项目： | 国家自然科学基金资助项目（60708014）；国家“863”计划子课题资助项目（E20050605） |
| |
| 摘 要： | 针对工程实践中傅里叶变换的输入序列一般为实序列的情况，充分利用FFT（快速傅里叶变换）奇偶虚实的对称性质，提出了一种实序列FFT的加速算法。将2N点的实序列DFT转换为N点的复序列DFT，并行计算使运算量明显减少；并给出了基于FPGA的硬件实现方法。
|
| 关 键 词： | 快速傅里叶变换 实序列 现场可编程门阵列 |
Using symmetry accelerating real FFT and its FPGA implementation |
| |
| DENG Hong-gui,GUO Sheng-wei.Using symmetry accelerating real FFT and its FPGA implementation[J].Application Research of Computers,2009,26(1):92-93. |
| |
| Authors: | DENG Hong-gui GUO Sheng-wei |
| |
| Affiliation: | (Dept. of Electronics & Information, School of Physics Science & Technology, Central South University, Changsha 410083, China) |
| |
| Abstract: | 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 FFT 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. |
| |
| Keywords: | fast Fourier transform(FFT) real sequence FPGA |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
