Open AccessFast signed multiplier using Vedic Nikhilam algorithm
Author(s) -
Sahu Satya Ranjan,
Bhoi Bandan Kumar,
Pradhan Manoranjan
Publication year - 2020
Publication title -
iet circuits, devices and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.251
H-Index - 49
eISSN - 1751-8598
pISSN - 1751-858X
DOI - 10.1049/iet-cds.2019.0537
Subject(s) - operand , multiplier (economics) , arithmetic , binary number , multiplication (music) , adder , multiplication algorithm , algorithm , computer science , decimal , field programmable gate array , parallel computing , software , speedup , mathematics , computer hardware , combinatorics , programming language , telecommunications , economics , macroeconomics , latency (audio)
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.