Yifan Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yifan Zhang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Sitao Huang
University of California, Irvine, Irvine, CA, USA
5 shared publications - Bo Yu
Shenzhen Institute of Artificial Intelligence and Robotics for Society, Shenzhen, Guangdong, China
3 shared publications - Hongzheng Tian
University of California Irvine
3 shared publications - Xiaoyu Niu
Beijing Institute of Technology
3 shared publications - Yanjun Zhang
Beijing Institute of Technology
3 shared publications - Shaoshan Liu
Shenzhen Institute of Artificial Intelligence and Robotics for Society, Shenzhen, Guangdong, China
2 shared publications
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
PD-Swap: Prefill-Decode Logic Swapping for End-to-End LLM Inference on Edge FPGAs via Dynamic Partial Reconfiguration
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPD-Swap: Prefill-Decode Logic Swapping for End-to-End LLM Inference on Edge FPGAs via Dynamic Partial Reconfiguration
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 247-257
TeLLMe: An Efficient End-to-End Ternary LLM Prefill and Decode Accelerator with Table-Lookup Matmul on Edge FPGAs
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 247-257
Open AccessTeLLMe: An Efficient End-to-End Ternary LLM Prefill and Decode Accelerator with Table-Lookup Matmul on Edge FPGAs
- Open Access
- 24 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
A Sparsity-Aware Autonomous Path Planning Accelerator with HW/SW Co-Design and Multi-Level Dataflow Optimization
Path planning is a critical task for autonomous driving, aiming to generate smooth, collision-free, and feasible paths based on input perception and localization information. The planning task is both highly time-sensitive and computationally intensive, posing significant challenges to resource-constrained autonomous driving hardware. In this paper, we propose an end-to-end framework for accelerating path planning on FPGA platforms. This framework focuses on accelerating quadratic programming (QP) solving, which is the core of optimization-based path planning and has the most computationally-intensive workloads. Our method leverages a hardware-friendly alternating direction method of multipliers (ADMM) to solve QP problems while employing a highly parallelizable preconditioned conjugate gradient (PCG) method for solving the associated linear systems. We analyze the sparse patterns of matrix operations in QP and design customized storage schemes along with efficient sparse matrix multiplication and sparse matrix-vector multiplication units. Our customized design significantly reduces resource consumption for data storage and computation while dramatically speeding up matrix operations. Additionally, we propose a multi-level dataflow optimization strategy. Within individual operators, we achieve acceleration through parallelization and pipelining. For different operators in an algorithm, we analyze inter-operator data dependencies to enable fine-grained pipelining. At the system level, we map different steps of the planning process to the CPU and FPGA and pipeline these steps to enhance end-to-end throughput. We implement and validate our design on the AMD ZCU102 platform. Our implementation achieves state-of-the-art performance in both latency and energy efficiency compared to existing works, including an average 1.48 × speedup over the best FPGA-based design, a 2.89 × speedup compared to the state-of-the-art QP solver on an Intel i7-11800H CPU, a 5.62 × speedup over an ARM Cortex-A57 embedded CPU, and a 1.56 × speedup over state-of-the-art GPU-based work. Furthermore, our design delivers a 2.05 × improvement in throughput compared to the state-of-the-art FPGA-based design.
- 24 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
Open AccessA Sparsity-Aware Autonomous Path Planning Accelerator with HW/SW Co-Design and Multi-Level Dataflow Optimization
Path planning is a critical task for autonomous driving, aiming to generate smooth, collision-free, and feasible paths based on input perception and localization information. The planning task is both highly time-sensitive and computationally intensive, posing significant challenges to resource-constrained autonomous driving hardware. In this paper, we propose an end-to-end framework for accelerating path planning on FPGA platforms. This framework focuses on accelerating quadratic programming (QP) solving, which is the core of optimization-based path planning and has the most computationally-intensive workloads. Our method leverages a hardware-friendly alternating direction method of multipliers (ADMM) to solve QP problems while employing a highly parallelizable preconditioned conjugate gradient (PCG) method for solving the associated linear systems. We analyze the sparse patterns of matrix operations in QP and design customized storage schemes along with efficient sparse matrix multiplication and sparse matrix-vector multiplication units. Our customized design significantly reduces resource consumption for data storage and computation while dramatically speeding up matrix operations. Additionally, we propose a multi-level dataflow optimization strategy. Within individual operators, we achieve acceleration through parallelization and pipelining. For different operators in an algorithm, we analyze inter-operator data dependencies to enable fine-grained pipelining. At the system level, we map different steps of the planning process to the CPU and FPGA and pipeline these steps to enhance end-to-end throughput. We implement and validate our design on the AMD ZCU102 platform. Our implementation achieves state-of-the-art performance in both latency and energy efficiency compared to existing works, including an average 1.48 × speedup over the best FPGA-based design, a 2.89 × speedup compared to the state-of-the-art QP solver on an Intel i7-11800H CPU, a 5.62 × speedup over an ARM Cortex-A57 embedded CPU, and a 1.56 × speedup over state-of-the-art GPU-based work. Furthermore, our design delivers a 2.05 × improvement in throughput compared to the state-of-the-art FPGA-based design.
- Open Access
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-9
A Sparsity-Aware Autonomous Path Planning Accelerator with Algorithm-Architecture Co-Design
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessA Sparsity-Aware Autonomous Path Planning Accelerator with Algorithm-Architecture Co-Design
- Open Access
- 2 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 42
Accelerating Autonomous Path Planning on FPGAs with Sparsity-Aware HW/SW Co-Optimizations
- 2 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 42
Open AccessAccelerating Autonomous Path Planning on FPGAs with Sparsity-Aware HW/SW Co-Optimizations