This paper presents an extension to the theoretical lower bounds for the number of adders and for the adder depth in multiplierless single constant multiplications (SCM). It is shown that the number of prime factors of the constants is key information to extend the current lower bounds in certain cases that have not yet been exposed. Additionally, the hidden theoretical lower bound for the number of adders required to preserve the minimum adder depth is revealed.
['David E Troncoso Romero', 'Uwe Meyer-Baese', 'Gordana Jovanovic Dolecek']
On the inclusion of prime factors to calculate the theoretical lower bounds in multiplierless single constant multiplications