-1
\$\begingroup\$

The below diagram is the parallel MAC structure. In parallel MAC both partial product addition and accumulation take place at same time.
enter image description here

The partial product summation + accumulation unit of above parallel mac is given below. http://i.imgur.com/Jd8WIyD.jpg (link to the image). enter image description here

My problem : When I give input to multiplier as 00000101(5) and 00001000(8) what will be the values produced(P0[7:0],P1[7:0],P2[7:0],P3[7:0] And S0,S1,S2,S3 And N0,N1,N2,N3) that can be used as input of partial product generation + accumulation stage.

Normally by modified booth algorithm partial products generated will be of length 16 bit for 8 bit multiplication operation.Here partial products are of 10 bit.How it will give final correct answer?

The complete document is shared below.
http://www.mediafire.com/view/zoh8zuand88zkqx/05337888_2.pdf

Please share your ideas.I need to continue my project based on your replies.
Thanks.

\$\endgroup\$
3
  • \$\begingroup\$ Why didn't you analyse this algorithm by yourself to find out how it works? \$\endgroup\$
    – Qiu
    Nov 1 '14 at 9:07
  • \$\begingroup\$ Sorry ..searched the entire internet but the partial products generated after booth multiplication is about 16 bit long, but here each partial product is 8 bit long? Also I dont know what is the value of N0,N1,N2,N3,S0,S1,S2,S3 in each multiplication operation. \$\endgroup\$
    – Jithin
    Nov 1 '14 at 12:13
  • \$\begingroup\$ Another document,this also not telling about 8 bit partial products. mediafire.com/view/1mkabhhraxt6m96/00868458_3.pdf \$\endgroup\$
    – Jithin
    Nov 2 '14 at 5:27
0
\$\begingroup\$

If you multiply two eight-bit numbers, the partial products will in general be single bits. However, assuming a row-based structure there will be eight rows of eight bits each, where each row is either 00000000 or the other input.

With modified Booth encoding there will be four rows. However, as each row now will be -2, -1, 0, 1, or 2 times the other input, at least one more bit is needed (it is not obvious if your multiplier is expected to handle signed inputs and depending on how you handle the signs you may have to add another bit).

Now, check a table for modified Booth encoding and encode one of your inputs, say 00000101(5). As this is pretty simple the corresponding encoded value will be the same, but radix-4, so 0 0 1 1, then the two least significant rows will be 00001000 and the other two will be 00000000.

The S and N things are not obvious from a quick peek (as I do not have time to check the diagram in detail). However, N is most likely used if you should multiply with a negative partial product. Instead of computing the "correct" negative number by inverting and adding a one to the LSB position, you simply invert and add the one as N, so if the least significant digit would be Booth encoded to -1, you would get a partial product row as 11110111(-9) and the corresponding N being 1, instead of first computing 11111000(-8) requiring an adder. For S, it is probably the compensation vector. To add two's complement numbers, which the partial product rows will be as they can be negative, they would in general have to be the same length. However, using some clever tricks (mainly noting that the sign-bit has a negative weight, using \$-b = \bar{b} -1\$, and merging the -1 parts), it is possible to avoid explicit sign-extension.

\$\endgroup\$
1
  • \$\begingroup\$ Can you explain in detail how they are avoiding explicit sign-extension? \$\endgroup\$
    – Jithin
    Nov 22 '14 at 16:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.