Code Representation and Performance of Graph-Based Decoding

基于图的解码的代码表示和性能

• 批准号: 0829865
• 负责人: paul siegel
• 金额: $ 30万
• 依托单位: University of California-San Diego
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-01 至 2011-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0829865&HistoricalAwards=false
• 关键词: Code; Representation; Performance; Graph; Based

CCF-0829865Code Representation and Performance of Graph-Based DecodingPI: Paul H. Siegel, UC San DiegoAbstract: The discovery of channel codes that approach information-theoretic performance limits when paired with iterative graph-based decoding algorithms represents a major advance in coding theory and practice. Prime examples include turbo codes, low-density parity-check (LDPC) codes, and repeat-accumulate (RA) codes. These coding techniques and their variants have had a profound impact on data transmission applications, including deep space communications, digital video broadcasting, and mobile wireless telephony. They are also poised for use in other settings, such as high density digital data storage. What is common to these coding and decoding schemes is that their performance and implementation complexity depend not only on the code itself, but also on the choice of graphical representation of the code. This research studies the characteristics of code representations that influence the performance of iterative decoding algorithms, as well as methods for constructing the best representations. The research has two major thrusts. The first is the examination of combinatorial and graphical properties of linear code representations that serve as figures of merit for iterative decoder performance on several types of channels having theoretical and practical significance. The understanding of these properties guides improved code design as well as the development of new graph-based decoding strategies. The second thrust is the analysis and enhancement of decoders based upon linear programming. The research studies the adaptive introduction of constraints to reduce decoder complexity and to improve performance. It also considers new linear programming algorithms that exploit sparse code representations. A dynamic interplay between these two research thrusts is achieved by studying the relationship between iterative and linear programming decoders, as well as their application to equalization and detection for channels with memory.

CCF-0829865基于图的解码的代码表示和性能PI：Paul H.Siegel，UC San Diego摘要：当与迭代的基于图的解码算法配合使用时，发现接近信息论性能极限的信道码代表了编码理论和实践的重大进步。主要的例子包括Turbo码、低密度奇偶校验(LDPC)码和重复累加(RA)码。这些编码技术及其变体对数据传输应用产生了深远的影响，包括深空通信、数字视频广播和移动无线电话。它们还准备用于其他设置，如高密度数字数据存储。这些编码和解码方案的共同之处在于，它们的性能和实现复杂性不仅取决于代码本身，还取决于代码的图形表示的选择。本研究研究了影响迭代译码算法性能的码表示的特性，以及构造最佳表示的方法。这项研究有两个主要推动力。第一个是对线性码表示的组合和图形特性的检查，这些线性码表示用作在几种类型的信道上迭代译码性能的优值系数，具有理论和实际意义。对这些性质的理解指导了改进的代码设计以及新的基于图的解码策略的发展。第二个重点是基于线性规划的解码器的分析和改进。研究了自适应引入约束条件以降低译码复杂度和提高性能的方法。它还考虑利用稀疏代码表示法的新的线性规划算法。通过研究迭代译码和线性规划译码之间的关系，以及它们在有记忆信道的均衡和检测中的应用，实现了这两个研究推动力之间的动态相互作用。