paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Energy Efficient Convolutions with Temporal Arithmetic

基于时序算术的节能卷积
ASPLOS Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 22024匹配度 0/10 · 该论文属于低功耗硬件/体系结构方向,核心是用负对数延迟空间在模拟-时间编码信号上实现卷积算术以降低能耗;与用户关注的静态分析、LLM/Agent 交叉、浮点程序分析、贝叶斯程序分析等方向完全没有交集,摘要中提及的浮点仅指现有降精度编码方案,并非浮点程序分析。引用 7 inbox
Rhys Gretsch, Peiyang Song, Advait Madhavan, Jeremy Lau, Timothy Sherwood
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出将数值转为负对数延迟空间,并直接在时间编码信号上实现卷积算术,显著降低能耗。

卷积中的乘累加运算在传感器融合计算中主导功耗。已有低精度浮点或随机计算等非传统编码虽能降低算术能耗,但仍假设每个像素已完成完整模数转换;而时间编码信号此前只支持 min、max 和延迟等简单操作,无法实现卷积。本文提出对数值空间进行负对数变换,将其映射到“延迟空间”,使乘法变为时间延迟,并证明加法与减法也可直接在该空间中完成,同时保持结合律与交换律。该方案可用延迟元件和基本 CMOS 逻辑高效实现,并支持空间级联或时间递归操作,自然适配现代相机的分级 ADC 读出。作者还实现了一个自动将传统卷积转换为延迟空间架构的软件系统,用于分析并平衡时间量化与延迟元件噪声带来的误差。评估表明,相比最先进方案,每帧每像素卷积能耗降低 2 倍以上,能量延迟积改善四个数量级。

问题
卷积的乘累加在传感器融合计算中主导功耗;现有低功耗编码仍依赖完整 ADC,而时间编码信号仅支持简单操作,难以实现卷积。
方法
通过负对数变换将数值映射到延迟空间,使乘法变为延迟、加法与减法也可直接在该空间完成,并用延迟元件和基本 CMOS 逻辑实现,支持空间级联与时间复用。
评估
开发自动将传统卷积转换为延迟空间架构的软件系统,分析并平衡时间量化与延迟元件噪声误差;相比 SOTA,每像素每帧卷积能耗降低 2 倍以上,能量延迟积改善四个数量级。
原文摘要(Abstract)

Convolution is an important operation at the heart of many applications, including image processing, object detection, and neural networks. While data movement and coordination operations continue to be important areas for optimization in general-purpose architectures, for computation fused with sensor operation, the underlying multiply-accumulate (MAC) operations dominate power consumption. Non-traditional data encoding has been shown to reduce the energy consumption of this arithmetic, with options including everything from reduced-precision floating point to fully stochastic operation, but all of these approaches start with the assumption that a complete analog-to-digital conversion (ADC) has already been done for each pixel. While analog-to-time converters have been shown to use less energy, arithmetically manipulating temporally encoded signals beyond simple min, max, and delay operations has not previously been possible, meaning operations such as convolution have been out of reach. In this paper we show that arithmetic manipulation of temporally encoded signals is possible, practical to implement, and extremely energy efficient. The core of this new approach is a negative log transformation of the traditional numeric space into a 'delay space' where scaling (multiplication) becomes delay (addition in time). The challenge lies in dealing with addition and subtraction. We show these operations can also be done directly in this negative log delay space, that the associative and commutative properties still apply to the transformed operations, and that accurate approximations can be built efficiently in hardware using delay elements and basic CMOS logic elements. Furthermore, we show that these operations can be chained together in space or operated recurrently in time. This approach fits naturally into the staged ADC readout inherent to most modern cameras. To evaluate our approach, we develop a software system that automatically transforms traditional convolutions into delay space architectures. The resulting system is used to analyze and balance error from both a new temporal equivalent of quantization and delay element noise, resulting in designs that improve the energy per pixel of each convolution frame by more than 2× compared to a state-of-the-art while improving the energy delay product by four orders of magnitude.

链接与引用

DOI 原文 · PDF(开放获取) · DBLP

BibTeX
@inproceedings{GretschSMLS24,
  title = {Energy Efficient Convolutions with Temporal Arithmetic},
  author = {Rhys Gretsch and Peiyang Song and Advait Madhavan and Jeremy Lau and Timothy Sherwood},
  booktitle = {ASPLOS},
  year = {2024},
  doi = {10.1145/3620665.3640395}
}