Improvements on the accelerated integer GCD algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 1997

Improvements on the accelerated integer GCD algorithm

Résumé

The present paper analyses and presents several improvements to the algorithm for finding the $(a,b)$-pairs of integers used in the $k$-ary reduction of the right-shift $k$-ary integer GCD algorithm. While the worst-case complexity of Weber's ''Accelerated integer GCD algorithm'' is $\cO\l(\log_\phi(k)^2\r)$, we show that the worst-case number of iterations of the while loop is exactly $\tfrac 12 \l\lfloor \log_{\phi}(k)\r\rfloor$, where $\phi := \tfrac 12 \l(1+\sqrt{5}\r)$.\par We suggest improvements on the average complexity of the latter algorithm and also present two new faster residual algorithms: the sequential and the parallel one. A lower bound on the probability of avoiding the while loop in our parallel residual algorithm is also given.
Fichier principal
Vignette du fichier
Improvtsgcd97.pdf (133.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00911140 , version 1 (10-02-2014)

Identifiants

Citer

Sidi Mohamed Sedjelmaci, Christian Lavault. Improvements on the accelerated integer GCD algorithm. Information Processing Letters, 1997, 61 (1), pp.31--36. ⟨hal-00911140⟩
209 Consultations
296 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More