arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1012.1895cs.ITmath.IT
收藏

一维颗粒磁介质高密度记录编码

Coding for High-Density Recording on a 1-D Granular Magnetic Medium

Arya Mazumdar, Alexander Barg, Navin Kashyap

摘要:

在太比特密度磁记录中,几位数据可以被存储介质中相邻数据的值替换。因此,介质中的错误相互依赖,也依赖于写入的数据。我们考虑这种介质的一个简单的一维组合模型。在我们的模型中,我们假设一个设置,其中二进制数据顺序写入介质上,并且一个位可能错误地更改为前一个值。我们推导出几个属性的代码,纠正这种类型的错误,专注于他们的基数上的界限。我们还定义了一个概率有限状态信道模型的存储介质,并得出其容量的上下估计。通过评估信道的对称容量来导出下限,即,在信道的均匀输入分布的假设下的最大传输速率。一个上界发现,原来的通道是一个随机退化的另一个,相关的信道模型,其容量,我们可以明确计算。

英文摘要:

In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a simple one-dimensional combinatorial model of this medium. In our model, we assume a setting where binary data is sequentially written on the medium and a bit can erroneously change to the immediately preceding value. We derive several properties of codes that correct this type of errors, focusing on bounds on their cardinality. We also define a probabilistic finite-state channel model of the storage medium, and derive lower and upper estimates of its capacity. A lower bound is derived by evaluating the symmetric capacity of the channel, i.e., the maximum transmission rate under the assumption of the uniform input distribution of the channel. An upper bound is found by showing that the original channel is a stochastic degradation of another, related channel model whose capacity we can compute explicitly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑