Vedic and conventional methods of N × N Binary Multiplication with hardware implementation
Pranav Patel, Ashish Shandilya, Nisarg Brahmbhatt, Kshitij Raval, Dipankar Deb
Abstract
Pranav Patel, Ashish Shandilya, Nisarg Brahmbhatt, Kshitij Raval, Dipankar Deb
Abstract
A comparative study of the resources involved in the Multiplication of two N-Bit binary numbers is performed using a Vedic Multiplication and the Modern Binary Multiplication techniques. A generic Vedic method for N × N Binary Multiplication is presented. From first principles, using logic gates, an N × N Binary Multiplication is performed using both the methods for different number of bits, using Transistor Transistor Logic (TTL) gates. It is found that the propagation delay encountered while using the Vedic Multiplication technique is lesser, more so when the size of multiplication is more. Additionally, Nikhilam Sutra is presented for Multiplication of large binary numbers close to a chosen base and comments are made as to how such Multiplication are effectively reduced to Multiplication of smaller numbers.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A comparative study of the resources involved in the Multiplication of two N-Bit binary numbers is performed using a Vedic Multiplication and the Modern Binary Multiplication techniques. A generic Vedic method for N × N Binary Multiplication is presented. From first principles, using logic gates, an N × N Binary Multiplication is performed using both the methods for different number of bits, using Transistor Transistor Logic (TTL) gates. It is found that the propagation delay encountered while using the Vedic Multiplication technique is lesser, more so when the size of multiplication is more. Additionally, Nikhilam Sutra is presented for Multiplication of large binary numbers close to a chosen base and comments are made as to how such Multiplication are effectively reduced to Multiplication of smaller numbers.
Key concepts: Multiplication (music), Binary number, Multiplication algorithm, Arithmetic, Binary operation, Computer science, Mathematics, Discrete mathematics