From: Theoretical lower bounds for parallel pipelined shift-and-add constant multiplications with n-input arithmetic operators
Algorithm
R-operations
Hcub ADmin (method [30] with additional pipelining)
7
PAG using ASAP pipelining (preliminary solution from [8])
Optimal PAG (method [8])
5
LMCM [3]
3
LPMCM
4
