发布求助
文献互助 智能选刊 最新文献

2009 Data Compression Conference最新文献

筛选
英文 中文
Communicating the Difference of Correlated Gaussian Sources over a MAC 在MAC上通信相关高斯源的差异
2009 Data Compression Conference Pub Date : 2008-12-05 DOI: 10.1109/DCC.2009.17
R. Soundararajan, S. Vishwanath
{"title":"Communicating the Difference of Correlated Gaussian Sources over a MAC","authors":"R. Soundararajan, S. Vishwanath","doi":"10.1109/DCC.2009.17","DOIUrl":"https://doi.org/10.1109/DCC.2009.17","url":null,"abstract":"This paper considers the problem of transmitting the difference of two positively correlated Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC). The goal is to recover this difference within an average mean squared error distortion criterion. Each transmitter has access to only one of the two Gaussian sources and is limited by an average power constraint. In this work, a lattice coding scheme that achieves a distortion within a constant of a distortion lower bound is presented if the signal to noise ratio (SNR) is greater than a threshold. Further, uncoded transmission is shown to be worse in performance to lattice coding methods for correlation coefficients above a threshold. An alternative lattice coding scheme is also presented that can potentially improve on the performance of uncoded transmission.","PeriodicalId":377880,"journal":{"name":"2009 Data Compression Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114288191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Low-Memory Adaptive Prefix Coding 低内存自适应前缀编码
2009 Data Compression Conference Pub Date : 2008-11-21 DOI: 10.1109/DCC.2009.61
T. Gagie, Marek Karpinski, Yakov Nekrich
{"title":"Low-Memory Adaptive Prefix Coding","authors":"T. Gagie, Marek Karpinski, Yakov Nekrich","doi":"10.1109/DCC.2009.61","DOIUrl":"https://doi.org/10.1109/DCC.2009.61","url":null,"abstract":"In this paper we study the adaptive prefix coding problem in  cases where the size of the input alphabet is large.  We present an online prefix coding algorithm that uses  $O(sigma^{1 / lambda + epsilon}) $ bits of space for any constants $eps≫0$, $lambda≫1$, and encodes the string of symbols in  $O(log log sigma)$ time per symbol  emph{in the worst case}, where $sigma$ is  the size of the alphabet.  The upper bound on the encoding length is  $lambda n H (s) +(lambda / ln 2 + 2 + epsilon) n +  O (sigma^{1 / lambda} log^2 sigma)$ bits.","PeriodicalId":377880,"journal":{"name":"2009 Data Compression Conference","volume":"84 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130067961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信