Multiaccess Channels with State Known to Some Encoders and Independent Messages

• Published in: EURASIP journal on wireless communications and networking 2008-01, Vol.2008 (1), Article 450680
• Main Authors: Kotagiri, Shiva Prasad, Laneman, J. Nicholas
• Format: Article
• Language: English
• Subjects: Communications Engineering; Engineering; Information Systems Applications (incl.Internet); Networks; Research Article; Signal,Image and Speech Processing; Theory and Applications in Multiuser/Multiterminal Communications
• ISSN: 1687-1499; 1687-1472; 1687-1499
• DOI: 10.1155/2008/450680

We consider a state-dependent multiaccess channel (MAC) with state noncausally known to some encoders. For simplicity of exposition, we focus on a two-encoder model in which one of the encoders has noncausal access to the channel state. The results can in principle be extended to any number of encoders with a subset of them being informed. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In binary noiseless case, we compare the inner bounds with trivial outer bounds obtained by providing the channel state to the decoder. In the case of maximum entropy channel state, we obtain the capacity region for binary noiseless MAC with one informed encoder. For a Gaussian state-dependent MAC with one encoder being informed of the channel state, we present an inner bound by applying a slightly generalized dirty paper coding (GDPC) at the informed encoder and a trivial outer bound by providing channel state to the decoder also. In particular, if the channel input is negatively correlated with the channel state in the random coding distribution, then GDPC can be interpreted as partial state cancellation followed by standard dirty paper coding. The uninformed encoders benefit from the state cancellation in terms of achievable rates, however, it seems that GDPC cannot completely eliminate the effect of the channel state on the achievable rate region, in contrast to the case of all encoders being informed. In the case of infinite state variance, we provide an inner bound and also provide a nontrivial outer bound for this case which is better than the trivial outer bound.