{"title":"一类具有延迟的因果认知干扰通道的容量区域","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":"{\"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}","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}
Capacity regions for some classes of Causal Cognitive Interference Channels with delay
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.