Polynomial evaluation of Estrin complexity

The Estrin polynomial model is well known. But reading the Knuth (Vol 2) or the original paper Estrin does not help (or I miss it). I am not able to determine the complexity of the algorithm for the multiplication number

For addition: n
For multiplication: could be n + low_floor (log2 (n))

Anyone can confirm?

Better,

++ t