High-throughput Point-Cloud Accelerator with Sparsity-aware Hierarchical Neighbor Voxel Search and Skipping
Point cloud-based 3D sparse convolution networks are widely employed to process voxel features efficiently. However, the irregularity of voxel sparsity poses significant challenges, leading to increased hardware complexity and inefficiencies. We propose an algorithm-hardware co-design for sparse 3D convolution. At the algorithm level, an on-the-fly thresholdbased voxel skipping is adopted, enhancing efficiency. At the hardware level, a hierarchical 3-stage Voxel Search and Skipping is developed to systematically narrow down the non-zero search space, enhancing both performance and hardware utilization. We implemented the proposed accelerator in a 65 nm process to demonstrate a 77.7% reduction in delay compared to a baseline design, which does not support the proposed sparsity adaptations. The proposed system also achieved the $1.34 \times$ and $2.22 \times$ higher energy efficiency and throughput as compared to the state-ofarts.
Authors
- Mingu Kang (ORCID: https://orcid.org/0000-0001-8104-5136)
- Sang-Seol Lee (ORCID: https://orcid.org/0009-0001-5158-438X)
- Anirudh Srinivasan
- S.M. Reddy (ORCID: https://orcid.org/0000-0001-9208-8262)
- S.M. Kim
- Sung‐Joon Jang (ORCID: https://orcid.org/0000-0002-6992-408X)
- Yun-Chia Yu
- Aryan Devrani
- Saianudeep Reddy Nayini
Institutions
- University of California San Diego (US)
- Korea Electronics Technology Institute (KR)
Publication Details
- Published
- 2025-06-22
- DOI
- https://doi.org/10.1109/dac63849.2025.11132726
- Primary Topic
- Computer Graphics and Visualization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00