{"title":"具有信道状态信息的复合多址信道的可实现速率区域","authors":"Mostafa Monemizadeh, G. Hodtani","doi":"10.1109/ITW.2012.6404764","DOIUrl":null,"url":null,"abstract":"We study the two-user discrete memoryless compound multiple access channel (MAC) with common message and two specially correlated channel states each known non-causally by one of the encoders. Two channel states are correlated in the sense of Slepian-Wolf (SW) in which two correlated states are modeled by three independent states: a common state and two private states. By using superposition coding, binning scheme and jointly decoding, we propose several achievable rates for various cases of the two-user compound MAC with non-causal Slepian-Wolf channel states available at encoders and common message or conferencing encoders. Also, we show that the obtained achievable rate regions are optimal when perfect states are known at both decoders as well.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Achievable rate regions for compound multiple access channel with channel state information\",\"authors\":\"Mostafa Monemizadeh, G. Hodtani\",\"doi\":\"10.1109/ITW.2012.6404764\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the two-user discrete memoryless compound multiple access channel (MAC) with common message and two specially correlated channel states each known non-causally by one of the encoders. Two channel states are correlated in the sense of Slepian-Wolf (SW) in which two correlated states are modeled by three independent states: a common state and two private states. By using superposition coding, binning scheme and jointly decoding, we propose several achievable rates for various cases of the two-user compound MAC with non-causal Slepian-Wolf channel states available at encoders and common message or conferencing encoders. Also, we show that the obtained achievable rate regions are optimal when perfect states are known at both decoders as well.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404764\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Achievable rate regions for compound multiple access channel with channel state information
We study the two-user discrete memoryless compound multiple access channel (MAC) with common message and two specially correlated channel states each known non-causally by one of the encoders. Two channel states are correlated in the sense of Slepian-Wolf (SW) in which two correlated states are modeled by three independent states: a common state and two private states. By using superposition coding, binning scheme and jointly decoding, we propose several achievable rates for various cases of the two-user compound MAC with non-causal Slepian-Wolf channel states available at encoders and common message or conferencing encoders. Also, we show that the obtained achievable rate regions are optimal when perfect states are known at both decoders as well.