Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.07599

Flexible MIMO for Future Wireless Communications: Which Flexibilities are Possible?

Zhe Wang·Jiayi Zhang·Bokai Xu·Wenhui Yi·Emil Björnson·Bo Ai
View original source ↗Read source document ↗Export metadata ↓

Abstract

In conventional multiple-input multiple-output (MIMO), static array configurations struggle in dynamic environments, and further antenna scaling is bounded by cost, energy, and footprint. Emerging approaches, which can enable next-generation wireless communication networks with modest spectrum availability by leveraging flexibility and adaptability rather than sheer array growth, are therefore needed. In this paper, we present a taxonomy framework, referred to as flexible MIMO technology, that systematically categorizes a wide range of evolving MIMO technologies. The focus is on MIMO technologies with flexible physical configurations and integrated applications. We categorize twelve representative flexible MIMO technologies into three major classifications: flexible deployment characteristics-based, flexible geometry characteristics-based, and flexible real-time modifications-based. We then comprehensively overview their fundamental characteristics, potential, and challenges. In addition, we highlight three vital enablers for flexible MIMO technology, including efficient channel state information acquisition schemes, low-complexity beamforming design, and explainable artificial intelligence (AI)-enabled optimization, and discuss eight representative sub-techniques. Finally, two brief case studies -- pre-optimized irregular array for high-speed railway network and cell-free movable antenna -- are presented, showing how flexible MIMO can open new design possibilities and inspire future research directions for next-generation wireless networks.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhe Wang, Jiayi Zhang, Bokai Xu, Wenhui Yi, Emil Björnson, Bo Ai. 2025-11-08. Flexible MIMO for Future Wireless Communications: Which Flexibilities are Possible?. https://arxiv.org/abs/2506.07599

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗