A Sparsity-Agnostic SL0 Channel Estimation Approach for OTFS Systems

Orthogonal time frequency space (OTFS) modulation has been shown to support reliable communication in high mobility scenarios. Due to the sparsity of the delay-Doppler (DD) domain, most existing algorithms utilize compressed sensing (CS) for OTFS channel estimation, while requiring a known channel sparsity. However, in cases that the sparsity is not readily accessible, the estimation accuracy of these CS algorithms decreases dramatically. In this letter, we propose a Smoothed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ell _{0}$ </tex-math></inline-formula> (SL0) algorithm free of prior knowledge about channel sparsity for OTFS channel estimation. We obtain a novel vector expression of the input-output relationship in the DD domain and formulate it as a sparse signal recovery problem. In the case of unknown sparsity, a low-complexity SL0 algorithm is introduced to solve the problem with a faster reconstruction speed. Simulation results show that the proposed algorithm has significant advantages in estimation accuracy and complexity compared to algorithms that also do not require channel sparsity.

Authors

Institutions

Publication Details

Journal
IEEE Communications Letters
Published
2025-03-26
DOI
https://doi.org/10.1109/lcomm.2025.3554379
Citations
3
Primary Topic
PAPR reduction in OFDM
Type
article
Field-Weighted Citation Impact
2.19
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Sparsity-Agnostic SL0 Channel Estimation Approach for OTFS Systems

Xin Wang, Pengjiang Hu, Chung G. Kang, Can Zheng et al.
3 citations
IEEE Communications Letters
PAPR reduction in OFDM
2.19
article

A Sparsity-Agnostic SL0 Channel Estimation Approach for OTFS Systems

Xin Wang, Pengjiang Hu, Chung G. Kang, Can Zheng, Junan Yang
article en
3 citations

Abstract

Orthogonal time frequency space (OTFS) modulation has been shown to support reliable communication in high mobility scenarios. Due to the sparsity of the delay-Doppler (DD) domain, most existing algorithms utilize compressed sensing (CS) for OTFS channel estimation, while requiring a known channel sparsity. However, in cases that the sparsity is not readily accessible, the estimation accuracy of these CS algorithms decreases dramatically. In this letter, we propose a Smoothed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ell _{0}$ </tex-math></inline-formula> (SL0) algorithm free of prior knowledge about channel sparsity for OTFS channel estimation. We obtain a novel vector expression of the input-output relationship in the DD domain and formulate it as a sparse signal recovery problem. In the case of unknown sparsity, a low-complexity SL0 algorithm is introduced to solve the problem with a faster reconstruction speed. Simulation results show that the proposed algorithm has significant advantages in estimation accuracy and complexity compared to algorithms that also do not require channel sparsity.

IEEE Communications LettersVol. 29(5)
National University of Defense Technology (CN), Korea University (KR)
Openalex Percentile: Top 13%
PAPR reduction in OFDM
2.19
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.