Error Errore Eicitur: A Stochastic Resonance Paradigm for Reliable Storage of Information on Unreliable Media
Error Errore Eicitur: A Stochastic Resonance Paradigm for Reliable Storage of Information on Unreliable Media
复制标题
DOI：
10.1109/tcomm.2016.2590547
复制
发表时间：
2016-09-01
影响因子：
8.3
通讯作者：
Vasic, Bane
中科院分区：
文献类型：
--
作者：
Ivanis, Predrag;Vasic, Bane
我们给出一种存储系统的架构，它由不可靠存储元件构成的存储介质以及由含噪和无噪逻辑门组合而成的纠错电路组成，该系统能够以比完全由无噪逻辑门构成纠错电路的存储系统更低的错误概率保留所存储的信息。我们的纠错电路基于低密度奇偶校验码的迭代解码，并利用逻辑门中的误差的积极作用来纠正存储元件中的错误。本着马库斯·图留斯·西塞罗的“Clavus clavo eicitur”（以钉拔钉）的精神，所提出的存储系统基于这样的原理运行：“error errore eicitur”——一个错误驱逐另一个错误。逻辑门中存在的随机性使得这类解码器优于其无噪的同类解码器。此外，随机扰动不需要任何额外的计算资源，因为它们是不可靠硬件本身所固有的。为了利用逻辑门故障的益处，我们的纠错电路依赖两个关键的创新点：可靠门和不可靠门的混合以及解码器回退。我们提出一种基于吸收马尔可夫链的方法用于错误概率分析，并解释变量和校验节点更新函数中的随机性如何帮助解码器避开与陷阱集相关的局部极小值。
We give an architecture of a storage system consisting of a storage medium made of unreliable memory elements and an error correction circuit made of a combination of noisy and noiseless logic gates that is capable of retaining the stored information with the lower probability of error than a storage system with a correction circuit made completely of noiseless logic gates. Our correction circuit is based on the iterative decoding of low-density parity check codes, and uses the positive effect of errors in logic gates to correct errors in memory elements. In the spirit of Marcus Tullius Cicero's Clavus clavo eicitur (one nail drives out another), the proposed storage system operates on the principle: error errore eicitur-one error drives out another. The randomness that is present in the logic gates makes these classes of decoders superior to their noiseless counterparts. Moreover, random perturbations do not require any additional computational resources as they are inherent to unreliable hardware itself. To utilize the benefits of logic gate failures, our correction circuit relies on two key novelties: a mixture of reliable and unreliable gates and decoder rewinding. We present a method based on absorbing Markov chains for the probability of error analysis, and explain how the randomness in the variable and check node update function helps a decoder to escape to local minima associated with trapping sets.