{"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}
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.