2 November 1999 Evaluation of complex elementary functions: a new version of BKM
Author Affiliations +
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 during the computation, nor to double the number of iterations. So our algorithm is suitable for an efficient hardware implementation.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jean-Claude Bajard, Jean-Claude Bajard, Laurent Imbert, Laurent Imbert, } "Evaluation of complex elementary functions: a new version of BKM", Proc. SPIE 3807, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, (2 November 1999); doi: 10.1117/12.367631; https://doi.org/10.1117/12.367631
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top