CORDIC: Elementary Function Computation Using Recursive Sequences
Neil A. Eklund · College Mathematics Journal · 2001
o ), and m determine the function and the point where that function is to be computed. The d k ( = 1 ) are chosen during iteration so that we always approach the desired value. In particular, m = 0, +1, or-1 with m = 0 to obtain a product or quotient, m = 1 to obtain sin(q), cos(q), or tan -1 (u), and m = -1 to obtain sinh(u), cosh(u), e u , tanh -1 (u), u, and ln(u); I have used u here so as to avoid confusion with the variables in the recursion process. The specifics are shown in table 1. Rotation (z k 0) Vectoring (y k 0) < - = 0 1 0 1 k k k z z d - < = 0 1 0 1 k k k y y d m = 0 x 0 , z 0 given, y 0 = 0 x 0