CAREER:Advances in Universal Data Compression with Applications to Joint Source and Channel Coding
CAREER:Advances in Universal Data Compression with Applications to Joint Source and Channel Coding
批准号:
0347969
负责人:
Gil Shamir
金额:
$40.06万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2003
资助国家:
美国
项目状态:
已结题
起止时间:
2003-12-15 至 2010-11-30
中文摘要
本研究的目的是开发数据压缩中几个未开发的领域,以及在其他应用中利用通用数据压缩技术,包括生物建模和联合信源信道编码的新方向。该研究集中在四个主题:(a)设计基于联合信源-信道通用信源码的编码,(B)研究大的和未知信源字母的通用压缩,(c)设计用于非传统的、但更现实的、具有实际实现的数据模型的高级通用编码技术,及(d)随机存取无损压缩的研究。联合信源中常用的技术-信道编码在恶劣的信道条件下存在严重的同步问题,并且在源统计未知时不能解决通用性问题。 本研究开发了解决这些问题的技术,甚至获得了冗余信道信息流的信道解码性能的“免费”增益。常见的压缩方案假设数据来自已知的字母表,它具有“标准”的固定或不断变化的统计模型,并且它由长序列组成。然而,(a)存在具有大的未知字母表的压缩应用,如文字压缩,其中单词构成字母表,(B)大多数真实的数据序列通常既不是静止的,也不是不断变化的统计,和(c)随机存取在大的压缩数据库中是必要的。研究者对这三个非传统问题进行了研究。研究工作结合了严格的理论结果,包括冗余和描述长度界限的发展,与实证测试,算法设计,重点是实际的低复杂度技术,并实现所提出的技术。最后,本研究还探讨了通用压缩技术在生物序列分割和建模中的应用。
英文摘要
The purpose of this research is to develop several unexplored areas indata compression, as well as to utilize universal data compressiontechniques in other applications including biological modelling and anovel direction of joint source-channel coding. The research focuses onfour topics: (a) design of joint source-channel universal source codebased codes, (b) study of universal compression for large and unknownsource alphabets, (c) design of advanced universal coding techniques fornon-traditional, yet more realistic, data models with practicalimplementations, and (d) the study of random access lossless compression.Common techniques in joint source-channel coding suffer fromsevere synchronization problems in bad channel conditions and donot address universality issues when the source statistics areunknown. This research develops techniques to combat theseproblems, and even attain "free" gain in channel decodingperformance for redundant channel information streams. Commoncompression schemes assume that the data is from a known alphabet,it has a "standard" stationary or constantly changingstatistical model, and it consists of a long sequence. However,(a) there exist compression applications with large unknownalphabets, such as text compression where the words constitute thealphabet, (b) most real data sequences are usually neither stationarynor of constantly varying statistics, and (c) random access isnecessary in large compressed data bases. The investigator studiesthese three non-traditional problems. The research work combinesthe development of rigorous theoretical results includingredundancy and description length bounds, with empirical testing,algorithm design with focus on practical low-complexitytechniques, and implementation of proposed techniques. Finally,the research also investigates the use of universal compressiontechniques to segmentation and modelling of biological sequences.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
海外基金