H. Hahn et al., A UNIFIED AND DIVISION-FREE CORDIC ARGUMENT REDUCTION METHOD WITH UNLIMITED CONVERGENCE DOMAIN INCLUDING INVERSE HYPERBOLIC FUNCTIONS, I.E.E.E. transactions on computers, 43(11), 1994, pp. 1339-1344
One of the main problems of the CORDIC algorithm is the limited conver
gence domain, in which the functions can be calculated. Two different
approaches can be employed to overcome this constraint: first, an argu
ment reduction method and, second, an expansion of the CORDIC converge
nce domain. While the first approach requires significant processing o
verhead due to the need for divisions especially for tanh-1, the secon
d 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 fo
r floating point or fixed point implementations which results in savin
gs of computation time. In contrast to previous methods we avoid extra
CORDIC arithmetic for realization of argument reduction.