Abstract
We present an improvement of BKM: a shift-and-add algorithm based on the CORDIC that allows fast computation of complex exponential and logarithm functions. BKM is accelerated by the use of a redundant binary number system. Unlike the previous redundant CORDIC methods, we do not need neither to calculate the scale factor (luring the computation, nor to double the number of iterations. So our algorithm is suitable for an efficient hardware implementation.
Cite
CITATION STYLE
Bajard, J.-C., & Imbert, L. (1999). Evaluation of complex elementary functions: a new version of BKM. In Advanced Signal Processing Algorithms, Architectures, and Implementations IX (Vol. 3807, pp. 2–9). SPIE. https://doi.org/10.1117/12.367631
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
