Scribd
Upload
33 views3 pages

Shift and Add Multiplication

Uploaded by

kakkarg03
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views3 pages

Shift and Add Multiplication

Uploaded by

kakkarg03
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Multiplication using Shift and Add algorithm (Unsigned binary number

representation)

Shift-and-add multiplication is similar to the multiplication performed by paper and pencil. This
method adds the multiplicand M to Q , where Q denotes the multiplier. As an example, consider
the multiplication of two unsigned 4-bit numbers, 8 (1000) and 9 (1001).

Multiplicand 1000 × Multiplier 1001

Multiply Operation

Multiplicand in M
Multiplier in Q

A← 0,
C← 0,
Count ← n

=1
Q0 = ?
A=A+M
=0
Shift Right
CAQ
Count=Count-1

No Yes
Count=0 END

Figure 1: Flowchart for Shift and Add algorithm


EXAMPLE:- 2 *3

2=Multiplicand (0010) [M]

3= Multiplier (0011) [Q][Q3,Q2,Q1,Q0]

A= Accumulator

Count C A Q M Remark
(n) (3)[Q3,Q2,Q1,Q0]
4 0 0000 0011 0010 Initialization
0 0010 0011 0010 A=A+M
0 0001 0001 0010 SHIFT RIGHT

3 0 0011 0001 0010 A=A+M


0 0001 1000 0010 SHIFT RIGHT

2 0 0000 1100 0010 SHIFT RIGHT

1 0 0000 0110 0010 SHIFT RIGHT


0 00000110 Result
4*3= M=4= 0100 Q=3= 0011

Count C A Q M Remark
(n) (3)[Q3,Q2,Q1,Q0]
4 0 0000 0011 0100 Initial
0 0100 0011 0100 A=A+M
0 0010 0001 0100 Shift right

3 0 0110 0001 0100 A=A+M


0 0011 0000 0100 Shift right
2 0 0001 1000 0100 Shift right

1 0 0000 1100 0100 Shift right


0 00001100 Result

Video Lecture link:-

https://www.youtube.com/watch?v=U62iP8RkZIk&t=230s

You might also like