Search arXivSearch

arXiv · 2211.03584

MARS: Message Passing for Antenna and RF Chain Selection for Hybrid Beamforming in MIMO Communication Systems

Abstract

In this paper, we consider a prospective receiving hybrid beamforming structure consisting of several radio frequency (RF) chains and abundant antenna elements in multi-input multi-output (MIMO) systems. Due to conventional costly full connections, we design an enhanced partially connected beamformer employing a low-density parity-check (LDPC)-based structure. As a benefit of the LDPC-based structure, information can be exchanged among clustered RF/antenna groups, which results in a low computational complexity order. Advanced message passing (MP) capable of inferring and transferring information among different paths is designed to support the LDPC-based hybrid beamformer. We propose a message-passing enhanced antenna and RF chain selection (MARS) scheme for minimizing the operational power of antennas and RF chains of the receiver as well as hybrid beamforming. Furthermore, sequential and parallel MP schemes for MARS are designed, namely, MARS-S and MARS-P, respectively, to address the convergence speed issue. A heuristic genetic algorithm is designed for receiving hybrid beamforming, comprising gene generation initialization, elite selection, crossover, and mutation. Simulations validate the convergence of both the MARS-P and the MARS-S algorithms. Due to the asynchronous information transfer of MARS-P, it requires higher power than MARS-S, which strikes a compelling balance among power consumption, convergence, and computational complexity. It is also demonstrated that the proposed MARS scheme outperforms the existing benchmarks using the heuristic method of fully/partially connected architectures in the open literature by requiring the lowest power and realizing the highest energy efficiency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Li-Hsiang Shen, Yen-Chun Lo, Kai-Ten Feng, Sau-Hsuan Wu, Lie-Liang Yang. 2024-05-20. MARS: Message Passing for Antenna and RF Chain Selection for Hybrid Beamforming in MIMO Communication Systems. https://arxiv.org/abs/2211.03584

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