Oct 2026· IEEE Transactions on Circuits and Systems - II - Express Briefs· Vol 73, pp. 1074-1078· 0 citations· 23 references
Abstract
MobileNet has been widely adopted in mobile applications due to its lightweight architecture based on depthwise separable convolution (DSC). However, developing an efficient MobileNet accelerator remains hard as the DSC consists of two heterogeneous operations, depthwise convolution (DWC) and pointwise convolution (PWC). In addition, workload ratios between the DWC and PWC vary across the DSC layers, causing workload imbalance and thus underutilization in the accelerator. Pruning that removes unimportant weights worsens this problem as sparsity is not evenly distributed. In this brief, we propose an energy-efficient FPGA-based accelerator for sparse MobileNet with a novel operation called chained depthwise separable convolution (CDSC) and computation-aware pruning (CAP). The CDSC reformulates the consecutive DWC and PWC operations as a single operation, which resolves the underutilization problem by making a fixed workload ratio between the DWC and PWC in all DSC layers. Furthermore, the CDSC combines sparsities of the DWC and PWC, and this chained sparsity significantly reduces the computations of the CDSC-based MobileNet. To maximize the effect of the chained sparsity without significant accuracy loss, the CAP iteratively searches for efficient pruning targets by simultaneously considering the accuracy and the number of computations. The proposed accelerator is implemented on the Xilinx ZCU104 FPGA platform, and achieves the best trade-off between the accuracy and energy efficiency.
By making DWC compute-efficient, Flash-DWC promotes the use of larger and more expressive filters and extends forward and backward propagation to both forward and backward propagation for efficient end-to-end training.
Zhiyi Zhang, Yang Zhao, Jing-Wei Sun et al.· ACM Transactions on Architec...· 0 citations
DCSR-GCN, a high-performance GCN accelerator based on dynamic compression and sparsity reordering based on dynamic compression and sparsity reordering, is presented and a two-phase reordering algorithm that combines conflict-aware row scheduling with reuse-aware column grouping is proposed, thereby mitigating RAW confl...
Jun-Sheng Chang, Yi-Min Zhao, Yu-Xin Huang et al.· ACM Transactions on Design A...· 0 citations
A memory-efficient hardware accelerator for depthwise separable convolution that minimizes off-chip memory traffic and parameter storage and performs the depthwise separable convolution with a small number of logic resources and on-chip memory, confirming its feasibility for resource-constrained edge devices.
Jaeseong Kim, Taehong Min, Chaebin Lee et al.· Electronics· 0 citations
This work proposes the segmented fiber tree (SFT) data structure, which extends the conventional fiber tree through further partitioning to better support the dataflow paradigm while enhancing data reuse, and decouples the multiplication and merging phases.
Sheng-Bai Luo, Sheng Ma, Bo Wang et al.· ACM Transactions on Architec...· 0 citations
Deep Neural Networks (DNNs) are critical to modern AI applications, yet their deployment on standard CPUs and GPUs is constrained by high power consumption and computational latency, particularly in resource-constrained edge environments. To address these limitations, this paper presents the design and implementation o...
P. V. G. K. Rao, Dudekula Raziya· 2026 International Conferenc...· 0 citations
In the evolving landscape of edge devices, unlocking artificial intelligence (AI) services via the cloud has consistently raised concerns related to energy consumption, latency, and privacy. Shifting these services locally onto edge devices powered by CPUs and GPUs have always been hindered by their limited storage a...
Doaa K. Hameed, Abdullah M. Zyarah· Journal of Forecasting· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.