Signed-Weight Projection for Robust In-Sensor Computing Neural Classifiers under Amplitude-Dependent Noise and Stuck-at Faults

Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

In-sensor computing (ISC) monolithically integrates photodetection and neural-network inference on the same focal plane, avoiding analog-to-digital conversion and off-chip data movement. Despite its unrivalled latency and energy benefits, ISC remains limited by the fragility of analog weights. Amplitude-dependent drift, random-telegraph noise, and irreversible stuck-at faults can each trigger abrupt accuracy collapse. We introduce a training-free hardening strategy—signed-weight projection—that clips every weight to a symmetric range, enforcing a zero-mean distribution without changing network topology or requiring retraining. Firstorder perturbation analysis shows that the resulting balanced weights self-cancel the mean shift produced by multiplicative noise, while the magnitude cap limits the worst-case impact of saturated faults. Hardware measurements on a 10 × 10 ISC prototype confirm a full optical-toelectrical inference path in ∼ 2 µs, underscoring the need for on-array robustness. Device-level simulations on a 784−100−10 classifier further demonstrate graceful accuracy degradation. Noise tolerance and stuck-fault tolerance expand by well over an order of magnitude compared with an unprotected baseline, yet clean-data accuracy is preserved. The method offers a low-cost algorithm device co-design guideline, which can be retro-fitted to existing ISC pipelines and scaled to future high-resolution vision sensors.

Article activity feed