Rateless codes for single-server streaming to diverse users

Yao Li, E. Soljanin
{"title":"Rateless codes for single-server streaming to diverse users","authors":"Yao Li, E. Soljanin","doi":"10.1109/ALLERTON.2009.5394508","DOIUrl":null,"url":null,"abstract":"We investigate the performance of rateless codes for single-server streaming to diverse users, assuming that diversity in users is present not only because they have different channel conditions, but also because they demand different amounts of information and have different decoding capabilities. The LT encoding scheme is employed. While some users accept output symbols of all degrees and decode using belief propagation, others only collect degree-1 output symbols and run no decoding algorithm. We propose several performance measures, and optimize the performance of the rateless code used at the server through the design of the code degree distribution. Optimization problems are formulated for the asymptotic regime and solved as linear programming problems. Optimized performance shows great improvement in total bandwidth consumption over using the conventional ideal soliton distribution, or simply sending separately encoded streams to different types of user nodes. Simulation experiments confirm the usability of the optimization results obtained for the asymptotic regime as a guideline for finite-length code design.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2009.5394508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

We investigate the performance of rateless codes for single-server streaming to diverse users, assuming that diversity in users is present not only because they have different channel conditions, but also because they demand different amounts of information and have different decoding capabilities. The LT encoding scheme is employed. While some users accept output symbols of all degrees and decode using belief propagation, others only collect degree-1 output symbols and run no decoding algorithm. We propose several performance measures, and optimize the performance of the rateless code used at the server through the design of the code degree distribution. Optimization problems are formulated for the asymptotic regime and solved as linear programming problems. Optimized performance shows great improvement in total bandwidth consumption over using the conventional ideal soliton distribution, or simply sending separately encoded streams to different types of user nodes. Simulation experiments confirm the usability of the optimization results obtained for the asymptotic regime as a guideline for finite-length code design.
单服务器流到不同用户的无速率代码
我们研究了单服务器流到不同用户的无速率码的性能,假设用户的多样性不仅是因为他们有不同的信道条件,而且还因为他们需要不同数量的信息并具有不同的解码能力。采用LT编码方案。有的用户接受所有度数的输出符号,使用信念传播进行解码,有的用户只采集度数为1的输出符号,不运行解码算法。提出了几种性能度量方法,并通过设计代码度分布来优化服务器端使用的无速率代码的性能。对于渐近区域,将最优化问题表述为线性规划问题。优化后的性能显示,与使用传统的理想孤子分布或简单地将单独编码的流发送到不同类型的用户节点相比,总带宽消耗有了很大的改善。仿真实验验证了所得到的渐近区间优化结果对有限长度码的设计具有指导意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信