4. Conclusion
In this work, the performance of Nikhilam multiplication algorithm is investigated. The performance analysis is
carried out for different bit lengths. The number of multiplication and the total process time are used as analysis
parameters. According to the study results, the number of multiplication is one and the same for different bit lengths
in Nikhilam algorithm. The more the bit length rises, the more the total process time increases. Furthermore,
Nikhilam algorithm has better results than classical multiplication method in terms of the number of multiplication
and the total process time. The reason is that the number of multiplication and the cost required to perform
multiplication operation are less than classical multiplication method. As a next step, the performance of Nikhilam
algorithm can be compared with the performance of the other algorithms developed in order for performing
multiplication operation. Besides, an algorithm can be developed for increasing the efficiency of multiplication
operation and reducing the processing cost