Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1601.01379

User-Centric Interference Nulling in Downlink Multi-Antenna Heterogeneous Networks

Ying Cui·Yueping Wu·Dongdong Jiang·Bruno Clerckx
View original source ↗Read source document ↗Export metadata ↓

Abstract

In heterogeneous networks (HetNets), strong interference due to spectrum reuse affects each user's signal-to-interference ratio (SIR), and hence is one limiting factor of network performance. In this paper, we propose a user-centric interference nulling (IN) scheme in a downlink large-scale HetNet to improve coverage/outage probability by improving each user's SIR. This IN scheme utilizes at most maximum IN degree of freedom (DoF) at each macro-BS to avoid interference to uniformly selected macro (pico) users with signal-to-individual-interference ratio (SIIR) below a macro (pico) IN threshold, where the maximum IN DoF and the two IN thresholds are three design parameters. Using tools from stochastic geometry, we first obtain a tractable expression of the coverage (equivalently outage) probability. Then, we analyze the asymptotic coverage/outage probability in the low and high SIR threshold regimes. The analytical results indicate that the maximum IN DoF can affect the order gain of the outage probability in the low SIR threshold regime, but cannot affect the order gain of the coverage probability in the high SIR threshold regime. Moreover, we characterize the optimal maximum IN DoF which optimizes the asymptotic coverage/outage probability. The optimization results reveal that the IN scheme can linearly improve the outage probability in the low SIR threshold regime, but cannot improve the coverage probability in the high SIR threshold regime. Finally, numerical results show that the proposed scheme can achieve good gains in coverage/outage probability over a maximum ratio beamforming scheme and a user-centric almost blank subframes (ABS) scheme.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ying Cui, Yueping Wu, Dongdong Jiang, Bruno Clerckx. 2016-07-03. User-Centric Interference Nulling in Downlink Multi-Antenna Heterogeneous Networks. https://arxiv.org/abs/1601.01379

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

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗