2016
DOI: 10.18535/ijetst/v3i05.06
|View full text |Cite
|
Sign up to set email alerts
|

Design and implementation of 4-bit Vedic Multiplier

Abstract: Vedic mathematics is the name given to the ancient Indian system of mathematics that was rediscovered in the early twentieth century from ancient Indian sculptures (Vedas). This paper proposes the design of high speed Vedic Multiplier using the techniques of Vedic Mathematics that have been modified to improve performance .The need of high speed multiplier is increasing as the need of high speed processors are increasing . A Multiplier is one of the key hardware blocks in most fast processing system which is n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…From table 2, it can be seen that the area and power consumption using MUX based multiplier is less compared to other Vedic multipliers. Also the performance of Vedic multiplier is high compared to array multiplier or other multiplier architectures [8][9][10].…”
Section: B Results and Comparison With Existing Architecturementioning
confidence: 99%
“…From table 2, it can be seen that the area and power consumption using MUX based multiplier is less compared to other Vedic multipliers. Also the performance of Vedic multiplier is high compared to array multiplier or other multiplier architectures [8][9][10].…”
Section: B Results and Comparison With Existing Architecturementioning
confidence: 99%
“…We apply the proposed circuits into 4-bit array multiplier which consists of sixteen NANDs, sixteen buffers, six full adders and four half adders as shown in Fig. 12 [30,31,32]. A0 to A3 and B0 to B3 are input signals while P7 to P0 are the outputs.…”
Section: Bit Multipliermentioning
confidence: 99%
“…Multiplication plays a crucial role in Digital Signal Processing and for faster FFT we require a high speed multiplication block [6][7]. High speed multiplication block is implemented by using three main steps: first step: generation of partial products, second step: addition of partial product which is done with the help of adder and speed of the circuit is derived from this stage and in the last stage: final result is generated by adding two-row output.…”
Section: Multipliermentioning
confidence: 99%