The Gateway to Computer Science Excellence
0 votes
198 views

Let's say we have a multiplier $ (10101010)_2 $. Then applying booth re-coding,

Method 1:

appending a zero at the end:  $ (1\ 0\ 1\ 0\ 1\ 0\ 1\ 0\ 0)_2 => (-1\ 1\ -1\ 1\ -1\ 1\ -1\ 0)_2$

Method 2:

without appending a zero at the end: $ (1\ 0\ 1\ 0\ 1\ 0\ 1\ 0)_2 => (-1\ 1\ -1\ 1\ -1\ 1\ -1)_2$

Which of the above method is correct?

Also, is the following condition true?

#multiplier bits must be equal to #multiplicand bits

Please don't give any ref link because I've already searched but didn't got my doubt cleared. 

closed with the note: Doubt cleared
in Digital Logic by Boss (10.7k points)
closed by | 198 views

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,397 answers
198,610 comments
105,454 users