The prefix tree adder is useful in compound adder implementation. It is preferred over the ripple carry adder and the carry lookahead adder.

A fast carry-skip adder is proposed based on variable-sized two-level block carry-lookahead logic.