Fast signed multiplier using Vedic Nikhilam algorithm

12Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

Vedic algorithm is beneficial for the application in the design of high-speed computing and hardware. This study presents a fast signed binary multiplication structure based on Vedic Nikhilam algorithm. The authors explored the Nikhilam sutra for unsigned decimal numbers to both signed decimal and binary operands. The proposed multiplier leads to significant gains in speed by converting a large operand multiplication to small operand multiplication, along with addition. The proposed design is synthesised with Xilinx ISE 14.4 software and realised using different field programmable gate array devices. The efficiency of the proposed design depends on combinational delay, area and power. Moreover, the new multiplier architecture achieves speed improvement over prior design.

Cite

CITATION STYLE

APA

Sahu, S. R., Bhoi, B. K., & Pradhan, M. (2020). Fast signed multiplier using Vedic Nikhilam algorithm. IET Circuits, Devices and Systems, 14(8), 1160–1166. https://doi.org/10.1049/iet-cds.2019.0537

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free