发送创新过程的有损版本在QG速率失真中是次优的

Kwang Taik Kim, T. Berger
{"title":"发送创新过程的有损版本在QG速率失真中是次优的","authors":"Kwang Taik Kim, T. Berger","doi":"10.1109/ISIT.2005.1523324","DOIUrl":null,"url":null,"abstract":"In the critical range O < D les Dc, the MSE rate-distortion function of a time-discrete stationary autoregressive Gaussian source is equal to that of a related time-discrete i.i.d. Gaussian source. This suggests that perhaps an optimum encoder should compute the related memoryless sequence from the given source sequence with memory and then use a code of rate R(D) to convey the memoryless sequence to the decoder with an MSE of D. In this scenario, the question is, \"for D les Dc can a D-admissible code for the original source be obtained via the R-D coding of the innovations process and additional post-processing at the decoder without having to provide any additional information of positive rate?\" We show that the answer of this question often is \"No\"","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Sending a lossy version of the innovations process is suboptimal in QG rate-distortion\",\"authors\":\"Kwang Taik Kim, T. Berger\",\"doi\":\"10.1109/ISIT.2005.1523324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the critical range O < D les Dc, the MSE rate-distortion function of a time-discrete stationary autoregressive Gaussian source is equal to that of a related time-discrete i.i.d. Gaussian source. This suggests that perhaps an optimum encoder should compute the related memoryless sequence from the given source sequence with memory and then use a code of rate R(D) to convey the memoryless sequence to the decoder with an MSE of D. In this scenario, the question is, \\\"for D les Dc can a D-admissible code for the original source be obtained via the R-D coding of the innovations process and additional post-processing at the decoder without having to provide any additional information of positive rate?\\\" We show that the answer of this question often is \\\"No\\\"\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在O < dles Dc的临界范围内,时间离散平稳自回归高斯源的MSE率失真函数等于相应的时间离散自回归高斯源的MSE率失真函数。这表明,也许最优的编码器应该从给定的具有内存的源序列中计算相关的无记忆序列,然后使用率为R(D)的码将该无记忆序列传递给MSE为D的解码器。在这种情况下,问题是:“对于dles Dc,是否可以通过创新过程的R-D编码和解码器的额外后处理获得原始来源的D-可接受代码,而无需提供任何额外的阳性率信息?”我们发现这个问题的答案通常是否定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sending a lossy version of the innovations process is suboptimal in QG rate-distortion
In the critical range O < D les Dc, the MSE rate-distortion function of a time-discrete stationary autoregressive Gaussian source is equal to that of a related time-discrete i.i.d. Gaussian source. This suggests that perhaps an optimum encoder should compute the related memoryless sequence from the given source sequence with memory and then use a code of rate R(D) to convey the memoryless sequence to the decoder with an MSE of D. In this scenario, the question is, "for D les Dc can a D-admissible code for the original source be obtained via the R-D coding of the innovations process and additional post-processing at the decoder without having to provide any additional information of positive rate?" We show that the answer of this question often is "No"
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信