一种新的具有共同信息的干扰信道可达速率区域

Yi Cao, Biao Chen, Junshan Zhang
{"title":"一种新的具有共同信息的干扰信道可达速率区域","authors":"Yi Cao, Biao Chen, Junshan Zhang","doi":"10.1109/WCNC.2007.388","DOIUrl":null,"url":null,"abstract":"In this paper, a new achievable rate region for general interference channels with common information is presented. Our result improves upon by applying simultaneous superposition coding over sequential superposition coding. A detailed computation and comparison of the achievable rate region for the Gaussian case is conducted. The proposed achievable rate region is shown to coincide with the capacity region of the strong interference case.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"A New Achievable Rate Region for Interference Channels with Common Information\",\"authors\":\"Yi Cao, Biao Chen, Junshan Zhang\",\"doi\":\"10.1109/WCNC.2007.388\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new achievable rate region for general interference channels with common information is presented. Our result improves upon by applying simultaneous superposition coding over sequential superposition coding. A detailed computation and comparison of the achievable rate region for the Gaussian case is conducted. The proposed achievable rate region is shown to coincide with the capacity region of the strong interference case.\",\"PeriodicalId\":292621,\"journal\":{\"name\":\"2007 IEEE Wireless Communications and Networking Conference\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Wireless Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2007.388\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Wireless Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2007.388","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

摘要

本文提出了具有共同信息的一般干扰信道的一种新的可达速率区域。通过在顺序叠加编码上应用同时叠加编码,我们的结果得到了改进。对高斯情况下的可达速率区域进行了详细的计算和比较。所提出的可达速率区域与强干扰情况下的容量区域一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A New Achievable Rate Region for Interference Channels with Common Information
In this paper, a new achievable rate region for general interference channels with common information is presented. Our result improves upon by applying simultaneous superposition coding over sequential superposition coding. A detailed computation and comparison of the achievable rate region for the Gaussian case is conducted. The proposed achievable rate region is shown to coincide with the capacity region of the strong interference case.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive Modulation for a Downlink Multicast Channel in OFDMA systems Networked Hearing Aids Using Wireless LAN Technologies Loop Delay Correction for Adaptive Digital Linearization of Power Amplifiers Design Small-Size and Wide-Band T-Shaped Patch Antenna on Ceramic Substrate A New Approach to QPSK: Mechanism and Implementation
×
引用
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