EDBT 2026 Demo / reviewers in the wild / expert
Zhengnan Fu
dblp:415/5617
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0009-1235-8521ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 93% Hardware accelerators and domain-specific architectures · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › processing-in-memory › computing-in-memory
analog in-memory computing |
0.9 | 1 | 2025 | High Energy-efficiency and Low latency In-Memory Computing using Analog Accumulator and In-Memory ADC with shared References · DAC 2025 |
Memory systems
in-memory computing |
0.9 | 1 | 2025 | High Energy-efficiency and Low latency In-Memory Computing using Analog Accumulator and In-Memory ADC with shared References · DAC 2025 |
Memory systems › processing-in-memory › computing-in-memory
in-SRAM computing |
0.9 | 1 | 2025 | High Energy-efficiency and Low latency In-Memory Computing using Analog Accumulator and In-Memory ADC with shared References · DAC 2025 |
Memory systems
processing-in-memory |
0.9 | 1 | 2025 | High Energy-efficiency and Low latency In-Memory Computing using Analog Accumulator and In-Memory ADC with shared References · DAC 2025 |
Hardware accelerators and domain-specific architectures
machine learning accelerator |
0.3 | 1 | 2025 | High Energy-efficiency and Low latency In-Memory Computing using Analog Accumulator and In-Memory ADC with shared References · DAC 2025 |
Methods — techniques the papers use, named apart from their topics
noise-resilient training · 0.9charge-sharing accumulator · 0.9bit-slicing · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Live Demonstration: An Event-Driven E-Skin System with Dynamic Binary Scanning and real time SNN Classification
Zhengnan Fu, Li Gaishan, Anubhab Tripathi, Arindam Basu |
ISCAS | 1 |
| 2026 | An Event-Driven E-Skin System with Dynamic Binary Scanning and real time SNN Classification
Li Gaishan, Zhengnan Fu, Anubhab Tripathi, Arindam Basu |
ISCAS | 2 |
| 2025 | High Energy-efficiency and Low latency In-Memory Computing using Analog Accumulator and In-Memory ADC with shared ReferencesabstractThis article proposes a $256 \times 128$ in-memory computing array using reconfigurable in-memory analog-to-digital conversion with shared references for high area efficiency (area overhead of 3% is $9 X$ better than traditional). A dual-8T SRAM bitcell is used to achieve read-write decoupling and store ternary weights. Read World Line Under Drive enabled Cascode helps to minimize current variations producing high linearity. Multi-bit input is handled with low latency and high energyefficiency by using bit-slicing (BS) with near-memory chargesharing based binary weighted accumulator (CHA). Using noise resilient training, we show software comparable performance for a MLP on MNIST, VGG-8 on CIFAR-10, and graph attention network on Cora, with respective accuracy reductions of only $0.1 \%, 0.8 \%$ and 0.5% due to non-idealities. The proposed macro demonstrates high energy/area efficiency (1146 TOPS/W, 27 TOPS $/ \mathbf{m m}^{\mathbf{2}}$ at $\mathbf{1} \boldsymbol{/} \mathbf{2} \boldsymbol{/} \mathbf{1 b}$) in $\mathbf{6 5 ~ n m}$ CMOS. It increases throughput (by $1.9 X$) and linearity (by $23 X$) compared to input pulse-width modulation by using BS and CHA. Compared to conventional BS with digital accumulation after ADC, this method has $1.7 X / 6.6 X$ better energy-efficiency/throughput by reducing ADC operations. Zhengnan Fu, Hongyang Shang, Arindam Basu |
DAC | 3 |