高斯干扰信道上辅助用户的可访问容量

Xiujie Huang, Xiao Ma, Lei Lin, B. Bai
{"title":"高斯干扰信道上辅助用户的可访问容量","authors":"Xiujie Huang, Xiao Ma, Lei Lin, B. Bai","doi":"10.1109/ISIT.2011.6034248","DOIUrl":null,"url":null,"abstract":"A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder that were originally designed to satisfy a given error performance requirement (EPR) under the assumption that no interference exists. In the case when the secondary users attempt to access the same medium, we are interested in the maximum transmission rate (defined as accessible capacity) at which secondary users can communicate reliably without affecting the EPR under the constraint that the primary encoder (not the decoder) is kept unchanged. The relation of the accessible capacity to the capacity region of the GIFC is revealed. By modeling the primary encoder as a generalized trellis code (GTC), we are able to treat the secondary links as finite state channels. Then upper and lower bounds on the accessible capacity are derived and computed by using the BCJR algorithm. The numerical results show us either expected or interesting facts.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Accessible capacity of secondary users over the Gaussian interference channel\",\"authors\":\"Xiujie Huang, Xiao Ma, Lei Lin, B. Bai\",\"doi\":\"10.1109/ISIT.2011.6034248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder that were originally designed to satisfy a given error performance requirement (EPR) under the assumption that no interference exists. In the case when the secondary users attempt to access the same medium, we are interested in the maximum transmission rate (defined as accessible capacity) at which secondary users can communicate reliably without affecting the EPR under the constraint that the primary encoder (not the decoder) is kept unchanged. The relation of the accessible capacity to the capacity region of the GIFC is revealed. By modeling the primary encoder as a generalized trellis code (GTC), we are able to treat the secondary links as finite state channels. Then upper and lower bounds on the accessible capacity are derived and computed by using the BCJR algorithm. The numerical results show us either expected or interesting facts.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6034248\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6034248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种新的高斯干涉信道(gfc)的问题公式,其中有两对用户,分别被区分为主用户和次用户。主要用户使用一对编码器和解码器,这对编码器和解码器最初设计是为了满足给定的错误性能要求(EPR),假设不存在干扰。在次要用户尝试访问同一介质的情况下,我们感兴趣的是最大传输速率(定义为可访问容量),在主编码器(而不是解码器)保持不变的约束下,次要用户可以在不影响EPR的情况下可靠地通信。揭示了gfc的可达容量与容量区域的关系。通过将主编码器建模为广义网格码(GTC),我们能够将次要链路视为有限状态通道。然后利用BCJR算法推导并计算了可访问容量的上下界。数值结果向我们展示了预期的或有趣的事实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accessible capacity of secondary users over the Gaussian interference channel
A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder that were originally designed to satisfy a given error performance requirement (EPR) under the assumption that no interference exists. In the case when the secondary users attempt to access the same medium, we are interested in the maximum transmission rate (defined as accessible capacity) at which secondary users can communicate reliably without affecting the EPR under the constraint that the primary encoder (not the decoder) is kept unchanged. The relation of the accessible capacity to the capacity region of the GIFC is revealed. By modeling the primary encoder as a generalized trellis code (GTC), we are able to treat the secondary links as finite state channels. Then upper and lower bounds on the accessible capacity are derived and computed by using the BCJR algorithm. The numerical results show us either expected or interesting facts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信