Page 1 of 9
Journal for Studies in Management and Planning
Available at
http://edupediapublications.org/journals/index.php/JSMaP/
ISSN: 2395-0463
Volume 03 Issue 12
November 2017
Available online: http://edupediapublications.org/journals/index.php/JSMaP/ P a g e | 349
Redundant Binary Multiplier with Modified Partial Product
Generator
1.TASLEEMA SULTHANA, 2.CH ANIL KUMAR
1.Pg Scholar, Department of ECE, Vaagdevi College of Engineering, Bollikunta Warangal,
Telangana
2.Assosciate Professor, Department of ECE, Vaagdevi College of Engineering, Bollikunta
Warangal, Telangana
ABSTRACT
The requirement of the modern computer
system is a dedicated and very high speed
unique multiplier unit for signed and
unsigned numbers. The work mainly deals
with in improving multiplication process by
using Redundant Binary Technique.The
redundant binary in design of high speed
digital multiplier is beneficial due to high
modularity and carry free addition.
Generally,in high radix modified booth
encoding algorithm the partial products are
reduced in multiplication process. But it
yields complexity in producing in generation
of hard multiples.Therefore booth encoding
scheme along with redundant binary scheme
solves this problem by using booth
encoding, RB partial product generator,RB
partial product accumulator,RB to NB
converter stage.In this paper implemented in
Verilog HDL
I INTRODUCTION
The nature of the work is introduced to
improve the speed of the multiplier and to
remove the hard multiples and to reduce the
partial products than previous work. By
improving the multipliers in the ALU
processors from past to present they are
giving better results comparing to previous
improvements. So, now introducing the
Redundant Binary Representation technique
in digital multipliers to overcome drawbacks
in previous techniques. Redundant Binary
(RB) representations first introduced by
Avizienis in 1961 for fast parallel
arithmetic. This new Arithmetic was applied
for fast Multiplication by takagi and
implemented by Edamatsu. Multiplication is
a most commonly used operation in many
computing systems. Infact multiplication is
Page 2 of 9
Journal for Studies in Management and Planning
Available at
http://edupediapublications.org/journals/index.php/JSMaP/
ISSN: 2395-0463
Volume 03 Issue 12
November 2017
Available online: http://edupediapublications.org/journals/index.php/JSMaP/ P a g e | 350
nothing but addition since, multiplicand
adds to itself multiplier number of times
gives the multiplication value between
multiplier and multiplicand. But considering
the fact that this kind of implementation
really takes huge hardware resources and the
circuit operates at utterly low speed. In order
to address this so many ideas have been
presented so far for the last three decades.
Each one is aimed at particular improvement
according to the requirement. One may be
aimed at high clock speeds and another
maybe aimed for low power or less area
occupation. Either way ultimate job is to
come up with an efficient architecture which
can address three constraints of VLSI speed,
area, and power. Among these three speeds
is the one which requires special attention. If
we observe closely multiplication operation
involves two steps one is producing partial
products and adding these partial products.
Thus, the speed of a multiplier hardly
depends on how fast generate the partial
products and how fast we can add them
together. If the numbers of partial products
to be generated are of less than it is
indirectly means that we have achieved the
speed in generating partial products. Booth‟s
algorithms are meant for this only. To speed
up the addition among the partial products
we need fast adder architectures. Since the
multipliers have a significant impact on the
performance of the entire system, many high
performance algorithms and architectures
have been proposed.
II PROPOSED SYSTEM
In Multiplier and Accumulation structure the
multiplier can be divided into four operation
steps. First step- booth algorithm, second
step – partial product summation, third step
– final addition, fourth step – accumulation
as shown in Fig1. Step 1: Multiplication
process done between n bits Multiplicand
(X) and m bits Multiplier (Y). Step 2: n bits
Partial products (P0~Pj) will be generated
after multiplying n bits and m bits. Step 3:
Final addition between Partial products
Summation (S) bits and Carry(C) bits.
Step4: Accumulation results takes place
between multiplication results(X*Y) and
finally will get Accumulation Result (Z).
III. ALGORITHM OF THE
MULTIPLIER A. Radix - 4 Modified
Booth Encoding (Radix-4) can effectively
be applied to reduce the number of partial
product rows to half in parallel multipliers.
This is performed by grouping three
Page 3 of 9
Journal for Studies in Management and Planning
Available at
http://edupediapublications.org/journals/index.php/JSMaP/
ISSN: 2395-0463
Volume 03 Issue 12
November 2017
Available online: http://edupediapublications.org/journals/index.php/JSMaP/ P a g e | 351
adjacent multiplier bits (B = bn-1 bn-2...b0)
to select one of the signed multiples as
shown in Table I. The side bits of each
group are overlapped with the two adjacent
groups. The lastbit in each group is referred
as reference bit. The first group is coded by
adding “0” as reference bit prior to least
significant bit position i.e., (b1, b0,
0).Depending on these select signals, the
partial product rows are generated by
selecting one of the combination {-2A,-A, 0,
A, 2A} of the multiplicand (A = an-1an- 2...a0). The twice of multiplicand (2A) in
Table I is obtained by left shifting the
multiplicand by one bit position and
negation operation is achieved by inverting
each bit of multiplicand ( i.e. one‟s
complement) and adding “1” to its least
significant bit position.
The Multiplier uses a Redundant
binary representation, which is one of the
signed digit representation proposed
byAvizienis to perform fast parallel
arithmetic. It has a fixedradix-2 and as a
digit set, where , represents -1. In redundant
binary representation, a number can be
expressed as (2) which is similar to 2‟s
complement representation of a number,
except that can take “ ”as value. Two
Normal Binary digits can be coded to form a
RB digit as shown in Table 2. The coding
scheme for RB representation is given as (3)
Where, + and - are represented in 2‟s
complement form. This coding scheme can
be applied to represent a RB numberas the
summation of two NB numbers in one
simple step. This is elaborated by
thefollowing expressions. The summation of
two NB numbers Xand Y can be represented
as (4) Implementation of Modified Partial
Product Generator using Booth Encoding
Algorithm In Redundant Binary Multipliers
International Journal of Innovative
Technologies Volume.05, Issue No.04,
April-2017, Pages: 0700-0705 In two‟s
complement representation; -Y can be
obtained by reversing all bits of Y and then
adding “1” to its least significant bit
position. This process is explained as
follows: (5) Where is obtained by reversing
all bits of Y. By Substituting above
equations summation of two NB number can
be expressed as (6) Let, xi and yi be the ith
digits of X and Y respectively. Also we
define (7) Where , is the inversion of yi .
The term xi - , will take one of the three
values 1, 0, or , Instead of using the signed
and absolute value representation, in this
