Next, the second partial product is determined by next three bits i.e. multiply by 2. Multiply by 2 means the multiplicand value has to shift left one bit. So, the second partial product is 001000100. Similarly the third partial product has to multiply by 1. So, the third partial product is the multiplicand value namely 000100010. The fourth partial product is determined by next three bits i.e. to multiply by -1. Multiply by -1 means the multiplicand has to convert to two’s complement value. So, the forth partial product is 111011110.
LSB of each block gives information about sign bit of the pervious block, and there are never any negative products before the least sgnificant block, so LSB of first block is …show more content…
In case where there are not enough bits to obtain the MSB of last block, multiplier is sign extended by one bit. Therefore Modified Booth
Multiplication is a technique that allows for smaller, faster circuits by recoding the numbers that are multiplied. It is a standard technique used in chip design, and provide significant improvement over long multiplication technique [6].
III. SOFTWARE DESIGN
Modified Booth Multiplier consist of three basic components namely Booth encoder (BE), Booth Selector
(BS) and adder tree summation. The basic operation of
Booth Encoder is to decode the multiplier signal and output will be used by booth selector to generate the partial product. Adder tree summation accumulates the entire partial product to produce the result. This method is explained in flow chart as