Share Email Print

Proceedings Paper

Evaluation of complex elementary functions: a new version of BKM
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 2 November 1999
PDF: 8 pages
Proc. SPIE 3807, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, (2 November 1999); doi: 10.1117/12.367631
Show Author Affiliations
Jean-Claude Bajard, LIM/CNRS (France)
Laurent Imbert, LIM/CNRS (France)

Published in SPIE Proceedings Vol. 3807:
Advanced Signal Processing Algorithms, Architectures, and Implementations IX
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?