Capacity regions for some classes of Causal Cognitive Interference Channels with delay

M. Mirmohseni, Bahareh Akhbari, M. Aref
{"title":"Capacity regions for some classes of Causal Cognitive Interference Channels with delay","authors":"M. Mirmohseni, Bahareh Akhbari, M. Aref","doi":"10.1109/CIG.2010.5592689","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate Causal Cognitive Interference Channel (CC-IFC) with delay in which the cognitive user transmission can depend on L future received symbols as well as the past ones. We study two special cases: CC-IFC without delay (L = 1), where the cognitive user can use only current and past received symbols, and CC-IFC with a block length delay (L = n), wherein the entire received sequence can be used. In each case, we obtain an inner bound on the capacity region. Our coding schemes are based on the generalized block Markov superposition coding and instantaneous relaying for CC-IFC without delay, and non-causal partial Decode-and-Forward (DF) for CC-IFC with a block length delay. Further, providing converse proofs, we show that the derived inner bounds are tight in some cases. Hence, we characterize the capacity regions for the classes of degraded and semi-deterministic CC-IFC without delay and CC-IFC with a block length delay, under strong interference conditions.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592689","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, we investigate Causal Cognitive Interference Channel (CC-IFC) with delay in which the cognitive user transmission can depend on L future received symbols as well as the past ones. We study two special cases: CC-IFC without delay (L = 1), where the cognitive user can use only current and past received symbols, and CC-IFC with a block length delay (L = n), wherein the entire received sequence can be used. In each case, we obtain an inner bound on the capacity region. Our coding schemes are based on the generalized block Markov superposition coding and instantaneous relaying for CC-IFC without delay, and non-causal partial Decode-and-Forward (DF) for CC-IFC with a block length delay. Further, providing converse proofs, we show that the derived inner bounds are tight in some cases. Hence, we characterize the capacity regions for the classes of degraded and semi-deterministic CC-IFC without delay and CC-IFC with a block length delay, under strong interference conditions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一类具有延迟的因果认知干扰通道的容量区域
本文研究了具有延迟的因果认知干扰信道(CC-IFC),在这种信道中,认知用户的传输既依赖于过去的符号,也依赖于未来接收到的符号。我们研究了两种特殊情况:无延迟的CC-IFC (L = 1),其中认知用户只能使用当前和过去接收到的符号,以及具有块长度延迟的CC-IFC (L = n),其中可以使用整个接收序列。在每种情况下,我们都得到了容量区域的内界。我们的编码方案基于无延迟CC-IFC的广义块马尔可夫叠加编码和瞬时中继,以及具有块长度延迟的CC-IFC的非因果部分解码和转发(DF)。进一步,我们提供了相反的证明,证明了在某些情况下推导出的内界是紧的。因此,我们描述了在强干扰条件下退化和半确定性无延迟CC-IFC和具有块长度延迟CC-IFC的容量区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Identification codes in cryptographic protocols Information-theoretical analysis of private content identification Secure type-based multiple access: Transmission strategy and analysis for perfect secrecy Computation of the robust symmetrical number system dynamic range Information sets for abelian codes
×
引用
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