An Efficient Multiplication Algorithm Using Nikhilam Method
Shri Prakash Dwivedi

TL;DR
This paper introduces a novel integer multiplication algorithm based on the Nikhilam method from Vedic mathematics, aiming to improve efficiency in binary multiplication within computer arithmetic.
Contribution
It presents a new multiplication algorithm leveraging the Nikhilam method, offering potential efficiency improvements over traditional binary multiplication techniques.
Findings
Potentially faster multiplication in binary arithmetic
Applicability to various integer operations
Foundation for further optimization
Abstract
Multiplication is one of the most important operation in computer arithmetic. Many integer operations such as squaring, division and computing reciprocal require same order of time as multiplication whereas some other operations such as computing GCD and residue operation require at most a factor of time more than multiplication. We propose an integer multiplication algorithm using Nikhilam method of Vedic mathematics which can be used to multiply two binary numbers efficiently.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
