Skip to main content
EURASIP Journal on Advances in Signal Processing

Table 2 Percentage of constants with improved lower bounds

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

Word length

LSCM [3]

LSCM [4]

B = 14 bits

54%

45%

14 < B ≤ 32

63%

55%

Back to article page