LIP6 2002/009

• Reports «Algorithme BKM en grande base avec sélection par arrondi»
• L.-S. Didier, F. Rico
• 11 pages - 04/26/2002 - document en - http://www.lip6.fr/lip6/reports/2002/lip6.2002.009.pdf 216 Ko
• Contact laurent-stephane.didier (at) nulllip6.fr, fabien.rico (at) nulllip6.fr
• Ancien Thème : ANP
We present in this paper a high radix implementation of BKM algorithm. This is a shift and add CORDIC-Like algorithm that allows fast computations of complex exponential and logarithm. The improvement lies in fewer iterations for a given precision and in the reduction of the size of lookup tables for high radices.