AI 中文总结
研究忆阻器交叉阵列存储数字数据时的潜行路径问题，提出基于文献模型的RES - LOCO码及垂直编码方案，通过实验证明其能有效解决潜行路径问题，实现可靠存储。
AI 中文摘要
为加速计算而在同一区域挤压更多晶体管的方法已不再有效，研究人员正寻找新方案，基于忆阻器交叉阵列的电阻式随机存取存储器（ReRAM）可实现内存计算。本文聚焦于在忆阻器交叉阵列中存储数字数据，关键挑战是潜行路径问题，即阵列角落出现三个低电阻和一个高电阻的矩形时，电流易通过低电阻路径导致高电阻数据错误。我们提出有效的约束编码解决方案，采用文献模型，设计了b = 2和b = 3时的容量实现非二进制约束码，重点关注周长较短的潜行路径，还提出了垂直编码数据的游程长度限制方案。通过实验证明了我们的RES - LOCO码在各种阵列设置下的有效性。
英文摘要
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.
Comments27 pages (single column), 3 figures, submitted to the IEEE Transactions on Information Theory (TIT)
