Skip to main content

Table 3 Number of R-operations for Example 1 using n = 2 and n = 3 input adders

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

LPSCM

11,467

3

4

5

3

11,093

3

4

5

3

13,003

3

4

5

3