Enabling Long Chain Lengths and High-Throughput for Time-Domain Neuromorphic Computing

This brief investigates the limitations on throughput and delay chain length in time-domain neuromorphic computing and proposes solutions to overcome these challenges. Through the employment of clock optimization, cascaded delay cells, and pulse-width expander cells, this brief demonstrates significant throughput and scalability improvements over the current state of the art. Analyses reveal critical relationships between chain length, variability, and supply voltage, highlighting that increasing chain length improves variability and reduces sensitivity to supply scaling. Applied to a CNN, tested on the MNIST dataset, the proposed designs maintain robust accuracy with less than 1% degradation across a range of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\sigma /\mu $ </tex-math></inline-formula> values, even under weight variation. The system achieves 0.57 fJ energy/op, with throughput as high as 2432 GOPS. The findings underscore the advantage of these delay cells for high-throughput, low variability, and energy-efficient time-domain neuromorphic systems.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Circuits & Systems II Express Briefs
Published
2025-03-05
DOI
https://doi.org/10.1109/tcsii.2025.3548561
Citations
2
Primary Topic
Advanced Memory and Neural Computing
Type
article
Field-Weighted Citation Impact
1.46
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enabling Long Chain Lengths and High-Throughput for Time-Domain Neuromorphic Computing

Hagar Hendy, Cory Merkel, Karsten Bergthold, Tejasvi Das et al.
2 citations
IEEE Transactions on Circuits & Systems II Express Briefs
Advanced Memory and Neural Computing
1.46
article

Enabling Long Chain Lengths and High-Throughput for Time-Domain Neuromorphic Computing

Hagar Hendy, Cory Merkel, Karsten Bergthold, Tejasvi Das, Elaine Greenfield
article en
2 citations

Abstract

This brief investigates the limitations on throughput and delay chain length in time-domain neuromorphic computing and proposes solutions to overcome these challenges. Through the employment of clock optimization, cascaded delay cells, and pulse-width expander cells, this brief demonstrates significant throughput and scalability improvements over the current state of the art. Analyses reveal critical relationships between chain length, variability, and supply voltage, highlighting that increasing chain length improves variability and reduces sensitivity to supply scaling. Applied to a CNN, tested on the MNIST dataset, the proposed designs maintain robust accuracy with less than 1% degradation across a range of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\sigma /\mu $ </tex-math></inline-formula> values, even under weight variation. The system achieves 0.57 fJ energy/op, with throughput as high as 2432 GOPS. The findings underscore the advantage of these delay cells for high-throughput, low variability, and energy-efficient time-domain neuromorphic systems.

IEEE Transactions on Circuits & Systems II Express BriefsVol. 72(8)
Rochester Institute of Technology (US), Cirrus Logic (United States) (US), University of Rochester (US)
Affordable and clean energy
Openalex Percentile: Top 19%
Advanced Memory and Neural Computing
1.46
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.