Channel Coding Techniques for Low-Complexity Source Coding Applications

低复杂度源编码应用的通道编码技术

• 批准号: 9415860
• 负责人: Alexander Vardy
• 金额: $ 44.57万
• 依托单位: University of Illinois at Urbana-Champaign
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1995
• 资助国家: 美国
• 起止时间: 1995-08-01 至 1999-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9415860&HistoricalAwards=false
• 关键词: Channel; Coding; Techniques; Low; Complexity

9415860 Zeger The goal of the project is to develop effective joint source-channel coding techniques. The main objectives are to achieve a deep theoretical understanding of combined source-channel codes and to develop practical algorithms that can effectively be used in real applications such as low-bandwidth video compression and low-delay speech coding. Very narrow bandwidth transmission channels, such as mobile cellular telephony, require efficient coding schemes to protect the transmitted source information from the corruptive effects of channel errors. Some previous work on joint source-channel coding has yielded limited success at protecting source coded information. In particular, low complexity techniques are needed for low delay real time implementations. This project will investigate channel coding techniques for source coding applications with an emphasis on image, video, and speech coding applications. A summary of the topics to be investigated is: Classes of low-complexity redundancy free codes for discrete memoryless channels; error control coding will be incorporated into the source code design and the index assignment problem will be addressed for codes with redundancy. High resolution quantizer theory will be studied for sources transmitting across noisy channels. Some preliminary results give useful formulas for randomized index assignments, but a much stronger theory is needed for optimal index assignment. Lattice codes will be studied both for quantization and channel coding. A goal will be to develop efficient encoding algorithms for lattice source codes (respectively, decoding algorithms for channel codes). Preliminary results so far have yielded very fast algorithms for the Leech lattice, as well as some of the best-known low dimensional lattices. Efficient decoding techniques will be developed for channel codes in Euclidean space using specific source coding information. In particular, trellis decoding algorithms and theory will be studied for unequal input probabilities and unequal error protection. This is currently an unsolved problem though extensions of techniques from traditional decoding algorithms have yielded some limited preliminary success. ***

小行星9415860 该项目的目标是开发有效的联合信源信道编码技术。主要目标是实现一个深刻的理论理解组合源信道编码和开发实用的算法，可以有效地用于真实的应用，如低带宽视频压缩和低延迟语音编码。诸如移动的蜂窝电话之类的非常窄带宽的传输信道需要有效的编码方案来保护所传输的源信息不受信道差错的破坏性影响。联合信源信道编码的一些先前工作在保护信源编码信息方面取得了有限的成功。特别地，低延迟真实的时间实现需要低复杂度技术。本计画将探讨来源编码应用的通道编码技术，重点在影像、视讯及语音编码应用。 一个总结的主题进行调查是：类低复杂度的冗余自由码离散无记忆通道;错误控制编码将被纳入源代码设计和索引分配问题将解决的代码冗余。 高分辨率量化器的理论将被研究的源传输通过噪声信道。一些初步的结果给出了有用的公式随机索引分配，但更强的理论需要最优的索引分配。 格码将被研究用于量化和信道编码。一个目标将是开发有效的编码算法的格源代码（分别为信道码的解码算法）。到目前为止，初步的结果已经产生了非常快的算法的水蛭格，以及一些最著名的低维格。 有效的解码技术将在欧几里德空间中使用特定的信源编码信息的信道码开发。 特别是，网格解码算法和理论将研究不等输入概率和不等错误保护。这是一个目前尚未解决的问题，虽然从传统的解码算法的技术扩展已经取得了一些有限的初步成功。 ***