on the sparsity of a linear network code for broadcast systems.pptVIP

下载本文档

2
0
约9.55千字
约 38页
2016-03-05 发布于广东
举报
版权申诉

on the sparsity of a linear network code for broadcast systems.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

on the sparsity of a linear network code for broadcast systems

Existing encoding schemes (I) Random linear network codes. Encoding Phase 1: The source node first broadcast each packet. Phase 2: Sends encoded packets with coeff. randomly generated. Decode by Gaussian elimination. No feedback is required. Mar 2014 * Existing encoding schemes (II) Chunked code an extension of random linear network coding. Divide the source packets into chunks. Each chunk contains c packets. Apply random linear network coding to each chunk. The resulting encoding vectors are c-sparse. Feedback is not required. Mar 2014 * Existing encoding schemes (III) Instantly decodable network code Encoding Phase 1: The source packets are first broadcast once. Phase 2: Find a subset of users such that each of them can decode a source packet by transmitting an encoded packet. Decoding: The user in the target set can decode one packet immediately if the encoded packet is received successfully. Feedback is required. Mar 2014 * Existing encoding schemes (IV) LT code Use the robust soliton degree distribution in encoding No feedback is required. Mar 2014 * Comparison of complexity Mar 2014 * Scheme Encoding Decoding LT code O(N) O(N2) Random linear network code O(N) O(N3) Chunked code O(c ) O(c2 N) Instantly decodable network code O(K3N2) O( min(K,N) N) Optimal hitting method O(1.238N+K) O( min(K,N) N2) Greed hitting method O(K2 N2) O( min(K,N) N2) Completion time vs number of users(perfect feedback) Mar 2014 * Binary alphabet Mar 2014 * Completion time vs number of users(lossy feedback) Mar 2014 * Decoding time vs no. of users Mar 2014 * Encoding time vs no. of users Mar 2014 * Hamming weight vs no. of users Mar 2014 * Conclusion We investigate the issue of the generation of sparsest innovative encoding vectors which is proven to be NP-hard. A systematic way to generate the sparsest innovative encoding vectors is given. There is a tradeoff between encoding complexity, decoding complexity, and completion time. * Mar 2014 * Linear network code for erasure b