Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.15929

Current Should Not Sneak: Constrained Codes for Reliable Memristor Crossbar Arrays

Selahattin Kaan Kırgeç·Yunus Alp Bıyıkoğlu·Ahmed Hareedy
View original source ↗Read source document ↗Export metadata ↓

Abstract

The approach of squeezing more transistors in the same area in order to speed up computing is no longer effective. Currently, researchers and engineers are searching for novel solutions that offer faster computing. One of these solutions is to compute where you store, known as in-memory computing. Resistive random access memories (ReRAMs), which are based on memristor crossbar arrays, enable in-memory computing. Moreover, ReRAMs offer large storage capacity associated with energy efficiency. In this work, we focus on storing digital data in memristor crossbar arrays. A critical challenge here is the sneak-path problem, occurring when there is a rectangle on the array with three low and one high resistances at the corners. The electric current in this case is prone to sneaking through the low-resistance path upon reading, which results in the high resistance data becoming erroneous. In this paper, we propose effective constrained coding solutions to the sneak-path problem after finding the expected number of sneak paths over a two-dimensional array given their circumferences. In particular, we adopt a literature model where $b$ rows on the crossbar array are read simultaneously while the others are grounded, and we design capacity-achieving non-binary constrained codes for the cases of $b=2$ and $b=3$. We focus more on the sneak paths with shorter circumferences as they are more detrimental. Here, GF refers to Galois field. Our GF$(4)$ codes, for $b=2$, and GF$(8)$ codes, for $b=3$, are a class of lexicographically-ordered constrained (LOCO) codes, and we call them resistive-LOCO (RES-LOCO) codes. RES-LOCO codes operate horizontally, and we also suggest a run-length-limited scheme for coding data on the crossbar array vertically to mitigate the sneak-path problem for $b=4$. We experimentally demonstrate the effectiveness of our RES-LOCO codes for various array setups.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Selahattin Kaan Kırgeç, Yunus Alp Bıyıkoğlu, Ahmed Hareedy. 2026-07-17. Current Should Not Sneak: Constrained Codes for Reliable Memristor Crossbar Arrays. https://arxiv.org/abs/2607.15929

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Radiance-Field Guided Pretraining: Scaling Localization Models with Unlabeled Wireless Signals

Radio frequency (RF)-based indoor localization offers significant promise for applications such as indoor navigation, augmented reality, and pervasive computing. While deep learning has greatly enhanced localization accuracy and robustness, existing localization models still face major challenges in cross-scene generalization due to their reliance on scene-specific labeled data. To address this, we introduce Radiance-Field Reinforced Pretraining (RFRP). This novel self-supervised pretraining framework couples a large localization model (LM) with a neural radio-frequency radiance field (RF-NeRF) in an asymmetrical autoencoder architecture. In this design, the LM encodes received RF spectra into latent, position-relevant representations, while the RF-NeRF decodes them to reconstruct the original spectra. This alignment between input and output enables effective representation learning using large-scale, unlabeled RF data, which can be collected continuously with minimal effort. To this end, we collected RF samples at 7,327,321 positions across 100 diverse scenes using four common wireless technologies--RFID, BLE, WiFi, and IIoT. Data from 75 scenes were used for training, and the remaining 25 for evaluation. Experimental results show that the RFRP-pretrained LM reduces localization error by over 40% compared to non-pretrained models and by 21% compared to those pretrained using supervised learning.

cs.IT↗
arXiv2026

Uniform Recovery of Structured Signals from Nonlinear Observations: Improved Error Rates

Consider the recovery of structured signals from nonlinear observations. Under Gaussian matrix and a large class of unknown nonlinear link functions, Plan and Vershynin (2016) showed that generalized Lasso achieves accurate nonuniform recovery of a fixed signal. More recently, Genzel and Stollenwerk (2023) showed that generalized Lasso is indeed capable of accurately recovering all structured signals. However, in some canonical settings with discontinuous link functions, their uniform recovery error rate is essentially slower than the nonuniform one. Specifically, in the recovery of $n$-dimensional $k$-sparse vectors from $m$ measurements, generalized Lasso with a perfectly tuned $\ell_1$ constraint achieves nonuniform error rate $ O(\sqrt{k\log(en/k)/m})$, while the uniform error rate of Genzel and Stollenwerk is no faster than $O((k\log(en/k)/m)^{1/4})$. In this paper, we narrow this gap by establishing improved uniform recovery guarantees under piecewise Lipschitz link functions with well-separated jump discontinuities. We analyze a projected gradient descent (PGD) algorithm whose projection can be onto a convex set or a cone, and our results for the PGD with a convex set are also valid for the generalized Lasso. In sparse recovery, the improved uniform error rates match the nonuniform rate $O(\sqrt{k\log(en/k)/m})$ up to logarithmic factors. Under the sign link function, we further show that iterative hard thresholding (a specific instance of the PGD) achieves uniform recovery error rate $O(\sqrt{k\log(en/k)/m})$, matching the nonuniform rate up to a universal constant. Technically, the uniform guarantees for the PGD are obtained by showing that the gradient maps satisfy the restricted approximate invertibility condition uniformly over all signals. We demonstrate that this is a general approach to uniform recovery under nonlinear observations.

cs.IT↗
arXiv2026

Recursive overlap Bernoulli distributions and an entropy concavity conjecture

We introduce a family of recursively generated finite probability distributions obtained from left and right embeddings with overlaps. The construction interpolates between the classical binomial distribution and the non-overlapping Bernoulli product distribution. We derive explicit formulas for the expectation, variance, and the generating function of higher moments, and formulate a conjecture asserting that the Shannon entropy is concave. The conjecture is proved in the two extremal cases and supported by symbolic computations for numerous overlap sequences.

cs.IT↗