Search arXivSearch

arXiv · 2205.03538

Low-Complexity Distributed Precoding in User-Centric Cell-Free mmWave MIMO Systems

Abstract

User-centric (UC) based cell-free (CF) structures can provide the benefits of coverage enhancement for millimeter wave (mmWave) multiple input multiple output (MIMO) systems, which is regarded as the key technology of the reliable and high-rate services. In this paper, we propose a new beam selection scheme and precoding algorithm for the UC CF mmWave MIMO system, where a weighted sum-rate maximization problem is formulated. Since the joint design of beam selection and precoding is non-convex and tractable with high complexity, this paper designs the beam selection and precoding separately. Particularly, the proposed beam selection aims at reducing the inter-cluster inter-beam interference, then we also propose a precoding algorithm based on the weighted sum mean-square error (WSMSE) framework, where the precoding matrix can be updated in a distributed manner. We further employ the low-rank decomposition and Neumann series expansion (NSE) to reduce the computational complexity of the precoding. Simulations and complexity analysis verify the effectiveness of the proposed algorithm with a considerable reduction in computational complexity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yingrong Zhong, Yashuai Cao, Tiejun Lv. 2022-05-07. Low-Complexity Distributed Precoding in User-Centric Cell-Free mmWave MIMO Systems. https://doi.org/10.1109/wts53620.2022.9768317

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