Abstract: CORDIC algorithm is widely used to compute transcendental functions for its simple addition, shift and table looking-up operations. In this paper, two different methods of computing eθ are deduced to get the CORDIC iteration expression, so as two groups of initial iteration values. After comparison it‘s concluded that the choice of initial iteration value can affect the complexity and area cost of hardware implementation, and under the condition of just needing the value of eθ, the hardware complexity can be reduced with special initial values.

摘要： CORDIC算法可通过简单的加法和移位操作计算基本的超越函数。本文对计算指数函数eθ的CORDIC迭代表达式给出了两种不同思路的推导，并赋予不同意义的初值。对比表明，采用不同的迭代初值会影响eθ硬件实现电路的复杂度和面积开销。对于只需计算eθ的场合，可使用特殊的初值对eθ的硬件实现电路进行专门优化。