Search arXivSearch

arXiv · 1611.01359

Out-of-Band Radiation from Large Antenna Arrays

Abstract

Co-existing wireless systems, which share a common spectrum, need to mitigate out-of-band (OOB) radiation to avoid excessive interference. For legacy systems, OOB radiation is well understood and is commonly handled by digital precompensation techniques. When using large arrays, however, new phenomena and hardware limitations have to be considered. First, signals can be radiated directionally, which might focus the OOB radiation. Second, low-complexity hardware is used for cost reasons, which increases the relative amount of OOB radiation. Given that massive MIMO and millimeter wave communication rely on base stations with a large number of antennas, the spatial behavior of OOB radiation from large arrays will have significant implications for the hardware requirements of future base stations. We show that, if the OOB radiation is beamformed, its array gain is never larger than that of the in-band signal. In many cases, the OOB radiation is close to isotropic even when the in-band signal is highly directive. With the same total radiated power, the OOB radiation from large arrays is therefore never more severe than from a legacy system with the same adjacent-channel-leakage ratio. Further, the OOB radiation is less detrimental than from a legacy system since the high array gain of the in-band signal allows large arrays to radiate less total power than legacy systems. We also show how OOB radiation from large arrays varies with location in static propagation environments and how these effects vanish when averaged over the small-scale fading. Since a higher relative amount of OOB radiation can be tolerated for large arrays, the linearity requirement can be relaxed as compared to legacy systems. Specifically, less stringent linearity requirements on each transmitter makes it possible to build large arrays from low-complexity hardware.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher Mollén, Erik G. Larsson, Ulf Gustavsson, Thomas Eriksson, Robert W. Heath Jr. 2017-04-05. Out-of-Band Radiation from Large Antenna Arrays. https://arxiv.org/abs/1611.01359

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

KEEP EXPLORING

Related papers

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

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

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