| Title: | Fast convolution |
| Authors: | Werman, Michael |
| Citation: | Journal of WSCG. 2003, vol. 11, no. 1-3. |
| Issue Date: | 2003 |
| Publisher: | UNION Agency – Science Press |
| Document type: | článek article |
| URI: | http://wscg.zcu.cz/wscg2003/Papers_2003/D13.pdf http://hdl.handle.net/11025/1640 |
| ISSN: | 1213-6972 |
| Keywords: | rychlá konvoluce;rychlý algoritmus |
| Keywords in different language: | fast convolution;fast algorithms |
| 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. |
| Rights: | © UNION Agency – Science Press |
| Appears in Collections: | Volume 11, number 1-3 (2003) |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/1640Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.