Eyüpoğlu, CanŞener, SeferSaridogan, ErcanStaub, S2020-11-212020-11-212015https://doi.org/10.1016/j.sbspro.2015.06.208https://hdl.handle.net/11467/4183World Conference on Technology, Innovation and Entrepreneurship -- MAY 28-30, 2015 -- Istanbul, TURKEYWOS:000380509900236Multiplication is one of the most important operations in computer arithmetic. Multiplication is used in many operations such as squaring, division and computing reciprocal. Moreover, multiplication is a very significant arithmetic operation for lots of signal processing applications which are convolution, correlation, frequency analysis, image processing etc. The efficiency of multiplication operation is crucial for the process time of these applications. Nikhilam algorithm is one of the algorithms developed for increasing the efficiency and reducing the cost in order to simplify multiplication. In this work, the performance of Nikhilam multiplication 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/).eninfo:eu-repo/semantics/openAccessComputer ArithmeticMultiplicationNikhilam AlgorithmConference Object19591965N/AWOS:00038050990023610.1016/j.sbspro.2015.06.208