SATLLM: A Sparsity-aware Accelerator for Ternary-Weight Large Language Models

Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).

Large language models (LLMs) exhibit strong performance across applications, but their inference is computationally intensive, posing significant challenges for edge deployment. Quantization is among the most effective and widely used optimizations. In particular, ternary-weight quantization further lowers compute cost by replacing many multiplications with lightweight additions, thereby reducing complexity and energy. However, existing GPU/ASIC solutions often exhibit low utilization for ternary-weight LLMs and fail to exploit their inherent sparsity, leading to inefficient execution. To address this, we propose SATLLM, a lightweight accelerator optimized for ternary weights and sparsity. At the algorithm level, we propose a co-optimization method based on unstructured pruning and ternary-weight clustering to effectively enhance the sparsity. To further exploit this sparsity, we design a hardware-friendly sparsity-aware merging scheme and develop a customized BitLinear engine to support efficient sparse computation. In addition, we optimize the dataflow between the BitLinear engine and the GEMM unit, effectively alleviating performance bottlenecks caused by workload imbalance. Together, these optimizations significantly improve the throughput and energy efficiency of ternary-weight LLM inference. The experiments show that our proposed accelerator achieves an energy efficiency of 9.42 TOPS/W, with improvements of up to 42.41 ×, 16.99 ×, 4.42 ×, 2.49 ×, and 1.90 × compared to NVIDIA V100, A100, ANT, MECLA, and RMFA, respectively.