Performance Analysis of Karatsuba Multiplication Algorithm for Different Bit Lengths
Yükleniyor...
Tarih
2015
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier Science Bv
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In computer arithmetic, multiplication is one of the most significant operations. Multiplication is used in many operations such as division, squaring and computing reciprocal. In addition, the efficiency of multiplication is crucial due to the use of digital signal processing applications such as correlation, filtering, frequency analysis and image processing. Karatsuba algorithm is one of the algorithms developed for increasing the efficiency and reducing the cost in order to simplify multiplication. In this study, the performance of Karatsuba algorithm is analyzed in terms of the number of multiplication and the total process time for different bit lengths. (C) 2015 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Açıklama
World Conference on Technology, Innovation and Entrepreneurship -- MAY 28-30, 2015 -- Istanbul, TURKEY
WOS:000380509900224
WOS:000380509900224
Anahtar Kelimeler
Computer Arithmetic, Multiplication, Karatsuba Algorithm
Kaynak
World Conference on Technology, Innovation and Entrepreneurship
WoS Q Değeri
N/A
