Professional Documents
Culture Documents
Naga
Naga
Naga
MULTIPLIER
BATCH-C3:
UNDER THE GUIDANCE OF:
P.NAGARJUNA
Dr.P.Suresh Kumar M.Tech..,Ph.D.
Y19EC151
Associate Professor
CONTENTS:
➢ Abstract
➢ Aim
➢ Objective
➢ Introduction
➢ Literature Survey
➢ Existing Methods
➢ Proposed Methodology
➢ Tool And It’s Features
➢ References
2
Abstract:
• This project anticipate the design of a novel Vedic multiplier using the
techniques of Ancient Indian Vedic Mathematics that have been modified
to improve performance.
4
OBJECTIVE:
5
Introduction:
7
➢ The process of multiplication by using Urdhva Tiryagbhyam
sutra is as follows, First step is to multiply the first digit that
is left hand most digit of multiplicand with first digit of
multiplier. The product is written as first digit in the answer.
➢ In second step multiply second digit of multiplicand with first
digit of the multiplier and first digit of the multiplicand with
second digit of multiplier, add the product.
➢ The result is written as second digit in the answer.
➢ Third step is to multiply second digit of multiplicand with
second digit of multiplier, write the product as third digit in
the answer 8
EXAMPLE:
9
LITERATURE SURVEY:
1) Raj Kumari, Rajesh Mehra, “Power and Delay Analysis of CMOS Multipliers Using
Vedic Algorithm”, 1st IEEE ICPEICES-2016.
2)Dravik Kishor Bhai Kahar, Harsha Mehta, “High-Speed Vedic Multiplier using Vedic
Mathematics”, ICICCS, 2017
10
EXISTING METHOD:
➢ But the limitation associated with ripple carry adder is that, the
sum and carry outputs of a stage will depend on the carry output
from the previous stage.
12
PROPOSED METHODOLOGY:
➢ In the latter adder, the output from a stage depends only on the
input carry, Cin and not on the carry outputs from the previous
stages.
13
Fig. 3: Block diagram of proposed 8x8 Vedic Multiplier
14
Block diagram of 4 bit Vedic multiplier:
15
Special adder:
➢ In the figure A,B,C,D are four inputs.C0 and C1 are LSB and MSB of
carry outputs respectively and Sum is the sum of four inputs.
➢ The Boolean expressions for the same are given below.
➢ Sum= A XOR B XOR C XOR D
➢ C0= ((NOT B) AND D)OR (C AND (NOT D))OR (B AND (NOT C))
➢ C1= A AND B AND C AND D.
16
Tool Used:
17
Features of Xilinx:
❖ The easiest, lowest cost way to get started with the industry
leader for productivity, performance, and power
20