Fast Convolution based on Winograd Minimum Filtering: Introduction and Development

Abstract

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.

15 pages, 1 figure

References in corpus (6)

• Efficient Winograd Convolution via Integer Arithmetic
• Spatial-Winograd Pruning Enabling Sparse Winograd Convolution
• INT8 Winograd Acceleration for Conv1D Equipped ASR Models Deployed on Mobile Devices
• L3 Fusion: Fast Transformed Convolutions on CPUs
• WinoCNN: Kernel Sharing Winograd Systolic Array for Efficient Convolutional Neural Network Acceleration on FPGAs
• Quantaized Winograd/Toom-Cook Convolution for DNNs: Beyond Canonical Polynomials Base