can be reduced by choosing k, the number of positions
not implemented, and by adding a suitable constant to the reduction array. This
approach and several others are discussed in detail in the literature mentioned at
the end of the chapter.
Rectangular Multipliers
The multipliers discussed up to now had both operands with the same number of
bits (square multipliers). In many applications the multiplication operands have
different number of bits (say, k and n). These multipliers are called
rectangular
multipliers.
The implementation of these rectangular multipliers follows the same
approach ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.