Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
14K views

Bit Pair Recoding

Bit-pair recoding halves the number of summands needed for multiplication by recoding the multiplier bits. It works by recoding pairs of bits in the multiplier and selecting the appropriate version of the multiplicand based on the bit pair values. This allows the multiplication to be performed with only n/2 summands, rather than n summands as in standard multiplication methods.

Uploaded by

Connor Holmes
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
14K views

Bit Pair Recoding

Bit-pair recoding halves the number of summands needed for multiplication by recoding the multiplier bits. It works by recoding pairs of bits in the multiplier and selecting the appropriate version of the multiplicand based on the bit pair values. This allows the multiplication to be performed with only n/2 summands, rather than n summands as in standard multiplication methods.

Uploaded by

Connor Holmes
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Fast Multiplication

Bit-Pair Recoding of Multipliers

Bit-Pair Recoding of Multipliers


Bit-pair recoding halves the maximum number of summands (versions of the multiplicand).
Sign extension 1 1 1 0 1 0 0 Implied 0 to right of LSB

1 +1 1

(a) Example of bit-pair recoding derived from Booth recoding

Bit-Pair Recoding of Multipliers


Multiplier bit-pair i +1 0 0 0 0 1 1 1 1 i 0 0 1 1 0 0 1 1 Multiplier bit on the right i 1 0 1 0 1 0 1 0 1 Multiplicand selected at position i 0 +1 +1 +2 2 1 1 0 M M M M M M M M

(b) Table of multiplicand selection decisions

Bit-Pair Recoding of Multipliers


0 1 1 0 1 0 - 1 +1 - 1 0 0 1 0 1 0 0 1 0 1 0 0 1 0 1 0 0 1 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 1 1

0 1 1 0 1 ( + 13) 1 1 0 1 0 (- 6 )

1 1 1 0 1 1 0 0 1 0 ( - 78)

0 1 1 0 1 -1 -2 0 1 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 0 0 0 0 0 1 1 1 0 1 1 0 0 1 0
4

Multiplication requiring only n/2 summands.

You might also like