Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.05784v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.05784v1 (cs)
[Submitted on 7 Oct 2025 ]

Title: SALAD: Self-Adaptive Link Adaptation

Title: SALAD:自适应链路适配

Authors:Reinhard Wiesmayr, Lorenzo Maggi, Sebastian Cammerer, Jakob Hoydis, Fayçal Aït Aoudia, Alexander Keller
Abstract: Adapting the modulation and coding scheme (MCS) to the wireless link quality is critical for maximizing spectral efficiency while ensuring reliability. We propose SALAD (self-adaptive link adaptation), an algorithm that exclusively leverages ACK/NACK feedback to reliably track the evolution of the signal-to-interference-plus-noise ratio (SINR), achieving high spectral efficiency while keeping the long-term block error rate (BLER) near a desired target. SALAD infers the SINR by minimizing the cross-entropy loss between received ACK/NACKs and predicted BLER values, with a learning rate that self-adapts online through knowledge distillation. Based on this inference, SALAD selects the MCS via hypothesis testing: if the SINR is likely underestimated, a higher MCS is selected to accelerate link adaptation under improving channel conditions. To prevent BLER drift from its long-term target, SALAD incorporates a feedback control loop that adjusts the instantaneous BLER target. Over-the-air experiments on a 5G testbed demonstrate that SALAD consistently outperforms the industry-standard outer-loop link adaptation (OLLA). With a single set of parameters, SALAD achieves up to 15% higher throughput and spectral efficiency than multiple OLLA variants across different traffic regimes, while meeting the BLER target.
Abstract: 适应调制和编码方案(MCS)以满足无线链路质量对于在确保可靠性的同时最大化频谱效率至关重要。 我们提出SALAD(自适应链路适配),一种仅利用ACK/NACK反馈来可靠跟踪信噪干扰比(SINR)演化的算法,在保持长期块错误率(BLER)接近期望目标的同时实现高频谱效率。 SALAD通过最小化接收到的ACK/NACK与预测的BLER值之间的交叉熵损失来推断SINR,其学习率通过知识蒸馏在线自适应调整。 基于此推断,SALAD通过假设检验选择MCS:如果SINR可能被低估,则在信道条件改善的情况下选择更高的MCS以加速链路适配。 为防止BLER偏离其长期目标,SALAD引入一个反馈控制环路来调整瞬时BLER目标。 在5G测试平台上的空中实验表明,SALAD始终优于行业标准的外环链路适配(OLLA)。 使用一组参数,SALAD在不同业务模式下比多个OLLA变体在吞吐量和频谱效率方面高出高达15%,同时满足BLER目标。
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2510.05784 [cs.IT]
  (or arXiv:2510.05784v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.05784
arXiv-issued DOI via DataCite

Submission history

From: Lorenzo Maggi [view email]
[v1] Tue, 7 Oct 2025 10:58:07 UTC (6,631 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号