Correcting Deletions in Multiple-Heads Racetrack Memories
Correcting Deletions in Multiple-Heads Racetrack Memories
复制标题
纠正多头赛道存储器中的删除
DOI：
10.1109/isit.2019.8849783
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Bruck, J.
中科院分区：
文献类型：
--
作者：
Sima, J.;Bruck, J.
开发赛马场存储系统的主要挑战之一是控制赛马场位移的精度有限，这反过来又影响了数据读写的可靠性。目前针对赛马场记忆体中的删除问题的建议是在每条赛道上使用冗余磁头，从而产生多个副本（可能是错误的），并解决一个特殊版本的序列重建问题。利用这种方法，构造了长度为n的k个删除纠错码，每个磁道有d个头，冗余度为log log n + 4。然而，代码结构要求k≤d。对于k > d，最著名的结构比经典的单头删除代码略有改进。在这里，我们解决了这个问题：如果头的数量固定在d（由于面积限制），那么k-删除代码（k是常数）可以实现的最佳冗余是什么？我们的关键结果是对这个问题的回答，即，我们构建了可以纠正k个删除的代码，对于任何k超过已知极限d。对于k≤2d - 1的情况，代码具有O（k4dlog log n）冗余。另外，当k≥2d时，该码具有2⌊k/d⌋log n + o（log n）冗余。
One of the main challenges in developing racetrack memory systems is the limited precision in controlling the track shifts, that in turn affects the reliability of reading and writing the data. The current proposal for combating deletions in racetrack memories is to use redundant heads per-track resulting in multiple copies (potentially erroneous) and solving a specialized version of a sequence reconstruction problem. Using this approach, k-deletion correcting codes of length n, with d heads per-track, with redundancy log log n + 4 were constructed. However, the code construction requires that k ≤ d. For k > d, the best known construction improves slightly over the classic one head deletion code. Here we address the question: What is the best redundancy that can be achieved for a k-deletion code (k is a constant) if the number of heads is fixed at d (due to area limitations)? Our key result is an answer to this question, namely, we construct codes that can correct k deletions, for any k beyond the known limit of d. The code has O(k4dlog log n) redundancy for the case when k ≤ 2d - 1. In addition, when k ≥ 2d, the code has 2⌊k/d⌋ log n + o(log n) redundancy.
从赛马场记忆中的删除中重建
DOI：
10.1109/itw.2018.8613352
发表时间：
2018
期刊：
Proceedings of the IEEE Information Theory Workshop (ITW
影响因子：
--
作者：
Chee, Yeow Meng;Gabrys, Ryan;Vardy, Alexander;Vu, Van Khu;Yaakobi, Eitan
通讯作者：
Yaakobi, Eitan
纠正赛道存储器中的有限移位错误的代码
DOI：
10.1109/isit.2018.8437483
发表时间：
2018
期刊：
Proceedings of the IEEE International Symposium on Information Theory (ISIT
影响因子：
--
作者：
Chee, Yeow Meng;Kiah, Han Mao;Vardy, Alexander;Van Vu, Khu;Yaakobi, Eitan
通讯作者：
Yaakobi, Eitan