Expanding the Range of Convergence of the CORDIC Algorithm
IEEE Transactions on Computers
Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation
IEEE Transactions on Computers
Low Latency Time CORDIC Algorithms
IEEE Transactions on Computers - Special issue on computer arithmetic
Signal processing algorithms and architectures
Signal processing algorithms and architectures
CORDIC Vectoring with Arbitrary Target Value
IEEE Transactions on Computers
High-Throughput CORDIC-Based Geometry Operations for 3D Computer Graphics
IEEE Transactions on Computers
| Hi-index | 14.99 |
One of the main problems of the CORDIC algorithm is the limited convergence domain, in which the functions can be calculated. Two different approaches can be employed to overcome this constraint: first, an argument reduction method and, second, an expansion of the CORDIC convergence domain. While the first approach requires significant processing overhead due to the need for divisions especially for tanh/sup -1/, the second technique achieves an increased but still limited convergence domain only. In this brief contribution, we present a unified division-free argument reduction method and a regular pipeline/array architecture for floating point or fixed point implementations which results in savings of computation time. In contrast to previous methods we avoid extra CORDIC arithmetic for realization of argument reduction.