I was watching some lecture on algorithms, and the professor used multiplication as an example of how naive algorithms can be improved...
It made me realize that mul
Mitch Alsup (who worked on Motorola 88K, Ross SPARC, AMD x86, etc.) has stated on the comp.arch newsgroup:
All modern multiplier designers use the Dadda method for building the tree.
(Message-ID:
and (with respect to availability of recent references for what multiplication mechanisms are used by AMD/Intel/NVIDIA):
Only in the patent office.
(Message-ID:
See Wikipedia for information on Dadda tree multipliers.