Investigation of the Performance of Nikhilam Multiplication Algorithm. (3rd July 2015)

• Record Type: Journal Article
• Authors: Eyupoglu, Can
• Is Part Of: Procedia--social and behavioral sciences. Volume 195(2015)
• Page Start: 1959
• Page End: 1965
• Publication Date: 2015-07-03
• Subjects: Computer Arithmetic -- Multiplication -- Nikhilam Algorithm; Social sciences -- Periodicals; Social sciences -- Congresses; Arts -- Periodicals; Arts -- Congresses; Humanities -- Periodicals; Humanities -- Congresses; 300
• DOI: 10.1016/j.sbspro.2015.06.208
• Languages: English
• ISSNs: 1877-0428

Abstract

Abstract: Multiplication 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.