Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements

Complements and signed digit representations: Analysis of a multi-exponentiation-algorithm of Wu, Lou, Lai and Chang

“…By construction, there is some dependence between the bits, as at most half of them can be equal to 1. Next, the claimed probabilities 3/4 and 1/4 are incorrect, this has also been discussed in detail by Yen, Lien and Moon [18] while correcting erroneous claims in [3].…”