Sharif Digital Repository

In this work, we consider an additive state-dependent Gaussian interference channel (ASD-GIC) where there is a common additive interference, known to both transmitters but not to the receivers. First, we obtain an outer bound on the sum-capacity for the asymptotic case where the interference is assumed to be Gaussian variable with unbounded variance. This asymptotic case has been referred to as the "strong interference" in [1]. By applying a lattice-based coding scheme, an achievable rate-region is provided. Under some conditions, which depend on the noise variance and channel power constraints, this achievable sum-rate region meets the outer bound and therefore lattice codes can achieve the... 

We consider a two-user state-dependent generalized multiple access channel (GMAC) with correlated channel state information (CSI). It is assumed that the CSI is partially known at each encoder noncausally. We first present an achievable rate region using multi-layer Gelfand-Pinsker coding with partial state and message cooperation between the encoders. We then specialize our result to a Gaussian GMAC with additive interferences that are known partially at each encoder. We show that the proposed scheme can remove the common part known at both encoders and also mitigate a significant part of the independent interference via state cooperation when the feedback links are strong. Thus, the... 

The authors study a two-user state-dependent generalised multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has 'non-causal' access to channel state information (CSI). They develop an achievable rate region by employing rate-splitting, block Markov encoding, Gelfand-Pinsker multicoding, superposition coding and joint typicality decoding. In the proposed scheme, the encoders use a partial decoding strategy to collaborate in the next block, and the receiver uses a backward decoding strategy with joint unique decoding at each stage. The author's achievable rate region includes several previously known regions proposed in the literature for different scenarios... 

We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder noncausally knows partial channel state information. We develop an achievable rate region by employing rate-splitting, block Markov encoding, Gelfand-Pinsker multicoding, superposition coding and jointly typical decoding. In the proposed scheme, the encoders use a partial decoding strategy to collaborate in the next block, and the receiver uses a backward decoding strategy with a joint unique decoding at each stage. Our achievable rate region includes several previously known rate regions proposed in the literature for different scenarios of multiple-access... 

In this paper, lattice based coding is used over two-user Gaussian state-dependent multiple access channel with common message for two channel models. First, it is assumed that the additive channel interference is noncausally known at both encoders. Exploiting a lattice encoding and decoding scheme, the effect of the interference is completely removed and the capacity region is achieved. Then, the multiple access channel with two additive interferences is considered in the case, where each interference is known noncausally to the associated transmitter. A pure lattice based encoding and decoding structure is proposed and an inner bound on the capacity region is derived which is valid for the... 

In this paper, the Two-Way Channel (TWC) with noncausal Channel State Information (CSI) is investigated. For the discrete memoryless channel an achievable rate region is derived. Then by extending the result to the Gaussian TWC with additive interference noise, it is shown that the capacity region of the latter channel is the same as the capacity when there is no interference, i.e., a two-way version of Costa's writing on dirty paper problem is established  

We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression maxPU, f(.), X=f(U,S) I(U;Y) is proposed for the capacity of this channel. For linear assignment to f(.), i.e., X=U-βS, this expression leads to the compensation strategy proposed previously by Willems to obtain an achievable rate for the DTC. We show that linear assignment to f(.) is optimal under the condition that there exists a real number β* such that the pair (X+β*S, U) is independent of the interference S. Furthermore, by applying a time-sharing technique to the achievable rate derived by linear assignment to f (.), an...