Fig. 13From: Theoretical lower bounds for parallel pipelined shift-and-add constant multiplications with n-input arithmetic operators a Two-input adder graph by PAG algorithm for the multiplier block {87,381; 689,493} and b three-input adder graph by PAG algorithm for the multiplier block {87,381; 689,493}Back to article page