基于CORDIC的基4-IFFT/FFT算法的硬件实现  

Hardware Implementation of Radix-4 FFT/FFT Algorithm Based on CORDIC

作　　者：王玉华[1] 温浩[1] 任宏亮[1] 覃亚丽[1] 

机构地区：[1]浙江工业大学信息学院,浙江杭州310023

出　　处：《杭州电子科技大学学报（自然科学版）》2013年第5期150-153,共4页Journal of Hangzhou Dianzi University：Natural Sciences

摘　　要：该文给出了一种基于CORDIC的基4-IFFT/FFT算法,只需加减法和移位即可实现乘法。在Quartus II上建立了一个VHDL无乘法器递归结构的仿真模型进行验证,在Cyclone II系列的开发板上完成硬件实现。实验结果表明,对于1 024点的FFT运算,该文给出的算法相比于级联结构可节省55%的硬件资源。对于20MHz下的64点FFT运算,时间约为13μs。整个算法成本低,速度较快又采用模块化思想设计,可移植性强,通用性好,在可见光OFDM调制解调系统中有很好的应用前景。WANG Yu-hua, WEN Hao, REN Hong-ling, QIN Ya-li （Department of lnformation, Zhejiang University of Technology, Hangzhou Zhejiang 310023, China） This paper presents a radix-4 FFT/FFT algorithm based on CORDIC algorithm, it can realize multiplication by addition, subtraction and shifting, which makes the system of high speed and low cost. A simulation model of recursive architecture is built on Quartus Ⅱ through VHDL without multipler and hardware implementation is finished on development board of Cyclone Ⅱ. The results prove that our algorithm can save 55 percent of hardware resources compared with the one of cascaded architecture for 1024-point FFT computation. It needs 13 μs for 64-point FFT with frequency of 20MHz. The modular designed algorithm is of low cost, fastspeed, high portability and generality, which is a potential candidate for visible light OFDM modulation and demodulation system.

关 键 词：基四快速傅立叶变换 基四快速傅立叶逆变换 坐标旋转数字计算机算法 现场可编程门阵列 

分 类 号：TN911.72[电子电信—通信与信息系统]