Related papers: Dependence Balance Based Outer Bounds for Gaussian…
In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per…
A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min…
Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…
Path planning is an important component of au- tonomous mobile sensing systems. This paper studies upper and lower bounds of communication performance over Gaussian sen- sor networks, to drive power-distortion metrics for path planning…
The statistical analysis of the fading End to End channel gain of the amplify and forward relaying protocol, however, is well known as extremely complex, and research work to date have only studied the asymptotic behaviour of the outage…
We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…
We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…
We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…
We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…
Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…
Linear coding schemes have been the main choice of coding for the additive white Gaussian noise broadcast channel (AWGN-BC) with noiseless feedback in the literature. The achievable rate regions of these schemes go well beyond the capacity…
Cooperation is viewed as a key ingredient for interference management in wireless systems. This paper shows that cooperation has fundamental limitations. The main result is that even full cooperation between transmitters cannot in general…
Interference alignment is a key technique for communication scenarios with multiple interfering links. In several such scenarios, interference alignment was used to characterize the degrees-of-freedom of the channel. However, these…
The capacity region of the cooperative two-user Multiple Access Channel (MAC) in Gaussian noise is determined to within a constant gap for both the Full-Duplex (FD) and Half-Duplex (HD) case. The main contributions are: (a) for both FD and…
This work focuses on the minimum transmission energy required for communicating a pair of correlated Gaussian sources over a two-user Gaussian broadcast channel with noiseless and causal channel output feedback (GBCF). We study the…
A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…
A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes…
This article shows that the set of HK constraints correspond to projecting the intersection of two multiple access channels on its sup-spaces. A key property of HK constraints is that the private message of user 1 (or of user 2) is the last…
Computing capacity of Gaussian Interference Channel (GIC) is complex since knowledge of input distributions is needed to find the mutual information terms in closed forms, which should be optimized over input distributions and associated…
We consider a three-node half-duplex Gaussian relay network where two nodes (say $a$, $b$) want to communicate with each other and the third node acts as a relay for this twoway communication. Outer bounds and achievable rate regions for…