A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two
Computer Arithmetic, IEEE Symposium on (2003)
Santiago de Compostela, Spain
June 15, 2003 to June 18, 2003
Çetin K. Koç , Oregon State University
Serdar S. Erdem , Gebze Yüksek Teknoloji Enstitüsü
We propose a new algorithm for fast multiplication of large integers having a precision of 2k computer words, where k is an integer. The algorithm is derived from the Karatsuba-Ofman Algorithm and has the same asymptotic complexity. However, the running time of the new algorithm is slightly better, and it makes one third as many recursive calls.
Çetin K. Koç, Serdar S. Erdem, "A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two", Computer Arithmetic, IEEE Symposium on, vol. 00, no. , pp. 28, 2003, doi:10.1109/ARITH.2003.1207657