Coding for Ultra-Fast High-Density Recording Systems

摘要：随着记录技术的进一步成熟，用于记录通道的更复杂的编码算法正在挑战集成电路制造技术的极限。编码理论中最新的主要概念进展，包括迭代译码、图上的编码以及约束编码，主要受到现代记录系统的速度和记录密度要求的限制。这项研究正在为超高速高密度记录系统开发编码方案，这些方案可以使自己适合于非常低的复杂性实现。研究的重点是不使用随机交织器或随机稀疏奇偶校验矩阵就可以构造出好的码。这些构造基于组合设计和有限几何。这种码具有结构简单和定义良好的特点，这意味着译码复杂度较低。这种方法还在选择代码参数方面提供了很大的灵活性。本研究中涉及的基本码构造问题包括理解好的码的结构以及在码长、码率和码结构之间的权衡，以及将码与部分响应信道进行匹配。本研究研究的第二类码是约束码和图约束码。

Abstract: As the recording technology further matures, more complex codingalgorithms for recording channels are challenging integrated circuitmanufacturing technology limits. The implementation of recent majorconceptual advances in coding theory, including iterative decoding,codes on graphs as well as constrained codes, has been limited mainly bythe speed and recording density requirements of modern recordingsystems. This research is developing coding schemes forultra-fast high-density recording systems that can lend themselves tovery low complexity implementations. The focus of the research is the idea that good codes can beconstructed without using random interleavers or random sparse paritycheck matrices. The constructions are based on combinatorialdesigns and finite geometries. Such codes have a simple and well-definedstructure, which means lower decoder complexity. This approach alsooffers a large flexibility in choosing code parameters. The fundamentalcode construction issues addressed in this research includeunderstanding a structure of good codes and tradeoffs among code length,rate and structure as well as matching a code to a partial responsechannel. The second class of codes studied in this research areconstrained codes and graph constrained codes.