Using Toeplitz Matrices to obtain 2D convolution
preprint
OA: closed
Abstract
Optimising the discrete convolution operations is important due to the fast growing interest and successful applications of deep learning to various fields and industries. In response to that, we propose an algorithm that views the 2D convolution operation between matrices as a matrix multiplication that involves a Toeplitz matrix; our algorithm is based on the mathematical result that we prove. We will present the complexity of the resulting algorithm and benchmark it against other 2D convolution algorithms in known Python computational libraries. The current implementations of our algorithm suggest a potential speed-up of convolution operation if the sparsity of the Toeplitz matrix was utilised.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00