不相等擦除保护的部分可解码可扩展源的机会解码

Jie Xu, G. Tu, Yu Jiang
{"title":"不相等擦除保护的部分可解码可扩展源的机会解码","authors":"Jie Xu, G. Tu, Yu Jiang","doi":"10.1145/1641913.1641922","DOIUrl":null,"url":null,"abstract":"To provide unequal erasure protection to scalable codes, a general framework has been proposed in [1] and it has become the foundation of following research in this literature. In this paper, we make opportunistic utilization of received packets under the same framework. Specifically, we extract those non-decodable original symbols in received packets by taking advantage of the joint coding structure. By regulating the scalable codes to partially-decodable scalable codes, these original symbols can be used to improve the quality of reconstructed source. Further more, we formulate the opportunistic unequal erasure protection and analyze the relationship between optimal unequal erasure protection (OP) and opportunistic optimal unequal erasure protection (OOP). Based on the analysis result, a simple algorithm is proposed to find the optimal protection which maximizes the expected quality of reconstructed source. Finally, experiment results are presented which verify the improvement of opportunistic utilization over traditional unequal erasure protection.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"26 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Opportunistic decoding of unequal erasure protected partially-decodable scalable source\",\"authors\":\"Jie Xu, G. Tu, Yu Jiang\",\"doi\":\"10.1145/1641913.1641922\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To provide unequal erasure protection to scalable codes, a general framework has been proposed in [1] and it has become the foundation of following research in this literature. In this paper, we make opportunistic utilization of received packets under the same framework. Specifically, we extract those non-decodable original symbols in received packets by taking advantage of the joint coding structure. By regulating the scalable codes to partially-decodable scalable codes, these original symbols can be used to improve the quality of reconstructed source. Further more, we formulate the opportunistic unequal erasure protection and analyze the relationship between optimal unequal erasure protection (OP) and opportunistic optimal unequal erasure protection (OOP). Based on the analysis result, a simple algorithm is proposed to find the optimal protection which maximizes the expected quality of reconstructed source. Finally, experiment results are presented which verify the improvement of opportunistic utilization over traditional unequal erasure protection.\",\"PeriodicalId\":311005,\"journal\":{\"name\":\"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks\",\"volume\":\"26 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1641913.1641922\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1641913.1641922","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了给可伸缩代码提供不相等擦除保护,[1]中提出了一个通用框架,并成为本文后续研究的基础。在本文中,我们在相同的框架下对接收到的数据包进行机会利用。具体来说,我们利用联合编码结构提取接收到的数据包中不可解码的原始符号。通过将可伸缩码调整为部分可解码的可伸缩码,可以利用这些原始符号来提高重构码的质量。在此基础上,提出了机会不等擦除保护,并分析了最优不等擦除保护(OP)与机会最优不等擦除保护(OOP)之间的关系。在分析结果的基础上,提出了一种简单的算法来寻找重构源期望质量最大的最优保护。最后给出了实验结果,验证了机会利用比传统的不等擦除保护的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Opportunistic decoding of unequal erasure protected partially-decodable scalable source
To provide unequal erasure protection to scalable codes, a general framework has been proposed in [1] and it has become the foundation of following research in this literature. In this paper, we make opportunistic utilization of received packets under the same framework. Specifically, we extract those non-decodable original symbols in received packets by taking advantage of the joint coding structure. By regulating the scalable codes to partially-decodable scalable codes, these original symbols can be used to improve the quality of reconstructed source. Further more, we formulate the opportunistic unequal erasure protection and analyze the relationship between optimal unequal erasure protection (OP) and opportunistic optimal unequal erasure protection (OOP). Based on the analysis result, a simple algorithm is proposed to find the optimal protection which maximizes the expected quality of reconstructed source. Finally, experiment results are presented which verify the improvement of opportunistic utilization over traditional unequal erasure protection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信