.png){kind=icon}
返回
Delay-Space Arithmetic and Architecture
.png){kind=icon}
PRE
AI
DOI：10.1109/MM.2025.3588787.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
What operations can you perform efficiently when you use the time of arrival of a signal's edge to represent a number? Past work has shown how linear representations can be effectively used to optimize problems expressed in max-plus algebras, but efficient general-purpose arithmetic operations have remained elusive. We present negative-logarithmic delay-space arithmetic as a completely new approach to temporal coding. Under this approach, general-purpose arithmetic is transformed to a soft version of the standard temporal operations in such a way that preserves all of the algebraic identities. We further show that these soft operations can be approximated by composing the original sharp temporal operators, resulting in simple, energy-efficient implementations. We demonstrate the effectiveness of this novel arithmetic with a near-sensor architecture for energy-efficient convolutions. Cycle-over-cycle operation is supported through temporal recurrence, dramatically limiting the need for expensive domain conversions or noise-prone temporal memories.
Keyword:
Delays
Arithmetic
Wires
Transforms
Training
Three-dimensional displays
Standards
Hardware
Data mining
Voltage measurement
Time measurement
期刊
IF:
2.9
论文数:
141
被引数:
2.7K
机构
引用论文
.png){kind=icon}
A 4-mm2180-nm-CMOS 15-Giga-cell-updates-per-second DNA sequence alignment engine based on asynchronous race conditions一种基于异步竞争条件的4平方毫米、180纳米CMOS、每秒15吉细胞的DNA序列比对引擎
PREAI
分享收藏
查看更多内容