.png){kind=icon}
.png){kind=icon}
Return
An Efficient Bit-Sparse DNN Accelerator Exploiting Adaptive Bit-Serial Computations
.png){kind=icon}
PRE
AI
DOI：10.1109/TCAD.2025.3560584.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Bit sparsity, an intrinsic attribute of binary representation, has been widely utilized in deep neural network (DNN) inference acceleration. Despite the advantages in performance and energy efficiency demonstrated by existing bit-serial-based bit-sparse accelerators, they still face two notable limitations: 1) at the low-level bit-serial multiplier level, existing methods either statically select weight or activation as the serialized object during the design phase, or simply serialize both without considering the distribution of nonzero bits in different operands, thereby failing to achieve optimal performance and 2) at the high-level dataflow level, existing approaches do not eliminate zero values in data movement and computation, leading to considerable energy and latency overhead, as well as suboptimal PE utilization. In this work, we propose AdaS-Pro accelerator for fast and energy-efficient DNN inference. At the multiplier level, AdaS-Pro employs an adaptive bit-serial computation scheme, which dynamically serializes the input operand with fewer nonzero bits at runtime, thereby minimizing compute cycles. To further enhance performance, AdaS-Pro introduces an improved Booth encoding method to reduce the number of nonzero bits in each operand. At the dataflow level, AdaS-Pro employs a compressed format to eliminate zero values and proposes a bi-directional inner-join unit coupled with a ring-shaped scheduler to achieve efficient nonzero workload extraction and balancing. Experimental results show that AdaS-Pro outperforms existing state-of-the-art bit-sparse accelerators, such as BitLet, BitX, and Laconic, with performance improvements of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4.03\times $ </tex-math></inline-formula>, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$6.78\times $ </tex-math></inline-formula>, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1.43\times $ </tex-math></inline-formula>, respectively.
Keywords:
Adaptive bit-serial computation
bit sparsity
DNN accelerator
Journal
I
IF:
2.9
Papers:
564
Citations:
9.6K