An Efficient Linear Interpolation Scheme
●3 commentsThis article presents a computationally-efficient linear interpolation trick that requires at most one multiply per output sample.
This article presents a computationally-efficient linear interpolation trick that requires at most one multiply per output sample.
Signal Processing R&D Engineers (2)
100% of our work is cutting-edge DSP
We are a small, high tech, sonar-processing company that develops state-of-the-art sonar, signal processing software systems used in naval aircraft.
Tasks:
* 60-75% signal processing algorithm development
* 25% real time code development in C++
Full relocation will be provided for the right candidate (e.g. relocation package up to $20,000).
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