Metraipolis › archive › dc_cbd2de4c030a

BKM algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/BKM_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T20:22:18.039Z
SHA-256 of the archived text
8b259a9fea77572a74453247b2ce5ed07c5d1dd8ed8773620f295741fb4af0db
Stable URL of this page
https://metraipolis.com/documento/dc_cbd2de4c030a

How to cite

BKM algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/BKM_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_cbd2de4c030a (Metraipolis archive dc_cbd2de4c030a, sha256 8b259a9fea77572a74453247b2ce5ed07c5d1dd8ed8773620f295741fb4af0db)
BibTeX
@misc{dccbd2de4c030a,
  title = {BKM algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/BKM_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_cbd2de4c030a; sha256 8b259a9fea77572a74453247b2ce5ed07c5d1dd8ed8773620f295741fb4af0db},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/BKM_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The BKM algorithm is a shift-and-add algorithm for computing elementary functions, first published in 1994 by Jean-Claude Bajard, Sylvanus Kla, and Jean-Michel Muller. BKM is based on computing complex logarithms (L-mode) and exponentials (E-mode) using a method similar to the algorithm Henry Briggs used to compute logarithms. By using a precomputed table of logarithms of negative powers of two, the BKM algorithm computes elementary functions using only integer add, shift, and compare operations. BKM is similar to CORDIC, but uses a table of logarithms rather than a table of arctangents. On each iteration, a choice of coefficient is made from a set of nine complex numbers, 1, 0, −1, i, −i, 1+i, 1−i, −1+i, −1−i, rather than only −1 or +1 as used by CORDIC. BKM provides a simpler method of computing some elementary functions, and unlike CORDIC, BKM needs no result scaling factor. The convergence rate of BKM is approximately one bit per iteration, like CORDIC, but BKM requires more precomputed table elements for the same precision because the table stores logarithms of complex operands. As with other algorithms in the shift-and-add class, BKM is particularly well-suited to hardware implementation. The relative performance of software BKM implementation in comparison to other methods such as polynomial or rational approximations will depend on the availability of fast multi-bit shifts (i.e. a barrel shifter) or hardware floating point arithmetic.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «BKM algorithm» — https://en.wikipedia.org/wiki/BKM_algorithm
Wikidata Q556818 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q556818
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/BKM_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375119274, consultata il 2026-10-07T19:39:06.128Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 0d78aaecd951f01919ce380c3eec63455892af4ef7615f26603ad82ff3b2a27f