Features of Truncated-Taylor Lagrange-Interpolation

• Computational Complexity = $3N-1$ multiplies and $3N-2$ additions for $N$ th-order interpolation
• If multiplication factors for a given delay $\Delta=k-t$ are stored in memory, then the complexity reduces to $N$ multiplies and $2N-2$ adds per output sample (multiplies comparable to a plain FIR interpolator, but additions are $\approx$ doubled)
• Interpolation order can be increased or decreased by modularly adding/deleting sections on the right