High Radix BKM Algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Numerical Algorithms Année : 2004

High Radix BKM Algorithm

Résumé

In this paper, a high radix implementation of the BKM algorithm is introduced. The BKM algorithm is a shift-and-add CORDIC-like algorithm that performs fast computation of complex exponential and logarithm without any scalling factor. The proposed implementation reduces the number of iterations needed for the calculation. Compared to previous implementations of high radix BKM algorithm, it needs smaller lookup tables.

Dates et versions

hal-01146499 , version 1 (28-04-2015)

Identifiants

Citer

Laurent-Stéphane Didier, Fabien Rico. High Radix BKM Algorithm. Numerical Algorithms, 2004, 37 (1-4), pp.113-125. ⟨10.1023/B:NUMA.0000049459.69390.ff⟩. ⟨hal-01146499⟩
42 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More