Skip to main content
Log in

Abstract

We present a radix-10 variant of the BKM algorithm. It is ashift-and-add, CORDIC-like algorithm that allows fast computation of complex exponentials and logarithms. It can easily be used to compute the classical real elementary functions (sin, cos, arctan, ln, exp). This radix-10 version is suitable for implementationin a pocket computer.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Volder, “The CORDIC Computing Technique,” IRE Transactions on Electronic Computers, vol. EC-8, no.5, 1959, pp. 330–334. Reprinted in E.E. Swartzlander, Computer Arithmetic, vol. 1, Los Alamos, CA: IEEE Computer Society Press Tutorial, 1990.

    Article  Google Scholar 

  2. J. Walther, “A Unified Algorithm for Elementary Functions,” in Proceedings of the AFIPS Spring Joint Computers Conference 1971, pp. 379–385. Reprinted in E.E. Swartzlander, Computer Arithmetic, vol. 1, Los Alamos, CA: IEEE Computer Society Press Tutorial, 1990.

  3. J.-M. Muller, Elementary Functions, Algorithms and Implementation, Boston: Birkhäuser, 1997.

    Book  MATH  Google Scholar 

  4. G. Henkstra, “CORDIC for High-Performance Numerical Computaion,” Ph.D. Thesis, TU Delft, 1998.

  5. N. Takagi, T. Asada, and S. Yajima, “RedundantCORDICMethods with a Constant Scale Factor,” IEEE Tansactions on Computers, vol. 40, no.9, 1991.

  6. J. Duprat and J.-M. Muller, “The CORDIC Algorithm: New results for Fast VLSI Implementation,” IEEE Transactions on Computers, vol. 42, no.2, 1993, pp. 168–178.

    Article  Google Scholar 

  7. H. Dawid and H. Meyr, “The Differential CORDIC Algorithm: Constant Scale Factor Redundant Implementation without Correcting Iterations,” IEEE Transactions on Computers, vol. 45, no.3, 1996, pp. 307–318.

    Article  MATH  Google Scholar 

  8. M. Ercegovac and T. Lang, “Redundant and On-line CORDIC: Application to Matrix Triangularization and SVD,” IEEE Transaction on Computers, vol. 39, no.6, 1990, pp. 725–740.

    Article  Google Scholar 

  9. J.-C. Bajard, S. Kla, and J.-M. Muller, “BKM: A New Complex Algorithm for Complex Elementary Functions,” IEEE Transaction on Computers, vol. 43, no.8, 1994, pp. 955–963.

    Article  MathSciNet  Google Scholar 

  10. J.-C. Bajard and L. Imbert, “Evaluation of Complex Elementary Functions: A New Version of BKM,” in Proceedings of SPIE, Advanced Signal Processing Algorithm, Architectures and Implementations IX, F. Luk (Ed.), vol. 3807, 1999, Denver–USA, pp. 2–9.

  11. A. Avizienis, “Signed-Digit Number Representation for Fast Parallel Arithmetic,” IRE Transactions on Electonic Computers, vol. 10, 1961, pp. 389–400.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Imbert, L., Muller, J. & Rico, F. A Radix-10 BKM Algorithm for Computing Transcendentals on Pocket Computers. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 25, 179–186 (2000). https://doi.org/10.1023/A:1008127208220

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008127208220

Keywords

Navigation