{"title":"The state-dependent degraded broadcast diamond channel","authors":"Min Li, O. Simeone, A. Yener","doi":"10.1109/AusCTW.2013.6510045","DOIUrl":null,"url":null,"abstract":"A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has non-causal channel state information, the relays have no state information and the destination may or may not have state information. First, the capacity is found for the case where the destination has access to the state sequence. It is demonstrated that a joint message and state transmission scheme via binning is optimal. Next, for the case with state information at the source only, lower and upper bounds on the capacity are derived for the general discrete memoryless model. Achievable rates are then computed for the case in which the relays-to-destination cut is affected by an additive Gaussian state.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Australian Communications Theory Workshop (AusCTW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AusCTW.2013.6510045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has non-causal channel state information, the relays have no state information and the destination may or may not have state information. First, the capacity is found for the case where the destination has access to the state sequence. It is demonstrated that a joint message and state transmission scheme via binning is optimal. Next, for the case with state information at the source only, lower and upper bounds on the capacity are derived for the general discrete memoryless model. Achievable rates are then computed for the case in which the relays-to-destination cut is affected by an additive Gaussian state.