Evaluation of complex elementary functions: a new version of BKM

Jean-Claude Bajard; Laurent Imbert

doi:10.1117/12.367631

2 November 1999 Evaluation of complex elementary functions: a new version of BKM

Jean-Claude Bajard, Laurent Imbert

Proceedings Volume 3807, Advanced Signal Processing Algorithms, Architectures, and Implementations IX; (1999) https://doi.org/10.1117/12.367631
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1999, Denver, CO, United States

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.

Citation Download Citation

Jean-Claude Bajard and 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); https://doi.org/10.1117/12.367631

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available