Coding for Ultra-Fast High-Density Recording Systems

超快高密度记录系统编码

• 批准号: 0208597
• 负责人: Bane Vasic
• 金额: $ 22.5万
• 依托单位: University of Arizona
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-07-01 至 2007-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0208597&HistoricalAwards=false
• 关键词: Coding; Ultra; Fast; Density; Recording

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.

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