Search arXivSearch

arXiv · 2302.00057

Federated Cell-Free MIMO in Non-Terrestrial Networks: Architectures and Performance

Abstract

While 5G networks are being rolled out, the definition of the potential 5G-Advanced features and the identification of disruptive technologies for 6G systems are being addressed by the scientific and academic communities to tackle the challenges that 2030 communication systems will face, such as terabit-capacity and always-on networks. In this framework, it is globally recognised that Non-Terrestrial Networks (NTN) will play a fundamental role in support to a fully connected world, in which physical, human, and digital domains will converge. In this framework, one of the main challenges that NTN have to address is the provision of the high throughput requested by the new ecosystem. In this paper, we focus on Cell-Free Multiple Input Multiple Output (CF-MIMO) algorithms for NTN. In particular: i) we discuss the architecture design supporting centralised and federated CF-MIMO in NTN, with the latter implementing distributed MIMO algorithms from multiple satellites in the same formation (swarm); ii) propose a novel location-based CF-MIMO algorithm, which does not require Channel State Information (CSI) at the transmitter; and iii) design novel normalisation approaches for federated CF-MIMO in NTN, to cope with the constraints on non-colocated radiating elements. The numerical results substantiate the good performance of the proposed algorithm, also in the presence of non-ideal information.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alessandro Guidotti, Alessandro Vanelli-Coralli, Carla Amatetti. 2023-01-31. Federated Cell-Free MIMO in Non-Terrestrial Networks: Architectures and Performance. https://arxiv.org/abs/2302.00057

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