Design of an Efficient Binary Vedic Multiplier for High Speed Applications Using Vedic Mathematics with Bit Reduction Technique - Circuits and Systems

CS > Vol.7 No.9, July 2016

Volume 7, Issue 9 (July 2016)

ISSN Print: 2153-1285 ISSN Online: 2153-1293

Google-based Impact Factor: 0.48 Citations

Design of an Efficient Binary Vedic Multiplier for High Speed Applications Using Vedic Mathematics with Bit Reduction Technique ()

HTML XML

Download as PDF (Size: 554KB) PP. 2593-2602

DOI: 10.4236/cs.2016.79224 2,159 Downloads 4,726 Views Citations

Author(s)

S. K. Manikandan¹, C. Palanisamy²

Affiliation(s)

¹Department of EEE, Velalar College of Engineering and Technology, Erode, India.
²Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam, India.

ABSTRACT

Vedic mathematics is the system of mathematics followed in ancient Indian and it is applied in various mathematical branches. The word “Vedic” represents the storehouse of all knowledge. Because using Vedic Mathematics, the arithmetical problems are solved easily. The mathematical algorithms are formed from 16 sutras and 13 up-sutras. But there are some limitations in each sutra. Here, two sutras Nikhilam sutra and Karatsuba algorithm are considered. In this research paper, a novel algorithm for binary multiplication based on Vedic mathematics is designed using bit reduction technique. Though Nikhilam sutra is used for multiplication, it is not used in all applications. Because it is special in multiplication. The remainder is derived from this sutra by reducing the remainder bit size to N-2 bit. Here, the number of bits of the remainder is constantly maintained as N-2 bits. By using Karatsuba algorithm, the overall structure of the multiplier is designed. Unlike the conventional Karatsuba algorithm, the proposed algorithm requires only one multiplier with N-2 bits only. The speed of the proposed algorithm is improved with balancing the area and the power. Even though there is a deviation in lower order bits, this method shows larger difference in higher bit lengths.

KEYWORDS

Karatsuba, Nikhilam Sutra, Bit Reduction, Remainder, Multipliers

Share and Cite:

Manikandan, S. and Palanisamy, C. (2016) Design of an Efficient Binary Vedic Multiplier for High Speed Applications Using Vedic Mathematics with Bit Reduction Technique. Circuits and Systems, 7, 2593-2602. doi: 10.4236/cs.2016.79224.

Cited by

[1]	Comparative analysis of Yavadunam Tavadunikrtya Varganca Yojayet Vedic multiplier for embedded DNN
	Sādhanā, 2022

[2]	Booth-Encoded Karatsuba: A Novel Hardware-Efficient Multiplier
	Advances in Electrical and Electronic …, 2021

[3]	An Efficient, Buzzword Explanation of Vedic Mathematics Sutras
	2021

[4]	Review of Vedic Multiplier Using Various Full Adders
	2021

[5]	Speed, power and area efficient 2D FIR digital filter using vedic multiplier with predictor and reusable logic
	2021

[6]	Design and investigation of low-complexity Anurupyena Vedic multiplier for machine learning applications
	2020

[7]	Squaring using Vedic mathematics and its architectures: a survey
	International Journal of Intellectual Advancements and Research in Engineering Computations, 2018

[8]	Design of a High-Speed, Low-Power, Area-Efficient 8-bit Vedic Multiplier Using Urdhva-Tiryagbhyam Theorem & Modified GDI Cells
	2017

[9]	Design of high speed, Low power, area efficient 8-Bit Vedic multiplier using Urdhva Tiryagbhyam theorem and modified GDI Cells
	2017

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies