Abstract
A multiplier is described which uses a ‘tree’ of adders to add the partial products, resulting in a considerable increase in speed when the adders have a carry-propagation delay per bit which is appreciably less than the addition delay.

This publication has 0 references indexed in Scilit: