Search arXivSearch

arXiv · 1605.04686

GMD-Based Hybrid Precoding For Millimeter-Wave Massive MIMO Systems

Abstract

Hybrid precoding can significantly reduce the number of required radio frequency (RF) chains and relieve the huge energy consumption in mmWave massive MIMO systems, thus attracting much interests from academic and industry. However, most existing hybrid precoding schemes are based on singular value decomposition (SVD). Due to the very different sub-channel signal-to-noise ratios (SNRs) after SVD, complicated bit allocations is usually required to match the sub-channel SNRs. To solve this problem, we propose a geometric mean decomposition (GMD)-based hybrid precoding scheme to avoid the complicated bit allocation. Its basic idea is to seek a pair of analog and digital precoding matrices that are sufficiently close to the optimal unconstrained GMD precoding matrix. Specifically, we design the analog (digital) precoding matrix while keeping the digital (analog) precoding matrix fixed. Further, the principle of basis pursuit is utilized in the design of analog precoding matrix, while we obtain the digital precoding matrix by projecting the GMD operation on the digital precoding matrix. Simulation results verify that the proposed GMD-based hybird precoding scheme outperforms conventional SVD-based hybrid precoding schemes and achieves much better bit error rate (BER) performance with low complexity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tian Xie, Linglong Dai, Xinyu Gao, Muhammad Zeeshan Shakir, Zhaocheng Wang. 2016-05-16. GMD-Based Hybrid Precoding For Millimeter-Wave Massive MIMO Systems. https://arxiv.org/abs/1605.04686

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