High Radix BKM Algorithm - Archive ouverte HAL Access content directly
Journal Articles Numerical Algorithms Year : 2004

High Radix BKM Algorithm

Abstract

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 and versions

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

Identifiers

Cite

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⟩
47 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More