Shift and add: a multiplier is a pile of shifted copies

Pick two 8-bit numbers and step through the partial products: one shifted copy of a for each 1 bit of b, summed row by row into the product.

This page sets no cookie and sends nothing anywhere.

Where the numbers come from

gHashTag/t27 specs/fpga/dsp/multipliers.t27 (t27#8985): every value on the page is its fn bodies, compiled to wasm (logic.js)
Harris and Harris, Digital Design and Computer Architecture, ch. 5: array multipliers