基于因子图的物理网络编码联合译码转发策略

F. Lehmann
{"title":"基于因子图的物理网络编码联合译码转发策略","authors":"F. Lehmann","doi":"10.1109/WCNC.2012.6214197","DOIUrl":null,"url":null,"abstract":"We consider physical network coding on a two-way relay channel. Two source nodes send their packets simultaneously over time-varying MIMO channels to a relay node. Assuming that the relay employs the joint decode-and-forward strategy, the relay must be able to decode the individual source packets. This task requires a robust estimation of the source-to-relay channels. We design a message passing algorithm based on factor-graphs to solve this problem efficiently.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A joint decode-and-forward strategy for physical network coding based on factor graphs\",\"authors\":\"F. Lehmann\",\"doi\":\"10.1109/WCNC.2012.6214197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider physical network coding on a two-way relay channel. Two source nodes send their packets simultaneously over time-varying MIMO channels to a relay node. Assuming that the relay employs the joint decode-and-forward strategy, the relay must be able to decode the individual source packets. This task requires a robust estimation of the source-to-relay channels. We design a message passing algorithm based on factor-graphs to solve this problem efficiently.\",\"PeriodicalId\":329194,\"journal\":{\"name\":\"2012 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"163 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2012.6214197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2012.6214197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们考虑在双向中继信道上的物理网络编码。两个源节点通过时变MIMO信道同时向中继节点发送它们的数据包。假设中继采用联合解码转发策略,中继必须能够解码单个源数据包。这项任务需要对源到中继信道进行可靠的估计。为了有效地解决这一问题,我们设计了一种基于因子图的消息传递算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A joint decode-and-forward strategy for physical network coding based on factor graphs
We consider physical network coding on a two-way relay channel. Two source nodes send their packets simultaneously over time-varying MIMO channels to a relay node. Assuming that the relay employs the joint decode-and-forward strategy, the relay must be able to decode the individual source packets. This task requires a robust estimation of the source-to-relay channels. We design a message passing algorithm based on factor-graphs to solve this problem efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信