mlsanityData to 14 Oct 2026

Exploration of Unary Arithmetic-Based Matrix Multiply Units for Low Precision DL Accelerators

arXiv 2602.00838 ↗First posted 31 Jan 2026cs.AR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

General matrix multiplication (GEMM) is a fundamental operation in deep learning (DL). With DL moving increasingly toward low precision, recent works have proposed novel unary GEMM designs as an alternative to conventional binary GEMM hardware. A rigorous evaluation of recent unary and binary GEMM designs is needed to assess the potential of unary hardware for future DL compute. This paper focuses on unary GEMM designs for integer-based DL inference and performs a detailed evaluation of three latest unary design proposals, namely, uGEMM, tuGEMM and tubGEMM, by comparing them to a conventional binary GEMM. Rigorous post-synthesis evaluations beyond prior works are performed across varying bit-widths and matrix sizes to assess the designs' tradeoffs and determine optimal sweetspots. Further, we perform weight sparsity analysis across eight pretrained convolutional neural networks (CNNs) and the LLaMA2 large language model (LLM). In this work, we demonstrate how unary GEMM can be effectively used for energy-efficient compute in future edge AI accelerators.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 9 references that are in the map. First posted on arXiv 31 Jan 2026.

Builds on

3 of 9 references.

References · 3

  1. 2024The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bitscited by 308
  2. 2024tubGEMM: Energy-Efficient and Sparsity-Effective Temporal-Unary-Binary Based Matrix Multiply Unitcited by 2
  3. 2024tuGEMM: Area-Power-Efficient Temporal Unary GEMM Architecture for Low-Precision Edge AIcited by 2

Built on by

Not cited yet.