Search arXivSearch

arXiv · 2605.02418

Reduced-Feedback Hybrid Precoding for Wideband mmWave MIMO-OFDM Systems

Abstract

In this paper, we propose a feedback-efficient hybrid precoding framework for wideband millimeter-wave (mmWave) multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. To mitigate the high cost of radio frequency (RF) chains and channel state information (CSI) feedback in large-scale antenna arrays, we first construct frequency-flat analog precoders by extracting dominant angle-of-arrival (AoA) and angle-of-departure (AoD) directions from sparse frequency-domain channels. For digital precoding, we design a quantized codebook using the Lloyd algorithm and develop a binary-search-based hierarchical interpolation algorithm that adaptively assigns codewords according to subcarrier correlation. The proposed method achieves sub-linear feedback scaling by reducing the feedback overhead from O(K) to O(K/M + log M), where K is the number of subcarriers and M is the pilot spacing. Simulation results demonstrate that the proposed method achieves comparable or superior spectral efficiency and bit error rate (BER) performance to existing clustering and interpolation schemes, while significantly reducing computational complexity and exhibiting robustness under imperfect CSI.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Po-Heng Chou, Jia-Qing Lin, Wan-Jen Huang, Ronald Y. Chang. 2026-05-04. Reduced-Feedback Hybrid Precoding for Wideband mmWave MIMO-OFDM Systems. https://arxiv.org/abs/2605.02418

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