Search arXivSearch

arXiv · 1007.3676

(n,K)-user Interference Channels: Degrees of Freedom

Abstract

We analyze the gains of opportunistic communication in multiuser interference channels. Consider a fully connected $n$-user Gaussian interference channel. At each time instance only $K\leq n$ transmitters are allowed to be communicating with their respective receivers and the remaining $(n-K)$ transmitter-receiver pairs remain inactive. For finite $n$, if the transmitters can acquire channel state information (CSI) and if all channel gains are bounded away from zero and infinity, the seminal results on interference alignment establish that for any $K$ {\em arbitrary} active pairs the total number of spatial degrees of freedom per orthogonal time and frequency domain is $\frac{K}{2}$. Also it is noteworthy that without transmit-side CSI the interference channel becomes interference-limited and the degrees of freedom is 0. In {\em dense} networks ($n\rightarrow\infty$), however, as the size of the network increase, it becomes less likely to sustain the bounding conditions on the channel gains. By exploiting this fact, we show that when $n$ obeys certain scaling laws, by {\em opportunistically} and {\em dynamically} selecting the $K$ active pairs at each time instance, the number of degrees of freedom can exceed $\frac{K}{2}$ and in fact can be made arbitrarily close to $K$. More specifically when all transmitters and receivers are equipped with one antenna, then the network size scaling as $n\inω(\snr^{d(K-1)})$ is a {\em sufficient} condition for achieving $d\in[0,K]$ degrees of freedom. Moreover, achieving these degrees of freedom does not necessitate the transmitters to acquire channel state information. Hence, invoking opportunistic communication in the context of interference channels leads to achieving higher degrees of freedom that are not achievable otherwise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Tajer, Xiaodong Wang. 2010-07-21. (n,K)-user Interference Channels: Degrees of Freedom. https://arxiv.org/abs/1007.3676

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT