Geodesic
Application of polynomial transforms for fast 2D convolutions
Numerical methods and programming, Tome 17 (2016) no. 3, pp. 197-203 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A fast algorithm for computing 2D convolutions based on the Nussbaumer polynomial transforms is considered. Its efficient implementation is proposed with the use of Intel AVX SIMD instructions. It is shown that, for a limited range of convolution kernels, the performance increases by 50% in comparison with the direct algorithm and with the method of fast convolution based on the fast Fourier transform implemented in the Intel IPP library.
Mots-clés : 2D convolution, polynomial transform
Keywords: fast algorithms. 
@article{VMP_2016_17_3_a0,
     author = {I. A. Kalinovskii and V. G. Spitsyn},
     title = {Application of polynomial transforms for fast {2D} convolutions},
     journal = {Numerical methods and programming},
     pages = {197--203},
     year = {2016},
     volume = {17},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2016_17_3_a0/}
}
TY  - JOUR
AU  - I. A. Kalinovskii
AU  - V. G. Spitsyn
TI  - Application of polynomial transforms for fast 2D convolutions
JO  - Numerical methods and programming
PY  - 2016
SP  - 197
EP  - 203
VL  - 17
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VMP_2016_17_3_a0/
LA  - ru
ID  - VMP_2016_17_3_a0
ER  - 
%0 Journal Article
%A I. A. Kalinovskii
%A V. G. Spitsyn
%T Application of polynomial transforms for fast 2D convolutions
%J Numerical methods and programming
%D 2016
%P 197-203
%V 17
%N 3
%U http://geodesic.mathdoc.fr/item/VMP_2016_17_3_a0/
%G ru
%F VMP_2016_17_3_a0
I. A. Kalinovskii; V. G. Spitsyn. Application of polynomial transforms for fast 2D convolutions. Numerical methods and programming, Tome 17 (2016) no. 3, pp. 197-203. http://geodesic.mathdoc.fr/item/VMP_2016_17_3_a0/