DocumentCode
1325602
Title
New binary Euclidean algorithms
Author
Mandelbaum, D.M.
Volume
24
Issue
14
fYear
1988
fDate
7/7/1988 12:00:00 AM
Firstpage
857
Lastpage
858
Abstract
Two new binary Euclidean algorithms to calculate the greatest common divisor are given. An exhaustive search for all odd integers of moderate length shows that these algorithms use fewer iterations on the average than that the two presently known algorithms
Keywords
digital arithmetic; binary Euclidean algorithms; digital arithmetic; greatest common divisor;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
Filename
8382
Link To Document