Design and Implementation of Vedic Multiplier
Akshay Savji, Shruti Oza
Abstract
Akshay Savji, Shruti Oza
Abstract
The ancient vedic mathematics has a set of 16 sutras and 13 subsutras. These sutras give suitable method for arithmetic calculations. The vedic formulas requires less time than the regular formulas or method of calculations [1]. Multiplier is an important block in many digital systems. This paper presents a 32-bit vedic multiplier using Urdhva Tiryagbhyam sutra of ancient vedic mathematics. The 32-bit vedic multiplier is implemented using 16-bit multipliers and adders. The 16-bit multipliers are basic blocks in the design by which the input bits are multiplied and their result are added by using the adders. The vedic multiplier can be used in many fast computing processors because of their less time delay and less number of slice LUTs. The result discusses the delay and number of slice LUTs for the implemented 32-bit multiplier. The paper also discusses the methodology of implementation.
OpenAlex reports 49 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.
The ancient vedic mathematics has a set of 16 sutras and 13 subsutras. These sutras give suitable method for arithmetic calculations. The vedic formulas requires less time than the regular formulas or method of calculations [1]. Multiplier is an important block in many digital systems. This paper presents a 32-bit vedic multiplier using Urdhva Tiryagbhyam sutra of ancient vedic mathematics. The 32-bit vedic multiplier is implemented using 16-bit multipliers and adders. The 16-bit multipliers are basic blocks in the design by which the input bits are multiplied and their result are added by using the adders. The vedic multiplier can be used in many fast computing processors because of their less time delay and less number of slice LUTs. The result discusses the delay and number of slice LUTs for the implemented 32-bit multiplier. The paper also discusses the methodology of implementation.
Key concepts: Multiplier (economics), Adder, Arithmetic, Mathematics, 4-bit, Computer science, Electronic engineering, CMOS