Journal ArticleDOI
Interference Channel With a Causal Relay Under Strong and Very Strong Interference
Reads0
Chats0
TLDR
A two-user interference channel with a causal relay, where the relay's transmit symbol depends not only on its past received symbols, but also on its present received symbol, is studied, an appropriate model for studying amplify-and-forward type relaying when the bandwidth delay-spread product is much smaller than one.Abstract:
In this paper, we study a two-user interference channel with a causal relay, where the relay's transmit symbol depends not only on its past received symbols, but also on its present received symbol. This is an appropriate model for studying amplify-and-forward type relaying when the bandwidth delay-spread product is much smaller than one. For the discrete memoryless interference channel with a causal relay, we derive a genie-aided outer bound. For the Gaussian interference channel with a causal relay, we define strong and very strong interference conditions and propose an outer bound for each case. We also propose an achievable scheme based on instantaneous amplify-and-forward (AF) relaying for the Gaussian interference channel with a causal relay and so it achieves capacity under some conditions. Our result extends the previous result by El Gamal, Hassanpour, and Mammen on the optimality of instantaneous AF relaying for the Gaussian relay channel with a causal relay to that of the Gaussian interference channel with a causal relay under strong and very strong interference.read more
Citations
More filters
Journal ArticleDOI
Covert Communication With Channel-State Information at the Transmitter
TL;DR: In this article, the authors considered the problem of covert communication over a state-dependent channel, where the transmitter has causal or non-causal knowledge of the channel states, and derived closed-form formulas for the maximum achievable covert communication rate (covert capacity) for discrete memoryless channels and, when the transmitter's channel-state information (CSI) is noncausal, for additive white Gaussian noise channels.
Journal ArticleDOI
Cooperative Compute-and-Forward
Matthew Nokleby,Behnaam Aazhang +1 more
TL;DR: In this paper, a lattice-coding approach to superposition block Markov encoding from which a cooperative lattice coding strategy was constructed was proposed. But the scheme is not suitable for the multiway relay channel.
Journal ArticleDOI
Distributed Topology Control and Channel Allocation Algorithm for Energy Efficiency in Wireless Sensor Network: From a Game Perspective
TL;DR: A distributed topology control and channel allocation algorithm from a game perspective which ensures network connectivity and converges to Pareto Optimality via adjusting the transmission power and node channel and results show that the topology obtained can not only possess the lower inference and more balanced average residual energy, but also have many other attractive network performances.
Journal ArticleDOI
On the DoF Region of the MIMO Gaussian Two-User Interference Channel With an Instantaneous Relay
TL;DR: The outer bound is obtained when the IR is restricted to performs linear operations, without any memoryless restriction, on its received signal and shows the optimality of the proposed achievable scheme among all linear processing schemes at the IR.
Journal ArticleDOI
Causal Relay Networks
Ihn-Jung Baik,Sae-Young Chung +1 more
TL;DR: The result for the causal relay channel strengthens the previously known capacity result by El Gamal, Hassanpour, and Mammen and shows that the new cut-set bounds can be achieved by a simple amplify-and-forward type relaying.
References
More filters
Journal ArticleDOI
Capacity theorems for the relay channel
Thomas M. Cover,Abbas El Gamal +1 more
TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y
Capacity theorems for the relay channel
Thomas M. Cover,A. El Gamal +1 more
TL;DR: An achievable lower bound to the capacity of the general relay channel is established and superposition block Markov encoding is used to show achievability of C, and converses are established.
Journal ArticleDOI
Three-terminal communication channels
TL;DR: A coding theorem and weak converse are proved and a necessary and sufficient condition for a positive capacity is derived and upper and lower bounds on the capacity are obtained, which coincide for channels with symmetric structure.
Journal ArticleDOI
The capacity of the Gaussian interference channel under strong interference (Corresp.)
TL;DR: The capacity region of a Gaussian interference channel with two separate messages is obtained for the case of moderately strong interference and it is shown that the region coincides with the one where both messages are required in both receiving terminals.
Journal ArticleDOI
A case where interference does not reduce capacity (Corresp.)
TL;DR: In this paper, it was shown that under certain conditions, two strongly interfering communication links with additive white Gaussian noise can achieve rates as high as would be achievable without this interference.