计算机科学
加速
管道(软件)
延迟(音频)
云计算
点云
钥匙(锁)
点(几何)
实时计算
k-最近邻算法
剪裁(形态学)
计算机工程
并行计算
硬件加速
高效能源利用
能量(信号处理)
计算复杂性理论
低延迟(资本市场)
邻居发现协议
搜索算法
测距
浮点型
建筑
计算机硬件
算法
计算科学
作者
Chen Nie,Chao Jiang,Liming Xiao,Weifeng Zhang,Zhezhi He
出处
期刊:Proceedings
[Association for Computing Machinery]
日期:2025-06-22
卷期号:: 1-7
被引量:2
标识
DOI:10.1109/dac63849.2025.11132408
摘要
K-nearest neighbor (kNN) search is a fundamental operation in various point cloud applications, such as autonomous driving. However, the heavy computational intensity and memory demands of kNN search pose significant challenges for efficient implementation, especially in resource-constrained scenarios. To address these challenges, we propose PICK, a processing-in-memory (PIM) architecture designed to accelerate kNN search in point cloud applications. PICK leverages bit-serial-based PIM (BS-PIM) and customized circuits to efficiently handle key operations of kNN search: distance calculation and top-k selection. The run-time off-chip access is eliminated thanks to the large on-chip memory. For distance calculation, we introduce a bit-width clipping technique to reduce the latency of bit-serial execution with negligible accuracy degradation, providing flexible trade-offs between performance and precision. Besides, we propose a filtering-and-selection strategy that realizes approximately constant time complexity for arbitrary values of k. Furthermore, a two-stage pipeline is implemented to parallelize distance calculation and top-k search, effectively hiding latency and improving throughput. According to our experiments, PICK achieves $4.17 \times$ speedup and a $4.42 \times$ energy saving over the state-of-the-art design.
科研通智能强力驱动
Strongly Powered by AbleSci AI