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... 

In this paper, we study a general additive state-dependent Gaussian interference channel (ASD-GIC) where we consider two-user interference channel with two independent states known non-causally at both transmitters, but unknown to either of the receivers. A special case, where there is a common additive state is studied in [1], [2], where it is shown that the gap between the achievable symmetric rate and the upper bound is less than 1 /4 bits for the strong interference case. Here, we also consider the case where interference link gains satisfy a12 ≥ N1/ N2 and a 21 ≥ N2/ N1 (Ni is the channel noise variance) and each channel state has an unbounded variance [3], which is referred to as the... 

This paper studies the Gaussian two-way relay channel (GTWRC), where two nodes exchange their messages with the help of a half-duplex relay. We investigate a cooperative transmission protocol, consisting of four phases: multiple access (MA) phase, broadcast (BC) phase, and two cooperative phases. For this setup, we propose a new transmission scheme based on superposition coding for nested lattice codes, random coding, and jointly typical decoding. This scheme divides the message of each node into two parts, referred to as satellite codeword and cloud center. Depending on the phase type, the encoder sends a linear combination of satellite codewords or cloud centers. For comparison, a rate... 

In this paper, we consider a binary erasure channel (BEC) with an unknown erasure probability of {delta } at a transmitter. In addition, we consider that {delta } has a constant value in each transmission block and the transmitter knows the probability distribution of {delta }. For this problem with the infinite block length, based on the distribution of the random variable {delta } , a multi-layer encoding strategy at the transmitter and a successive decoding strategy at the receiver are proposed. In our proposed scheme, based on the value of {delta } , the receiver can decode a part of transmitted data from different transmission layers. In order to have a comparison with other erasure... 

In this letter, we consider a cache-enabled cloud radio access network with single-antenna base stations and single-antenna mobile users. Each base station can access the central processor of the network via a separate backhaul link with limited capacity. We utilize the interference alignment scheme as the transmission strategy between base stations and users. By assuming a block transmission scheme, we define a related data transmission delay. We derive the transmission delay and network power consumption. At last, we solve the problem of joint optimization of data transmission delay and network power consumption using DC programming algorithm. In our numerical results, we investigate the... 

In this paper, we study two important transmission strategies in full-duplex two-way relaying in the presence of channel estimation errors. In analog network coding (ANC), the relay transmits the combined signals that were received from both sources, with the aim of achieving better spectral efficiency. However, due to imperfect channel-state information (CSI), sources cannot perfectly cancel their own data in the relayed signal. We derive an achievable information rate for ANC in imperfect-CSI conditions and show how the ANC performance can significantly be degraded as a result. Moreover, we derive cut-set bounds with channel estimation errors for traditional routing (TR), in which time...