In binary multiplication, reduction of summands refers to a class of fast multiplication approaches in which a matrix of partial products (summands) is first generated and then compressed through a sequence of reduction stages until only two rows remain. These two rows are subsequently combined using a fast parallel adder to produce the final result.
In binary multiplication, reduction of summands refers to a class of fast multiplication approaches in which a matrix of partial products (summands) is first generated and then compressed through a sequence of reduction stages until only two rows remain. These two rows are subsequently combined using a fast parallel adder to produce the final result.
Source: Wikipedia "Reduction of summands" · CC BY-SA 4.0
Share this article: X · Bluesky