Skip to main content

Table 5 Resulting R-operations for Example 3 using n = 2 input adders

From: Theoretical lower bounds for parallel pipelined shift-and-add constant multiplications with n-input arithmetic operators

Algorithm

R-operations

RAG-n (method [36] with additional pipelining)

13

RSG (method [22])

7

OFL (method [7])

6

LMCM [3]

4

LPMCM

6