Insertion/Deletion Channels: Achievable Rates and Practical Coding Schemes

插入/删除通道：可实现的速率和实用的编码方案

• 批准号: 0830611
• 负责人: Tolga Duman
• 金额: $ 27万
• 依托单位: Arizona State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-01 至 2012-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0830611&HistoricalAwards=false
• 关键词: Insertion; Deletion; Channels; Achievable; Rates

For over half a century various digital communication techniques have been developed to address reliable transmission over imperfect links. These developments include information theory, practical source and channel coding schemes, and various effective modulation techniques. Many different channel models are considered in the literature extensively, and devised solutions have been put to efficient practical use; impacting all aspects of the world we live in today. Random insertions and/or deletions in addition to other, better understood, channel impairments (e.g. noise, intersymbol interference, etc.) are of utmost concern in many modern digital communication systems, including recording channels, transmissions through the Internet, character recognition systems, covert communications, and so on. The presence of insertions/deletions is often the bottleneck for more efficient reliable communications and higher areal densities in recording. Despite many advances over the past fifty years, channels with deletions/insertions are still far from being fully understood. To give a simple example, the capacity of a binary deletion channel is still unknown, and no practical coding/decoding schemes with performance close to available theoretical bounds are available. This project studies insertion/deletion channels from both an information theoretic point of view, and a channel coding perspective. Specifically, it involves development of novel information theoretic results and practical coding schemes for such channels, with extensions to channels with intersymbol interference, additive noise, and other impairments. Capacity approaching low density parity check (LDPC) and turbo coding schemes are considered. In addition, a new set of interesting problems involving insertions/deletions over wireless fading channels, including multi-input multi-output (MIMO) communications, are formulated, and solutions are developed.

半个多世纪以来，已经开发了各种数字通信技术来解决在不完美链路上的可靠传输。这些发展包括信息理论、实用的信源和信道编码方案以及各种有效的调制技术。许多不同的渠道模式在文献中被广泛考虑，设计的解决方案已经被有效地实际使用，影响到我们今天生活的世界的方方面面。除了其他更好理解的信道损害(例如，噪声、码间干扰等)之外的随机插入和/或删除。在许多现代数字通信系统中，包括记录通道、通过互联网的传输、字符识别系统、隐蔽通信等，都是最受关注的。插入/删除的存在通常是更高效、可靠的通信和更高的记录区域密度的瓶颈。尽管在过去的五十年里取得了许多进展，但缺失/插入的通道仍然远未被完全理解。举一个简单的例子，二进制删除信道的容量仍然是未知的，并且没有性能接近可用的理论界限的实际编解码方案可用。本课题从信息论和频道编码两个角度对插入/删除频道进行研究。具体地说，它涉及开发用于这种信道的新的信息论结果和实用编码方案，并扩展到具有码间干扰、加性噪声和其他损害的信道。容量接近低密度奇偶校验(LDPC)和Turbo编码方案被考虑。此外，还提出了一组新的涉及无线衰落信道(包括多输入多输出(MIMO)通信)中的插入/删除的有趣问题，并给出了解决方案。