吴庆达, 何书专, 潘红兵, 沙金, 李伟. 32位定浮点数正余弦函数FPGA实现方法[J]. 微电子学与计算机, 2012, 29(1): 113-116.
引用本文: 吴庆达, 何书专, 潘红兵, 沙金, 李伟. 32位定浮点数正余弦函数FPGA实现方法[J]. 微电子学与计算机, 2012, 29(1): 113-116.
WU Qing-da, HE Shu-zhuan, PAN Hong-bing, SHA Jin, LI Wei. Implementations of 32-bits Fixed and Floating Point Trigonometric Functions with FPGA[J]. Microelectronics & Computer, 2012, 29(1): 113-116.
Citation: WU Qing-da, HE Shu-zhuan, PAN Hong-bing, SHA Jin, LI Wei. Implementations of 32-bits Fixed and Floating Point Trigonometric Functions with FPGA[J]. Microelectronics & Computer, 2012, 29(1): 113-116.

32位定浮点数正余弦函数FPGA实现方法

Implementations of 32-bits Fixed and Floating Point Trigonometric Functions with FPGA

  • 摘要: 本文首先介绍了查表算法和Cordic算法原理, 在这两种算法基础上, 用Verilog HDL语言对32位定点数的正余弦函数进行了编程设计, 结合仿真综合结果, 对这两种方法从运算精度, 运算速度和占用硬件资源几方面进行了分析.进而采用不经过浮点定点转换, 直接在Cordic算法改进的基础上实现32位浮点数的正余弦函数FPGA设计.最后, 对这三种实现方法进行了综合评价.

     

    Abstract: Firstly, this paper introduces the Lookup-table algorithm and cordic algorithm.Based on the two algorithms, we program and design 32-bit fixed-point trigonometric functions with Verilog-HDL.Combined with simulation, we evaluate these two methods by comparing operation precision, operation speed and hardware resources occupied.Then, we design the 32-bit floating-point trigonometric functions directly based on improved cordic algorithm without floating-fixed exchange.Finally, we evaluate these three methods.

     

/

返回文章
返回