{"title":"On channels with asynchronous state information at the transmitter","authors":"M. Yemini, A. Somekh-Baruch, Amir Leshem","doi":"10.1109/EEEI.2012.6377017","DOIUrl":null,"url":null,"abstract":"A state dependent channel with asynchronous side information at the transmitter is introduced. It is assumed that the state information sequence is a possibly delayed version of the state sequence. The encoder and the decoder are aware of the fact that the state information might be delayed, and an upper bound on the delay is also known, but other than that, they are ignorant of the actual delay. We consider both the causal and the non-causal cases and present achievable rates for these channels, and the corresponding coding schemes. In the non-causal case, the coding scheme is based on an adaptation of the Gelfand-Pinsker binning scheme. In the causal case, we present a coding scheme whose structure depends on the values the delay may take. We further study the special case of the binary symmetric asynchronous state dependent channel with non-causal side information at the transmitter. Additionally, we find the capacity of the asynchronous Gelfand-Pinsker channel with feedback.","PeriodicalId":177385,"journal":{"name":"2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EEEI.2012.6377017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
A state dependent channel with asynchronous side information at the transmitter is introduced. It is assumed that the state information sequence is a possibly delayed version of the state sequence. The encoder and the decoder are aware of the fact that the state information might be delayed, and an upper bound on the delay is also known, but other than that, they are ignorant of the actual delay. We consider both the causal and the non-causal cases and present achievable rates for these channels, and the corresponding coding schemes. In the non-causal case, the coding scheme is based on an adaptation of the Gelfand-Pinsker binning scheme. In the causal case, we present a coding scheme whose structure depends on the values the delay may take. We further study the special case of the binary symmetric asynchronous state dependent channel with non-causal side information at the transmitter. Additionally, we find the capacity of the asynchronous Gelfand-Pinsker channel with feedback.