When you build a multiplier, you generate a mountain of partial products — a 32×32 multiply produces 32 rows that must all be summed. Wallace and Dadda trees reduce these rows using 3:2 counters (a.k.a. full adders): three input bits become a sum and a carry, reducing the row count by a factor of 3/2 per stage. But there's a smarter primitive: the 4:2 compressor.

A 4:2 compressor takes four bits of the same weight plus one carry-in from the neighboring column, and produces a sum, a carry-out (to the same column's next stage), and a carry to the next column. The key trick: the carry to the next column depends only on the four inputs, not on the carry-in. This breaks the horizontal ripple that would otherwise chain across the tree.

Internally it's two full adders, but the boolean structure is optimized. The classic implementation uses two XOR-3 gates on the critical path plus multiplexers for the carries. The result: a 4:2 compressor has a delay of roughly 3 XOR gates, versus 2 XOR gates for two cascaded 3:2 counters — but the compressor reduces four bits to two in one stage, while two cascaded 3:2s take two stages and add up to 4 XOR delays. Net win: fewer stages, lower depth, less wiring.

Real-world example: Intel's floating-point multipliers from the Pentium 4 onward used 4:2 compressor trees rather than pure Wallace trees. AMD's K10 FMA uses a mix of 4:2 and 3:2. ARM's Cortex-A76 multiplier is a 4:2 tree because it maps beautifully onto a regular layout — every compressor has the same footprint, so the physical design is a clean tiled array instead of the irregular jumble a Wallace tree produces.

Rule of thumb: for reducing N rows to 2:

• 3:2 counters need log_1.5(N/2) stages ≈ 8 stages for 32 rows
• 4:2 compressors need log₂(N/2) stages ≈ 4 stages for 32 rows

Half the depth, at the cost of ~40% more transistors per unit reduction. For any multiplier wider than 16 bits, the 4:2 wins on delay and on layout regularity, which is why it dominates modern designs.

The final two rows still need a fast carry-propagate adder — typically a Kogge-Stone or Ling adder — to produce the actual product. The compressor tree is the reduction; the CPA is the finish.