An Efficient Linear Interpolation Scheme
●1 commentThis article presents a computationally-efficient linear interpolation trick that requires at most one multiply per output sample.
Comments:
Sorry, you need javascript enabled to post any comments.
This article presents a computationally-efficient linear interpolation trick that requires at most one multiply per output sample.
In the article, the author stated that:
" ...
That mysterious block labeled 'Zero-Order Hold' is merely the operation where
each u(k) input sample is repeated L–1 times. For example, if L = 3 and the
input to the Zero-Order Hold operation is {1,-4,3}, the output of the process
is {1,1,1,-4,-4,-4,3,3,3}."
Shouldn't the content of the resulting array be {1, 1, -4, -4, 3, 3}, i.e. repeat every member twice?
Sorry for my ignorance.
Regards