多用户高斯并行中继网络

C. Sung, Ping Hu, K. Leung
{"title":"多用户高斯并行中继网络","authors":"C. Sung, Ping Hu, K. Leung","doi":"10.1109/ISITA.2008.4895548","DOIUrl":null,"url":null,"abstract":"For the multiuser parallel relay network in which two users want to communicate with a destination through a parallel relay channel, we propose several coding strategies and derive their achievable rate regions. The results are analyzed and the strategies are shown to approach or achieve the outer bound under certain channel conditions.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The multiuser Gaussian parallel relay network\",\"authors\":\"C. Sung, Ping Hu, K. Leung\",\"doi\":\"10.1109/ISITA.2008.4895548\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the multiuser parallel relay network in which two users want to communicate with a destination through a parallel relay channel, we propose several coding strategies and derive their achievable rate regions. The results are analyzed and the strategies are shown to approach or achieve the outer bound under certain channel conditions.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895548\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895548","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

针对多用户并行中继网络中两个用户希望通过并行中继信道与目标通信的情况,提出了几种编码策略,并推导了它们的可实现速率区域。对结果进行了分析,并表明在一定的信道条件下,这些策略可以接近或达到外界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The multiuser Gaussian parallel relay network
For the multiuser parallel relay network in which two users want to communicate with a destination through a parallel relay channel, we propose several coding strategies and derive their achievable rate regions. The results are analyzed and the strategies are shown to approach or achieve the outer bound under certain channel conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Capacity of a more general glass of relay channels The maximum achievable array gain under physical transmit power constraint Asymptotic performance bounds of joint channel estimation and multiuser detection in frequency-selective fading DS-CDMA channels On Tomlinson-Harashima precoding in 2-user degraded Gaussian broadcast channels A new class of cryptosystems based on Chinese remainder theorem
×
引用
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