Search arXivSearch

arXiv · 1808.08526

A Framework on Hybrid MIMO Transceiver Design based on Matrix-Monotonic Optimization

Abstract

Hybrid transceiver can strike a balance between complexity and performance of multiple-input multiple-output (MIMO) systems. In this paper, we develop a unified framework on hybrid MIMO transceiver design using matrix-monotonic optimization. The proposed framework addresses general hybrid transceiver design, rather than just limiting to certain high frequency bands, such as millimeter wave (mmWave) or terahertz bands or relying on the sparsity of some specific wireless channels. In the proposed framework, analog and digital parts of a transceiver, either linear or nonlinear, are jointly optimized. Based on matrix-monotonic optimization, we demonstrate that the combination of the optimal analog precoders and processors are equivalent to eigenchannel selection for various optimal hybrid MIMO transceivers. From the optimal structure, several effective algorithms are derived to compute the analog transceivers under unit modulus constraints. Furthermore, in order to reduce computation complexity, a simple random algorithm is introduced for analog transceiver optimization. Once the analog part of a transceiver is determined, the closed-form digital part can be obtained. Numerical results verify the advantages of the proposed design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chengwen Xing, Xin Zhao, Wei Xu, Xiaodai Dong, Geoffrey Ye Li. 2018-08-26. A Framework on Hybrid MIMO Transceiver Design based on Matrix-Monotonic Optimization. https://doi.org/10.1109/tsp.2019.2912833

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