The Gateway to Computer Science Excellence

0 votes

I know the working of booths algorithm.

Suppose we have multiplicand M = 01011

and multiplier Q = 01110

We can write Q as (2^4 - 2^1).

So multiplication reduces to 2^4(M) + 2(-M)

Now booths algorithm rules are:-

If Q = 0 and Q(-1)=0 then do arithmetic right shift.

If Q = 1 and Q(-1)=0 then do A-M and arithmetic right shift.

If Q = 0 and Q(-1)=1 then do A+M and arithmetic right shift.

If Q = 1 and Q(-1)=1 then do arithmetic right shift.

Here A is initialized to 00000 and Q(-1) is initialized to 0.

If we see the algorithm then in every step we do right shifting. But as per the calculation shown above which is 2^4(M) + 2(-M) we multiply by 16 and 2 which requires left shift.

So how is booths algorithm working with right shift ?

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,281 answers

198,178 comments

104,842 users