Fig. 9From: Theoretical lower bounds for parallel pipelined shift-and-add constant multiplications with n-input arithmetic operatorsNon-multiplicative graph that generates the maximum number of non-zero digits, n p, with the minimum number of R-operations in non-multiplicative graphsBack to article page