scispace - formally typeset
Proceedings ArticleDOI

Design of an efficient vedic binary squaring circuit

Reads0
Chats0
TLDR
A comparative study of the projected architecture and the prevailing multipliers, on the premise of delay and space utilization is presented and the simulation outcome proves that the design projected employing Nikhilam sutra improves the performance significantly.
Abstract
High speed and less area have always been a major concern in VLSI design. With this as a constraint, in this paper a dedicated architecture which is exclusively used for squaring operation has been proposed. Squaring plays a vital role in many signal processing applications and probabilistic analysis in communication systems, where, quite often general multipliers are used although squaring has to be done. This unnecessarily increases the area of the design and also increases the computation time. The principles of Nikhilam Sutra have been leveraged and is extended for squaring binary bits. A comparative study of the projected architecture and the prevailing multipliers, on the premise of delay and space utilization is presented. The simulation outcome proves that the design projected employing Nikhilam sutra improves the performance significantly. The 8-bit architecture has been developed by Verilog HDL and the synthesis is completed using Xilinx ISE - 14.5 software.

read more

References
More filters
Proceedings ArticleDOI

Implementation of vedic multiplier using Kogge-stone adder

TL;DR: A novel architecture to perform high speed multiplication using ancient vedic mathematics named as Urdhva Triyakbhyam strikes a difference in the actual multiplication process using verilog HDL.
Proceedings ArticleDOI

An Efficient Multiplication Algorithm Using Nikhilam Method

TL;DR: An integer multiplication algorithm using Nikhilam method of Vedic mathematics which can be used to multiply two binary numbers efficiently is proposed.
Proceedings ArticleDOI

An Efficient Multiplication Algorithm using Nikhilam Method

TL;DR: In this article, an integer multiplication algorithm using Nikhilam method of Vedic mathematics is proposed which can be used to multiply two binary numbers efficiently, which is one of the most important operation in computer arithmetic.
Proceedings ArticleDOI

VLSI design of high speed Vedic Multiplier for FPGA implementation

TL;DR: A novel architecture for implementation of signed multiplication using the vedic algorithm is proposed and an 11×8 bit multiplier was designed using the proposed architecture and implemented using Xilinx ISE Design Suite 13.2 with Spartan 3E as the target FPGA.
Proceedings ArticleDOI

A review on various multipliers designs in VLSI

TL;DR: In this article, the authors studied the performance of various multipliers, including Array multiplier, Wallace tree multiplier, Bypassing multiplier, Modified Booth multiplier, Vedic multiplier and Booth recorded Wallace tree multipliers.