TL;DR
This paper extends the Karatsuba algorithm to matrix multiplication and proposes specialized hardware architectures, achieving improved efficiency and performance-per-area in custom matrix multiplication hardware for deep learning systems.
Contribution
It introduces a novel matrix multiplication extension of Karatsuba and designs hardware architectures that enhance efficiency over traditional methods.
Findings
Reduced complexity of matrix multiplication with Karatsuba extension
Hardware architectures that improve performance-per-area
Demonstrated benefits in deep learning accelerators
Abstract
While the Karatsuba algorithm reduces the complexity of large integer multiplication, the extra additions required minimize its benefits for smaller integers of more commonly-used bitwidths. In this work, we propose the extension of the scalar Karatsuba multiplication algorithm to matrix multiplication, showing how this maintains the reduction in multiplication complexity of the original Karatsuba algorithm while reducing the complexity of the extra additions. Furthermore, we propose new matrix multiplication hardware architectures for efficiently exploiting this extension of the Karatsuba algorithm in custom hardware. We show that the proposed algorithm and hardware architectures can provide real area or execution time improvements for integer matrix multiplication compared to scalar Karatsuba or conventional matrix multiplication algorithms, while also supporting implementation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
