Search arXivSearch

arXiv · 2509.25067

Capacity Achieving Design for Hybrid Beamforming in Millimeter Wave Massive MIMO Systems

Abstract

Hybrid digital and analog beamforming is a highly effective technique for implementing beamforming methods in millimeter wave (mmWave) systems. It provides a viable solution to replace the complex fully digital beamforming techniques. However, the current design of precoding and combining matrices in hybrid beamforming solely relies on the channel information, neglecting the crucial consideration of the structure of covariance matrices of the transmit signals. In this paper, we present a novel approach for the joint design of hybrid beamforming matrices at the transmitter and receiver. This approach is centered around the optimization of the covariance matrix of the transmitted signals. Our goal is to maximize the downlink sum rate capacity of the system by achieving an optimal design of the transmit covariance matrix. We tackle the non-convex nature of this problem by leveraging the dual relationship between the broadcast channel (BC) and the multiple access channel (MAC). Through extensive simulations in various scenarios, including point-to-point multi-input multi-output (MIMO), multi-user (MU) multi-input single-output (MISO), and MU-MIMO, we demonstrate the superiority of our proposed method over traditional designs. These results highlight the effectiveness and versatility of our approach in optimizing beamforming for mmWave systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rohollah Vahdani, S. Mohammad Razavizadeh. 2025-09-29. Capacity Achieving Design for Hybrid Beamforming in Millimeter Wave Massive MIMO Systems. https://doi.org/10.1109/tvt.2024.3487078

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