Next |
Prev |
Up |
Top
|
Index |
JOS Index |
JOS Pubs |
JOS Home |
Search
Note that by factoring out
, we can obtain a one-multiply
form,
Thus, the computational complexity of linear interpolation is one
multiply and two additions per sample of output.
Next |
Prev |
Up |
Top
|
Index |
JOS Index |
JOS Pubs |
JOS Home |
Search
[How to cite this work] [Order a printed hardcopy] [Comment on this page via email]