Related papers: On the Separability of Parallel Gaussian Interfere…
In this work, we study a family of wireless channel simulation models called geometry-based stochastic channel models (GBSCMs). Compared to more complex ray-tracing simulation models, GBSCMs do not require an extensive characterization of…
We study conformations of the Gaussian polymer chains in d-dimensional space in the presence of an external field with the harmonic potential. We apply a path integral approach to derive an explicit expression for the probability…
Two quantum channels are called compatible if they can be obtained as marginals from a single broadcasting channel; otherwise they are incompatible. We derive a characterization of the compatibility relation in terms of concatenation and…
In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…
Given a bichromatic point set $P=\textbf{R} \cup \textbf{B}$ of red and blue points, a separator is an object of a certain type that separates $\textbf{R}$ and $\textbf{B}$. We study the geometric separability problem when the separator is…
The sum capacity of a class of layered erasure one-sided interference channels is developed under the assumption of no channel state information at the transmitters. Outer bounds are presented for this model and are shown to be tight for…
This paper considers the two-user Gaussian interference channel in the presence of adversarial jammers. We first provide a general model including an arbitrary number of jammers, and show that its capacity region is equivalent to that of a…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
This work considers communication over Gaussian interference channels with processing energy cost, which explicitly takes into account the energy expended for processing when transmitters are on. In the presence of processing energy cost,…
The output impedance matrix of a grid-connected converter plays an important role in analyzing system stability. Due to the dynamics of the DC-link control and the phase locked loop (PLL), the output impedance matrices of the converter and…
This work considers the corner points of the capacity region of a two-user Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where one user transmits its data at the single-user capacity (without interference), and the…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
We consider secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using Gaussian…
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…
We consider the problem of high-dimensional Gaussian graphical model selection. We identify a set of graphs for which an efficient estimation algorithm exists, and this algorithm is based on thresholding of empirical conditional…
We investigate the interference of high-order perfect optical vortex (POV) beams with different topological charges. Through numerical simulations, we reveal a remarkable phenomenon: keeping the beam width, and beam radius fixed while…
The field of the coded modulations witnessed its golden era as the simulated achievable bit rates (ABRs) were getting close to the channel capacities of the finite alphabet inputs. However, when working at a single channel, the previous…
As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…
We consider the Gaussian channel with power constraint P. A gap exists between the channel capacity and the highest achievable rate of equiprobable uniformly spaced signal. Several approaches enable to overcome this limitation such as…