一种基于CORDIC算法的复乘模块设计及其FFT应用  

Design of CORDIC-Based Plural-Multiplication Module and Its FFT Application

作　　者：岳鸿鹏[1] 王和明[1] 任璟[1] 

机构地区：[1]空军工程大学导弹学院,陕西三原713800

出　　处：《微电子学》2010年第4期539-542,共4页Microelectronics

摘　　要：FFT中复数乘法实现的一般做法是将旋转因子的值预先存放在指定的ROM内。这不仅占用大量的FPGA内部资源,也不利于变换速度和精度的提高。基于CORDIC算法,设计了一种能实时计算旋转因子值的高效复乘模块,在节约ROM资源的同时,兼顾速度与精度的需要,很好地解决了上述问题。理论论证和仿真结果均表明,该设计可行,具有一定的实际意义和应用前景。The general way of realizing plural-multiplication in FFT is to pre-store values of revolving factor in appointed ROM,which not only takes up a great deal of internal resources of FPGA,but also restricts the improvement of the transformation speed and accuracy.Based on CORDIC algorithm,a high efficiency plural-multiplication module was designed to work out revolving factor values in real time,which economizes ROM resources at no expense of speed and accuracy.Both theoretical calculation and simulation results indicate that the design is feasible and practical.

关 键 词：FFT 复数乘法 FPGA CORDIC 

分 类 号：TN402[电子电信—微电子学与固体电子学]