What are the common methods for implementing binary multiplication?

Binary multiplication methods include: Array multiplier (straightforward AND-and-add structure, regular layout but large area and long delay), Wallace tree (reduces partial products in parallel using carry-save adders, faster but irregular structure), Booth encoding (reduces number of partial products by recoding multiplier, handling signed multiplication efficiently), and Booth-Wallace combination (high-performance multipliers). Trade-offs involve area, speed, power, and design complexity. Modern processors use variants of Booth-encoded Wallace tree multipliers.