Fig. 7From: Theoretical lower bounds for parallel pipelined shift-and-add constant multiplications with n-input arithmetic operatorsThe pipelined completely multiplicative graph achieves n p non-zero digits with the minimum number of n-input R-operations, p, and the minimum number of depth levels, p Back to article page