跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20068 · v1

Kolmogorov-Arnold Lookup Table Demappers for Amplitude Phase-Shift Keying over Nonlinear Satellite Links

首次提交 2026-11-15 23:18
版本更新 2026-11-15 23:18
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Next-generation high-throughput satellites increasingly demodulate and decode on board, so the per-symbol cost of the receiver constrains payload power and throughput. Soft demappers for nonlinear satellite links must therefore produce accurate bit log-likelihood ratios (LLRs) at low cost. We introduce a KAN-LUT demapper, a two-layer Kolmogorov--Arnold network (KAN) whose learned univariate edge functions are stored as 128-entry lookup tables (LUTs), so that inference needs only table reads, linear interpolation, and additions. We bound the LLR error introduced by the tables and evaluate the demapper on amplitude phase-shift keying (APSK) links with low-density parity-check (LDPC) coding and a nonlinear traveling-wave-tube amplifier. For 16-, 32-, and 64-APSK, KAN-LUT stays within 0.2 dB of a per-cluster Gaussian log-MAP (LogMAP-CG) demapper, while its cost relative to LogMAP-CG falls from 87% to 27% as the order grows. It matches or slightly exceeds multilayer perceptrons (MLPs) at about one fifth of their cost, remains competitive under operating-point mismatch, and needs only tens of kilobytes of tables. KAN-LUT is therefore a low-cost candidate demapper for regenerative payloads.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 23:18 · 最新观测版本

Kolmogorov-Arnold Lookup Table Demappers for Amplitude Phase-Shift Keying over Nonlinear Satellite Links

Next-generation high-throughput satellites increasingly demodulate and decode on board, so the per-symbol cost of the receiver constrains payload power and throughput. Soft demappers for nonlinear satellite links must therefore produce accurate bit log-likelihood ratios (LLRs) at low cost. We introduce a KAN-LUT demapper, a two-layer Kolmogorov--Arnold network (KAN) whose learned univariate edge functions are stored as 128-entry lookup tables (LUTs), so that inference needs only table reads, linear interpolation, and additions. We bound the LLR error introduced by the tables and evaluate the demapper on amplitude phase-shift keying (APSK) links with low-density parity-check (LDPC) coding and a nonlinear traveling-wave-tube amplifier. For 16-, 32-, and 64-APSK, KAN-LUT stays within 0.2 dB of a per-cluster Gaussian log-MAP (LogMAP-CG) demapper, while its cost relative to LogMAP-CG falls from 87% to 27% as the order grows. It matches or slightly exceeds multilayer perceptrons (MLPs) at about one fifth of their cost, remains competitive under operating-point mismatch, and needs only tens of kilobytes of tables. KAN-LUT is therefore a low-cost candidate demapper for regenerative payloads.

查看此版本解读 →查看此版本原文 ↗