The computation of elementary functions in radix \(2^ p\) (Q1340861)

The author presents new algorithms computing the sine, the cosine, and the exponential functions. The idea is to compute all this functions in radix \(2^ p\) in order to reduce the number of iterations. All these algorithms are based on the discrete bases decomposition algorithm. Each iteration is computed using the AXPY cell which is a small quick multiplier and the computation is between 2 and 3 times quicker than the standard algorithms. A comparison between radix 2 and radix \(2^ p\) algorithms and between CORDIC and polynomial approximation is presented, too.