KARAS, Pavel and David SVOBODA. Algorithms for Efficient Computation of Convolution. In Design and Architectures for Digital Signal Processing. 1st ed. Rijeka (CRO): InTech, 2013, p. 179-208. ISBN 978-953-51-0874-0. Available from: https://dx.doi.org/10.5772/3456.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Algorithms for Efficient Computation of Convolution
Name in Czech Algoritmy pro efektivní výpočet konvoluce
Authors KARAS, Pavel (203 Czech Republic, belonging to the institution) and David SVOBODA (203 Czech Republic, guarantor, belonging to the institution).
Edition 1st ed. Rijeka (CRO), Design and Architectures for Digital Signal Processing, p. 179-208, 30 pp. 2013.
Publisher InTech
Other information
Original language English
Type of outcome Chapter(s) of a specialized book
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Croatia
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
WWW URL
RIV identification code RIV/00216224:14330/13:00065930
Organization unit Faculty of Informatics
ISBN 978-953-51-0874-0
Doi http://dx.doi.org/10.5772/3456
Keywords (in Czech) konvoluce; algoritmy; FFT; separabilní konvoluce; rekurzivní filtry; paralelizace; dekompozice
Keywords in English convolution; algorithms; FFT; separable convolution; recursive filters; parallelization; decomposition
Tags cbia-web
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 28/4/2014 11:28.
Abstract
Convolution is an important mathematical tool in both fields of signal and image processing. It is em-ployed in filtering, denoising, edge detection, correlation, compression, deconvolution, simulation, and in many other applications. Although the concept of convolution is not new, the efficient computation of convolution is still an open topic. As the amount of processed data is constantly increasing, there is considerable request for fast manipulation with huge data. Moreover, there is demand for fast algorithms which can exploit computational power of modern parallel architectures. The aim of this chapter is to review the algorithms and approaches for computation of convolution with regards to various properties such as signal and kernel size or kernel separability (when pro-cessing n-dimensional signals). Target architectures include superscalar and parallel processing units (namely CPU, DSP, and GPU), programmable architectures (e.g. FPGA), and distributed systems (such as grids). The structure of the chapter is designed to cover various applications with respect to the signal size, from small to large scales.
Links
GBP302/12/G157, research and development projectName: Dynamika a organizace chromosomů během buněčného cyklu a při diferenciaci v normě a patologii
Investor: Czech Science Foundation
MUNI/A/0760/2012, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II. (Acronym: FI MAV II.)
Investor: Masaryk University, Category A
MUNI/A/0914/2009, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Acronym: SV-FI MAV)
Investor: Masaryk University, Category A
PrintDisplayed: 2/7/2024 17:21