Codes correcting position errors in racetrack memories
Codes correcting position errors in racetrack memories
复制标题
DOI：
10.1109/itw.2017.8278045
复制
发表时间：
2017-11
期刊：
影响因子：
--
通讯作者：
Yeow Meng Chee;Han Mao Kiah;A. Vardy;Van Khu Vu;Eitan Yaakobi
中科院分区：
文献类型：
--
作者：
Yeow Meng Chee;Han Mao Kiah;A. Vardy;Van Khu Vu;Eitan Yaakobi
赛马场存储器是一种利用沿纳米线的磁畴以获得极高存储密度的新技术。在赛马场存储器中，每个磁畴可以存储单个比特的信息，这些信息可以通过读取端口（磁头）感知。存储器的结构类似于磁带，它支持移位操作，移动磁头要顺序读取的域。为了提高存储器的速度，先前的工作研究了如何最小化移位操作的延迟，而同样重要的移位操作的可靠性却很少受到关注。在这项工作中，我们将继续我们最近的研究和设计代码，以对抗赛道记忆中的移位错误，称为位置错误。也就是说，转移域不是一个没有错误的操作，域可能会过度移动或不移动，这可以建模为删除和粘接插入。虽然可以使用传统的删除和插入纠错码，但我们使用赛道存储器的特殊结构来解决这个问题，其中域可以由多个磁头读取。我们将展示如何利用赛道记忆的这一特殊功能来构建纠正删除和粘插入的代码。
Racetrack memory is a new technology which utilizes magnetic domains along a nanoscopic wire in order to obtain extremely high storage density. In racetrack memory, each magnetic domain can store a single bit of information, which can be sensed by a reading port (head). The memory is structured like a tape which supports a shift operation that moves the domains to be read sequentially by the head. In order to increase the memory's speed, prior work studied how to minimize the latency of the shift operation, while the no less important reliability of this operation has received only a little attention. In this work we continue our recent study and design codes which combat shift errors in racetrack memory, called position errors. Namely, shifting the domains is not an error-free operation and the domains may be over-shifted or are not shifted, which can be modeled as deletions and sticky insertions. While it is possible to use conventional deletion and insertion-correcting codes, we tackle this problem with the special structure of racetrack memory, where the domains can be read by multiple heads. We will show how to take advantage of this special feature of racetrack memories in order to construct codes correcting deletions and sticky insertions.