Source Coding with Delay and Complexity Constraints: Theory and Algorithms

具有延迟和复杂性约束的源编码：理论和算法

• 批准号: 217329-2013
• 负责人: Linder, Tamas
• 金额: $ 3.72万
• 依托单位: Queen's University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2014
• 资助国家: 加拿大
• 起止时间: 2014-01-01 至 2015-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=546579
• 关键词: Source; Coding; Delay; Complexity; Constraints

The goal of source coding is to give a compact representation of data (e.g., text, image, audio, video) from which the original data can be reconstructed either perfectly or in a perceptually indistinguishable manner. Source coding is a key component in contemporary information technologies as it facilitates the transmission of information-bearing signals over communication channels such as the Internet or wireless channels. The research will focus on new challenges arising in the analysis and design of lossy source coding algorithms that incorporate practical constraints on memory, complexity, and delay, in contrast with the more established traditional theory of source coding where such constraints are usually disregarded.

源编码的目标是给出数据的紧凑表示（例如，文本、图像、音频、视频），根据这些数据可以完美地或者以感知上不可区分的方式重构原始数据。信源编码是当代信息技术中的关键组成部分，因为它促进了信息承载信号在诸如因特网或无线信道的通信信道上的传输。这项研究将集中在有损信源编码算法的分析和设计中出现的新挑战，这些算法结合了对内存，复杂性和延迟的实际约束，而不是更成熟的传统信源编码理论，这些约束通常被忽视。