Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1407.5716

Massive-MIMO Meets HetNet: Interference Coordination Through Spatial Blanking

Ansuman Adhikary·Harpreet S. Dhillon·Giuseppe Caire
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study the downlink performance of a heterogeneous cellular network (HetNet) where both macro and small cells share the same spectrum and hence interfere with each other. We assume that the users are concentrated at certain areas in the cell, i.e., they form hotspots. While some of the hotspots are assumed to have a small cell in their vicinity, the others are directly served by the macrocell. Due to a relatively small area of each hotspot, the users lying in a particular hotspot appear to be almost co-located to the macrocells, which are typically deployed at some elevation. Assuming large number of antennas at the macrocell, we exploit this directionality in the channel vectors to obtain spatial blanking, i.e., concentrating transmission energy only in certain directions while creating transmission opportunities for the small cells lying in the other directions. In addition to this inherent interference suppression, we also develop three low-complexity interference coordination strategies: (i) turn off small cells based on the amount of cross-tier interference they receive or cause to the scheduled macrocell hotspots, (ii) schedule hotspots such that treating interference as noise is approximately optimal for the resulting Gaussian interference channel, and (iii) offload some of the macrocell hotspots to nearby small cells in order to improve throughput fairness across all hotspots. For all these schemes, we study the relative merits and demerits of uniform deployment of small cells vs. deploying more small cells towards the cell center or the cell edge.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ansuman Adhikary, Harpreet S. Dhillon, Giuseppe Caire. 2014-07-22. Massive-MIMO Meets HetNet: Interference Coordination Through Spatial Blanking. https://arxiv.org/abs/1407.5716

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↗