Price of perfection: Limited prediction for streaming over erasure channels

F. Etezadi, A. Khisti, Jun Chen
{"title":"Price of perfection: Limited prediction for streaming over erasure channels","authors":"F. Etezadi, A. Khisti, Jun Chen","doi":"10.1109/ISIT.2015.7282684","DOIUrl":null,"url":null,"abstract":"We study sequential transmission of Gauss-Markov sources over erasure channels under a zero decoding delay constraint. A two-stage coding scheme which can be described as a hybrid between predictive coding with limited past and quantization & binning is proposed. This scheme can achieve significant performance gains over baseline schemes in simulations involving i.i.d. erasure channels, and in certain regimes can attain performance close to a fundamental lower bound. We consider an information theoretic model for streaming that explains the weakness of baseline schemes (e.g., predictive coding, memoryless binning, etc.) and illustrates the advantage of our proposed hybrid scheme over these. Techniques from multi-terminal source coding are used to derive a new lower bound on the compression rate and identify cases when the hybrid coding scheme is close to optimal. We discuss qualitatively the interplay between the parameters of our information theoretic model and the statistical models used in simulations.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2015.7282684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We study sequential transmission of Gauss-Markov sources over erasure channels under a zero decoding delay constraint. A two-stage coding scheme which can be described as a hybrid between predictive coding with limited past and quantization & binning is proposed. This scheme can achieve significant performance gains over baseline schemes in simulations involving i.i.d. erasure channels, and in certain regimes can attain performance close to a fundamental lower bound. We consider an information theoretic model for streaming that explains the weakness of baseline schemes (e.g., predictive coding, memoryless binning, etc.) and illustrates the advantage of our proposed hybrid scheme over these. Techniques from multi-terminal source coding are used to derive a new lower bound on the compression rate and identify cases when the hybrid coding scheme is close to optimal. We discuss qualitatively the interplay between the parameters of our information theoretic model and the statistical models used in simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
完美的代价:对通过擦除频道的流媒体的有限预测
研究了零解码延时条件下高斯-马尔可夫源在擦除信道上的顺序传输。提出了一种混合了有限过去预测编码和量化分箱的两阶段编码方案。在涉及i.i.d擦除信道的模拟中,该方案可以获得比基线方案显著的性能提升,并且在某些情况下可以获得接近基本下界的性能。我们考虑了流的信息论模型,该模型解释了基线方案(例如,预测编码,无内存分组等)的弱点,并说明了我们提出的混合方案相对于这些方案的优势。利用多终端源编码技术推导出新的压缩率下界,并识别出混合编码方案接近最优的情况。我们定性地讨论了我们的信息理论模型和仿真中使用的统计模型的参数之间的相互作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Locally recoverable codes on algebraic curves Weight distributions of non-binary multi-edge type LDPC code ensembles A geometric analysis of the AWGN channel with a (σ, ρ)-power constraint Converse and duality results for combinatorial source-channel coding in binary Hamming spaces Price of perfection: Limited prediction for streaming over erasure channels
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1