On the study of logarithmic time parallel adders

This work formulates a set of equations to describe logarithmic time parallel adders. The equations can be used to explain several popular fast adder schemes and derive new adder schemes easily. It is shown that if there is an adder constructed from the conditional-sum rule, then we can always obtain another adder based on the carry-lookahead rule with equivalent topology and structure, and vice versa.