Abstract
We present a very simple and fast algorithm to compute the convolution of an arbitrary sequence x with a sequence of a specific type, a. The sequence a is any linear combination of polynomials, exponentials and trigonometric terms. The number of steps for computing the convolution depends on a certain complexity of a and not on its length, thus making it feasible to convolve a sequence with very large kernels fast.
| Original language | English |
|---|---|
| Number of pages | 2 |
| Journal | Journal of WSCG |
| Volume | 11 |
| Issue number | 1 |
| State | Published - 2003 |
| Event | 11th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, WSCG 2003 - University of West Bohemia, Campus Bory, Plzen, Czech Republic Duration: 3 Feb 2003 → 7 Feb 2003 Conference number: 11 http://wscg.zcu.cz/wscg2003/wscg_program.htm |