This paper extends the column reduction techniques for high speed
computer multiplication beyond operating upon two operands. It presents
a straight forward approach for using column reduction to simultaneously
multiply “n” operands, with a resulting significant reduction in
overall delay as compared to multiple multiplications required for more
than two operands.