BitFleX: Exploiting extreme bit-level sparsity via BTD encoding and dynamic pruning
Deep neural networks (DNNs) have achieved remarkable success in critical domains such as computer vision. However, their substantial model scale and computational demands hinder deployment on resource-constrained edge devices. Bit-serial accelerators (BSAs) leverage significant bit-level sparsity (BLS) in weights and activations to accelerate inference. Unstructured BLS causes hardware inefficiency, while existing static pruning methods cannot adapt to real-time activations. To address these challenges, we propose BitFleX, a BSA enabling runtime semi-structured pruning for both weights and activations. Specifically, we introduce Bit-Term Decomposition (BTD) encoding to enhance inherent BLS and reduce pruning complexity. Additionally, a pruning-error predictor dynamically selects operands for sparsification with minimal error. Experiments show BitFleX achieves 87.5% BLS in ViT-B with <1% Top-1 accuracy loss on ImageNet, yielding 5.86× speedup over baseline and 23.61 TOPS/W peak energy efficiency.
Authors
- Qiang Li (ORCID: https://orcid.org/0000-0003-0096-7679)
- Huidong Zhao
- Shushan Qiao
- Chendong Xia
Institutions
- Chinese Academy of Sciences (CN)
- University of Chinese Academy of Sciences (CN)
Publication Details
- Journal
- IEICE Electronics Express
- Published
- 2025-10-27
- DOI
- https://doi.org/10.1587/elex.22.20250409
- Primary Topic
- Security and Verification in Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Chinese Academy of Sciences