A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two

Authors:
Serdar S. Erdem;Çetin K. Koç
Affiliations:
-;-
Venue:
ARITH '03 Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)
Year:
2003

Citing 0
Cited 1

FPGA realization of high performance large size computational functions: multipliers and applications

Analog Integrated Circuits and Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.