Fast convolution
| dc.contributor.author | Werman, Michael | |
| dc.contributor.editor | Skala, Václav | |
| dc.date.accessioned | 2013-04-11T11:11:49Z | |
| dc.date.available | 2013-04-11T11:11:49Z | |
| dc.date.issued | 2003 | |
| dc.description.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. | en |
| dc.format | 2 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Journal of WSCG. 2003, vol. 11, no. 1-3. | en |
| dc.identifier.issn | 1213-6972 | |
| dc.identifier.uri | http://wscg.zcu.cz/wscg2003/Papers_2003/D13.pdf | |
| dc.identifier.uri | http://hdl.handle.net/11025/1640 | |
| dc.language.iso | en | en |
| dc.publisher | UNION Agency – Science Press | cs |
| dc.relation.ispartofseries | Journal of WSCG | en |
| dc.rights | © UNION Agency – Science Press | cs |
| dc.rights.access | openAccess | en |
| dc.subject | rychlá konvoluce | cs |
| dc.subject | rychlý algoritmus | cs |
| dc.subject.translated | fast convolution | en |
| dc.subject.translated | fast algorithms | en |
| dc.title | Fast convolution | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |