scholarly journals An Efficient im2row-Based Fast Convolution Algorithm for ARM Cortex-M MCUs

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 124384-124395
Author(s):  
Peng Wang ◽  
Xiaoqin Wang ◽  
Rui Luo ◽  
Dingyi Wang ◽  
Mengjie Luo ◽  
...  
1996 ◽  
Vol 44 (11) ◽  
pp. 2853-2864 ◽  
Author(s):  
R. Bernardini ◽  
G. Cortelazzo ◽  
G.A. Mian

2002 ◽  
Vol 48 (4) ◽  
pp. 341-347 ◽  
Author(s):  
P Bruzzoni ◽  
R.M Carranza ◽  
J.R Collet Lacoste ◽  
E.A Crespo

2016 ◽  
Vol 57 ◽  
Author(s):  
Rimantas Pupeikis

It is assumed that linear time-invariant (LTI) system input signal samples are updated by a sensor in real time. It is urgent for every new input sample or for small part of new samples to update a convolution as well. The idea is that fast Fourier transform (FFT) algorithm, used to calculate output frequency samples (f.s.), should not be recalculated with every new input sample. It is needed just to modify the convolution algorithm, when the new input sample replaces the old one. An example of computation of the convolution with ordinary and modified 8-point Fourier code matrix is presented.


2021 ◽  
Author(s):  
Gan Tong ◽  
Libo Huang

Convolutional Neural Network (CNN) has been widely used in various fields and played an important role. Convolution operators are the fundamental component of convolutional neural networks, and it is also the most time-consuming part of network training and inference. In recent years, researchers have proposed several fast convolution algorithms including FFT and Winograd. Among them, Winograd convolution significantly reduces the multiplication operations in convolution, and it also takes up less memory space than FFT convolution. Therefore, Winograd convolution has quickly become the first choice for fast convolution implementation within a few years. At present, there is no systematic summary of the convolution algorithm. This article aims to fill this gap and provide detailed references for follow-up researchers. This article summarizes the development of Winograd convolution from the three aspects of algorithm expansion, algorithm optimization, implementation, and application, and finally makes a simple outlook on the possible future directions.


2017 ◽  
Vol 35 (6) ◽  
pp. 1309-1326 ◽  
Author(s):  
Juha Yli-Kaakinen ◽  
Toni Levanen ◽  
Sami Valkonen ◽  
Kari Pajukoski ◽  
Juho Pirskanen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document