Achieving Full Rate Network Coding with Constellation Compatible Modulation and Coding

Suhua Tang, H. Yomo, T. Ueda, R. Miura, S. Obana
{"title":"Achieving Full Rate Network Coding with Constellation Compatible Modulation and Coding","authors":"Suhua Tang, H. Yomo, T. Ueda, R. Miura, S. Obana","doi":"10.1109/GLOCOM.2010.5684262","DOIUrl":null,"url":null,"abstract":"Network coding is an effective method to improving relay efficiency by reducing the number of transmissions. However, its performance is limited by several factors such as packet length mismatch and rate mismatch. Although the former may be solved by re-framing, the latter remains a challenge and is likely to greatly degrade the efficiency of network coding. In this paper, we re-interpret network coding as a mapping of modulation constellation. On this basis, we extend such mapping to enable simultaneous use of different modulations by nesting the low-level constellation as a subset of the high level constellation. When relay links have different qualities, the messages of different flows are combined together in such a way that for each relay link its desired message is transmitted at its own highest rate. Compared with previous solutions to rate mismatch, the proposed scheme achieves the full rate of all relay links on the broadcast channel.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2010.5684262","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Network coding is an effective method to improving relay efficiency by reducing the number of transmissions. However, its performance is limited by several factors such as packet length mismatch and rate mismatch. Although the former may be solved by re-framing, the latter remains a challenge and is likely to greatly degrade the efficiency of network coding. In this paper, we re-interpret network coding as a mapping of modulation constellation. On this basis, we extend such mapping to enable simultaneous use of different modulations by nesting the low-level constellation as a subset of the high level constellation. When relay links have different qualities, the messages of different flows are combined together in such a way that for each relay link its desired message is transmitted at its own highest rate. Compared with previous solutions to rate mismatch, the proposed scheme achieves the full rate of all relay links on the broadcast channel.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
星座兼容调制编码实现全速率网络编码
网络编码是通过减少传输次数来提高中继效率的有效方法。但是,它的性能受到数据包长度不匹配和速率不匹配等因素的限制。虽然前者可以通过重帧来解决,但后者仍然是一个挑战,并且可能会大大降低网络编码的效率。本文将网络编码重新解释为调制星座的映射。在此基础上,我们扩展了这种映射,通过将低级星座嵌套为高级星座的子集来实现不同调制的同时使用。当中继链路具有不同的质量时,不同流的消息以这样一种方式组合在一起,即对于每个中继链路,其所需的消息以其自己的最高速率传输。与以往的速率失配解决方案相比,该方案实现了广播信道上所有中继链路的全速率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Channel Code Aided Decision-Directed Channel Estimation for MIMO OFDM/SDMA Systems Based on the "Expectation-Conditional Maximization Either" Algorithm Large File Transfers from Space Using Multiple Ground Terminals and Delay-Tolerant Networking Platforms and Software Systems for an Autonomic Internet Multiple-Description Speech Coding Using Speech-Polarity Decomposition On Fairness and Locality in P2P-TV through Large-Scale Measurement Experiment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1