Massive MIMO-OTFS-Based Random Access for Cooperative LEO Satellite Constellations

This paper investigates joint device identification, channel estimation, and symbol detection for cooperative multi-satellite-enhanced random access, where orthogonal time-frequency space modulation with the large antenna array is utilized to combat the dynamics of the terrestrial-satellite links (TSLs). We introduce the generalized complex exponential basis expansion model to parameterize TSLs, thereby reducing the pilot overhead. By exploiting the block sparsity of the TSLs in the angular domain, a message passing algorithm is designed for initial channel estimation. Subsequently, we examine two cooperative modes to leverage the spatial diversity within satellite constellations: the centralized mode, where computations are performed at a high-power central server, and the distributed mode, where computations are offloaded to edge satellites with minimal signaling overhead. Specifically, in the centralized mode, device identification is achieved by aggregating backhaul information from edge satellites, and channel estimation and symbol detection are jointly enhanced through a structured approximate expectation propagation (AEP) algorithm. In the distributed mode, edge satellites share channel information and exchange soft information about data symbols, leading to a distributed version of AEP. The introduced basis expansion model for TSLs enables the efficient implementation of both centralized and distributed algorithms via fast Fourier transform. Simulation results demonstrate that proposed schemes significantly outperform conventional algorithms in terms of the activity error rate, the normalized mean squared error, and the symbol error rate. Notably, the distributed mode achieves performance comparable to the centralized mode with only two exchanges of soft information about data symbols within the constellation.

Authors

Institutions

Publication Details

Journal
IEEE Journal on Selected Areas in Communications
Published
2024-09-13
DOI
https://doi.org/10.1109/jsac.2024.3460064
Citations
14
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
18.18

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Massive MIMO-OTFS-Based Random Access for Cooperative LEO Satellite Constellations

Boxiao Shen, Shiqi Gong, Heng Liu, Yongpeng Wu et al.
14 citations
IEEE Journal on Selected Areas in Communications
Satellite Communication Systems
18.18
article

Massive MIMO-OTFS-Based Random Access for Cooperative LEO Satellite Constellations

Boxiao Shen, Shiqi Gong, Heng Liu, Yongpeng Wu, Wenjun Zhang, Bjöwrn Ottersten
article en
14 citations

Abstract

This paper investigates joint device identification, channel estimation, and symbol detection for cooperative multi-satellite-enhanced random access, where orthogonal time-frequency space modulation with the large antenna array is utilized to combat the dynamics of the terrestrial-satellite links (TSLs). We introduce the generalized complex exponential basis expansion model to parameterize TSLs, thereby reducing the pilot overhead. By exploiting the block sparsity of the TSLs in the angular domain, a message passing algorithm is designed for initial channel estimation. Subsequently, we examine two cooperative modes to leverage the spatial diversity within satellite constellations: the centralized mode, where computations are performed at a high-power central server, and the distributed mode, where computations are offloaded to edge satellites with minimal signaling overhead. Specifically, in the centralized mode, device identification is achieved by aggregating backhaul information from edge satellites, and channel estimation and symbol detection are jointly enhanced through a structured approximate expectation propagation (AEP) algorithm. In the distributed mode, edge satellites share channel information and exchange soft information about data symbols, leading to a distributed version of AEP. The introduced basis expansion model for TSLs enables the efficient implementation of both centralized and distributed algorithms via fast Fourier transform. Simulation results demonstrate that proposed schemes significantly outperform conventional algorithms in terms of the activity error rate, the normalized mean squared error, and the symbol error rate. Notably, the distributed mode achieves performance comparable to the centralized mode with only two exchanges of soft information about data symbols within the constellation.

IEEE Journal on Selected Areas in CommunicationsVol. 43(1)
Beijing Institute of Technology (CN), Shanghai Jiao Tong University (CN), University of Luxembourg (LU), Beijing Electronic Science and Technology Institute (CN)
National Science Foundation, National Natural Science Foundation of China, Science and Technology Commission of Shanghai Municipality, Higher Education Discipline Innovation Project, Fundamental Research Funds for the Central Universities
Partnerships for the goals
Openalex Percentile: Top 1%
Satellite Communication Systems
18.18
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.