HWHaibin Wu

Haibin Wu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Haibin Wu has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    M^2 -DFU: Multi-Mode Dataflow Architecture for Adaptive and High-Efficiency Data Processing

    by Wenming Li, Zhihua Fan, Haibin Wu, Kunming Zhang, Yu Liu, Haoran Tong, Xiaochun Ye, Dongrui Fan

    The impending end of Moore’s Law and Dennard Scaling has prompted a shift in both industry and academia from general-purpose processors (e.g., CPUs and GPGPUs) toward specialized solutions. However, the diverse hardware requirements of edge computing make it challenging for existing specialized architectures to adapt to rapidly evolving algorithms, often prioritizing efficiency at the expense of generality. Our approach leverages the inherent advantages of software-defined dataflow mechanisms and integrates reconfigurable SIMD into the architecture to achieve high efficiency and flexibility in hardware for edge computing, surpassing ASIC architectures. In this work, we propose M ^2 -DFU (Multi-Mode Dataflow Unit), a flexible, highly efficient architecture with configurable multiple execution modes. First, we identify general and specific requirements for various edge applications, including convolutional neural networks (CNNs), digital signal processing (DSP), and typical scientific computing. Next, we design a flexible architecture with high configurability across multiple modes. Efficient and reconfigurable microarchitectural optimizations are implemented to achieve multilevel parallelism and ensure high hardware utilization. Compared to NVIDIA GPUs, M ^2 -DFU achieves an average improvement of up to 6.8 \times in energy efficiency for typical edge computing applications.

  • Open Access

    AHASD: Asynchronous Heterogeneous Architecture for LLM Adaptive Drafting Speculative Decoding on Mobile Devices

    by Zirui Ma, Zhihua Fan, Wenxing Li, Haibin Wu, Fulin Zhang, Wenming Li, Xiaochun Ye

  • BISC: Rethinking Instruction Set Abstractions at Block Granularity

    by An Zhong, Hanzhi Hu, Zirui Ma, Mengzhu Li, Haibin Wu, Fulin Zhang, Jinyi Deng, Ceyu Xu, Wenming Li, Yang Hu, et al.

    Most widely deployed ISAs for general-purpose processors expose a centralized register file and instruction-granular control flow, forcing modern CPUs to rely on complex microarchitectural mechanisms to reconcile execution with architectural state. Even in simple in-order designs, these abstractions impose back-and-forth execution overheads, while more aggressive processors further amplify them through register renaming, speculation, and in-order retirement. This letter presents the Block-based Instruction Set Computer (BISC), which rethinks ISA abstractions at block granularity. BISC eliminates architectural destination registers by binding each instruction's result to its position within a block, enabling block-local execution driven by operand availability while preserving control-flow semantics across blocks. Control flow is resolved at block entry, amortizing fetch and control overhead across multiple operations and enabling efficient expression of conditional selection without additional control-flow edges. We evaluate BISC using a single-issue in-order core with comparable area to a RISC-V baseline. Despite executing more operations and incurring a larger code footprint, BISC achieves a 34% geometric mean speedup across benchmarks. These results demonstrate that ISA-level execution abstractions play a critical role in processor efficiency, independent of microarchitectural optimizations.

  • Open Access

    BitRed: Taming Non-Uniform Bit-Level Sparsity with a Programmable RISC-V ISA for DNN Acceleration

    by Yanhuan Liu, Wenming Li, Kunming Zhang, Yuqun Liu, Siao Wen, Lexin Wang, Tianyu Liu, Haibin Wu, Zhihua Fan, Xiaochun Ye, et al.

    The non-uniform and dynamic nature of Bit-Level Sparsity (BLS) poses a critical load-imbalance challenge for parallel hardware accelerators. While the Bit-Interleaving paradigm, represented by state-of-the-art accelerators like Bitlet, shows promise, it is fundamentally constrained by a rigid datapath and severe inter-channel load imbalance. This paper introduces BitRed, an accelerator that embodies a new ''programmable adaptive bit-interleaving'' philosophy. Rather than a monolithic design, BitRed's core is an Adaptive-Sparse Processing Unit (ASPU) that deconstructs the acceleration process into a set of orthogonal RISC-V ISA extensions for pre-processing (cal.pre), adaptive distillation with dynamic load balancing (cal.adis), and PDP-optimal reduction (cal.red). By transforming a rigid hardware problem into a flexible scheduling problem, this ISA-based approach provides a fundamentally more adaptable and extensible solution. Empirical studies on a broad set of benchmarks highlight the following results (normalized to a SCNN baseline): (1) up to 9.4× speedup over the Bitlet, and 5.6× over the latest bit-serial SOTA BitWave; (2) up to 7.6× higher inference efficiency than Bitlet on representative models; (3) 5.072mm2 area and scalable power consumption from 550.43mW (float32) to 495.12mW (16b) and 457.90mW (8b) @28nm TSMC; and (4) high versatility across precisions, and up to 18.9×13.5× higher than NVIDIA A100 and Jetson Orin 32GB, demonstrating significant competitiveness against GPUs.


  • Open Access

    DFGAS: Exploring the Balance of HW-SW Scheduling through the DFG-Aware Scheme

    by Tianyu Liu, Zhihua Fan, Wenming Li, Zhen Wang, Yuhang Qiu, Shengzhong Tang, Haibin Wu, Yanhuan Liu, Xiaochun Ye, Dongrui Fan

    Coarse-Grained Reconfigurable Architectures (CGRAs) have been regarded as promising spatial computing fabric for the ever-evolving algorithms in multiple domains. However, pure software scheduling cannot compensate for the deficiencies in over-serialization and load imbalancing of these pure static CGRA designs. To address the issues caused by limited hardware flexibility, an in-depth study on the balance between the software and hardware scheduling design of CGRA is needed to achieve more precise, accurate, and adaptive scheduling of dataflow. In this article, we propose DFGAS ( DFG - A ware S cheduling), a dataflow-driven CGRA which provides a comprehensive scheduling approach that encompasses software prediction, runtime adaptive execution, and post-execution refinement. Prior to execution, the TimeStamp prediction algorithm, coupled with the inherent dataflow execution model, enables coarse-grained (block-level) prediction for prioritized transfer and computation on NoC and PEs. During execution, the execution of key dataflow graph (DFG) blocks and edges is accelerated by incorporating a dynamic and adaptive dataflow mechanism. It leverages hardware-software co-design to obtain a holistic view of the entire DFG and continuously self-adaptively optimizes the scheduling process. Furthermore, a complete workflow is implemented, supporting making refinements to the software DFG mapping results. DFGAS represents a scheduling scheme of CGRA that is worth exploring, achieving hardware-software co-design that balances energy efficiency and flexibility. Experiments show that DFGAS achieves 1.35× energy efficiency improvement over a dataflow-driven CGRA and 1.9× energy efficiency improvement over a state-of-the-art pure static CGRA.


  • DFU-E: A Dataflow Architecture for Edge DSP and AI Applications

    by Wenming Li, Zhihua Fan, Tianyu Liu, Zhen Wang, Haibin Wu, Meng Wu, Kunming Zhang, Yanhuan Liu, Ninghui Sun, Xiaochun Ye, et al.

    Edge computing aims to enable swift, real-time data processing, analysis, and storage close to the data source. However, edge computing platforms are often constrained by limited processing power and efficiency. This paper presents DFU-E, a dataflow-based accelerator specifically designed to meet the demands of edge digital signal processing (DSP) and artificial intelligence (AI) applications. Our design addresses real-world requirements with three main innovations. First, to accommodate the diverse algorithms utilized at the edge, we propose a multi-layer dataflow mechanism capable of exploiting task-level, instruction block-level, instruction-level, and data-level parallelism. Second, we develop an edge dataflow architecture that includes a customized processing element (PE) array, memory, and on-chip network microarchitecture optimized for the multi-layer dataflow mechanism. Third, we design an edge dataflow software stack that enables automatic optimizations through operator fusion, dataflow graph mapping, and task scheduling. We utilize representative real-world DSP and AI applications for evaluation. Comparing with Nvidia's state-of-the-art edge computing processor, DFU-E achieves up to 1.42× geometric mean performance improvement and 1.27× energy efficiency improvement.


  • Accelerating Convolutional Neural Networks by Exploiting the Sparsity of Output Activation

    by Zhihua Fan, Wenming Li, Zhen Wang, Tianyu Liu, Haibin Wu, Yanhuan Liu, Meng Wu, Xinxin Wu, Xiaochun Ye, Dongrui Fan, et al.

    Deep Convolutional Neural Networks (CNNs) are the most widely used family of machine learning methods that have had a transformative effect on a wide range of applications. Previous studies have made great breakthroughs in accelerating CNNs, but they only target on the input sparsity of activation and weight, thus do not eliminate the unnecessary computations due to the fact that more zeros in the output results are not directly caused by the zero-valued positions of the input data. In this paper, we take advantage of the output activation sparsity to reduce the execution time and energy consumption of CNNs. First, we propose an effective prediction method that leverages the output activation sparsity. Our method first predicts the output activation polarity of convolutional layers based on the singular value decomposition (SVD) approach. Then, it uses the predicted negative value to skip invalid computations. Second, an effective accelerator is designed to take advantage of sparsity to achieve CNN inference acceleration. Each PE is equipped with a prediction unit and a non-zero value detection unit to remove invalid computation blocks. And an instruction bypass technique is proposed which further exploits the sparsity of the weights. The efficient dataflow graph mapping approach and pipeline execution ensure high computational resource utilization. Experiments show that our approach achieves up to 1.63× speedup and 55.30% energy reduction compared with dense networks with a slight loss of accuracy. Compared with Eyeriss, our accelerator achieves on average 1.31 × performance improvement and 54% energy reduction. Our accelerator also achieves a similar performance to SnaPEA, but with a better energy efficiency.


  • A defogging method for infrared camera based on polarization imaging

    by Huatao Chen, Haibin Wu, Xinbing Chen

    Due to the great influence of fog on life and production, this paper uses Stokes principle in polarization imaging combined with the physical model of fog imaging to design and implement an infrared camera fog removal method based on polarization imaging. In this paper, the defogging method of infrared camera based on polarization imaging is introduced in detail, and the sensor is verified by outdoor experiments. The experimental results show that the overall defogging effect of the proposed defogging method is good, with more details of the target scene preserved and strong contrast, which makes the restoration degree of the target scene higher than that of several classical defogging methods.