Search arXivSearch

arXiv · 1911.05906

Majorization-Minimization Aided Hybrid Transceivers for MIMO Interference Channels

Abstract

The potential of deploying large-scale antenna arrays in future wireless systems has stimulated extensive research on hybrid transceiver designs aiming to approximate the optimal fully-digital schemes with much reduced hardware cost and signal processing complexity. Generally, this hybrid transceiver structure requires a joint design of analog and digital processing to enable both beamsteering and spatial multiplexing gains. In this paper, we develop various weighted mean-square-error minimization (WMMSE) based hybrid transceiver designs over multiple-input multiple-output (MIMO) interference channels at both millimeter wave (mmWave) and microwave frequencies. Firstly, a heuristic joint design of hybrid precoder and combiner using alternating optimization is proposed, in which the majorization-minimization (MM) method is utilized to design the analog precoder and combiner with unit-modulus constraints. It is validated that this scheme achieves the comparable performance to the WMMSE fully-digital solution. To further reduce the complexity, a phase projection-based two-stage scheme is proposed to decouple the designs of analog and digital precoder combiner. Secondly, inspired by the fully-digital solutions based on the block-diagonalization zero-forcing (BD-ZF) and signal-to-leakage-plus-noise ratio (SLNR) criteria, low-complexity MMbased BD-ZF and SLNR hybrid designs are proposed to well approximate the corresponding fully-digital solutions. Thirdly, the partially-connected hybrid structure for reducing system hardware cost and power consumption is considered, for which the MM-based alternating optimization still works. Numerical results demonstrate the similar or superior performance of all the above proposed schemes over the existing benchmarks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shiqi Gong, Chengwen Xing, Vincent K. N. Lau, Sheng Chen, Lajos Hanzo. 2019-11-14. Majorization-Minimization Aided Hybrid Transceivers for MIMO Interference Channels. https://doi.org/10.1109/tsp.2020.3018548

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