From: Theoretical lower bounds for parallel pipelined shift-and-add constant multiplications with n-input arithmetic operators
Constant
R-operations n = 2
R-operations n = 3
LSCM [3]
LSCM [4]
LPSCM
11,467
3
4
5
11,093
13,003