Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.14598

Next Generation Multiple Access with Cell-Free Massive MIMO

Mohammadali Mohammadi·Zahra Mobini·Hien Quoc Ngo·Michail Matthaiou
View original source ↗Read source document ↗Export metadata ↓

Abstract

To meet the unprecedented mobile traffic demands of future wireless networks, a paradigm shift from conventional cellular networks to distributed communication systems is imperative. Cell-free massive multiple-input multiple-output (CF-mMIMO) represents a practical and scalable embodiment of distributed/network MIMO systems. It inherits not only the key benefits of co-located massive MIMO systems but also the macro-diversity gains from distributed systems. This innovative architecture has demonstrated significant potential in enhancing network performance from various perspectives, outperforming co-located mMIMO and conventional small-cell systems. Moreover, CF-mMIMO offers flexibility in integration with emerging wireless technologies such as full-duplex (FD), non-orthogonal transmission schemes, millimeter-wave (mmWave) communications, ultra-reliable low-latency communication (URLLC), unmanned aerial vehicle (UAV)-aided communication, and reconfigurable intelligent surfaces (RISs). In this paper, we provide an overview of current research efforts on CF-mMIMO systems and their promising future application scenarios. We then elaborate on new requirements for CF-mMIMO networks in the context of these technological breakthroughs. We also present several current open challenges and outline future research directions aimed at fully realizing the potential of CF mMIMO systems in meeting the evolving demands of future wireless networks.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammadali Mohammadi, Zahra Mobini, Hien Quoc Ngo, Michail Matthaiou. 2024-08-26. Next Generation Multiple Access with Cell-Free Massive MIMO. https://arxiv.org/abs/2408.14598

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↗