eess.SPNov 15, 2026

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

Authors: Kürşat Tekbıyık, Güneş Karabulut Kurt, Antoine Lesage-Landry

Organizations: GERAD & Mila, Montréal, Canada · Poly-Grames Research Centre, Department of Electrical Engineering, Polytechnique Montréal, Montréal, Canada

Abstract

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.

Figures & tables

Explore similar work

Aug 3, 2026

A Comparative Analysis of MLP and Kolmogorov-Arnold Networks (KAN) for Faster-than-Nyquist (FTN) Signaling Detection

Faster-than-Nyquist signaling improves spectral ef- ficiency by deliberately introducing inter-symbol interference. Classical sequence detectors such as BCJR can approach optimal performance, but their computational cost grows rapidly with channel memory. This paper investigates data-driven FTN BPSK detection under AWGN through a direct comparison between multilayer perceptrons and Kolmogorov Arnold Networks. A large-scale Monte Carlo dataset containing nearly four million labeled windows is generated for a time-packing factor of zero point eight and signal-to-noise ratio values from seven to ten decibels. The best MLP obtained from width sweeping uses hidden width thirty two, whereas the selected KAN uses hidden width four with spline grid size five. At ten decibels, the MLP produces a bit error rate of one point three times ten to the minus four, while the KAN reaches seven times ten to the minus six. This corresponds to an eighteen point six times lower bit error rate while using only one eighth of the MLP hidden width. The results show that KAN provides a more effective and more parameter-efficient neural decision model than the MLP baseline for FTN BPSK detection.
Feb 7, 2026

Physical Analogue Kolmogorov-Arnold Networks based on Reconfigurable Nonlinear-Processing Units

Kolmogorov-Arnold Networks (KANs) shift neural computation from linear layers to learnable nonlinear edge functions, but implementing these nonlinearities efficiently in hardware remains an open challenge. Here we introduce a physical analogue KAN architecture in which edge functions are realized in materia using reconfigurable nonlinear-processing units (RNPUs): multi-terminal nanoscale silicon devices whose input-output characteristics are tuned via control voltages. By combining multiple RNPUs into an edge processor and assembling these blocks into a reconfigurable analogue KAN (aKAN) architecture with integrated mixed-signal interfacing, we establish a realistic system-level hardware implementation that enables compact KAN-style regression and classification with programmable nonlinear transformations. Using experimentally calibrated RNPU models and hardware measurements, we demonstrate accurate function approximation across increasing task complexity while requiring fewer or comparable trainable parameters than multilayer perceptrons (MLPs). System-level estimates indicate an energy per inference of roughly 200 pJ and an end-to-end inference latency of roughly 0.6 μμs for a representative workload, corresponding to over 100×\times reduction in energy accompanied by >>10×\times reduction in area compared to a digital fixed-point MLP at similar approximation error. These results establish RNPUs as scalable, hardware-native nonlinear computing primitives and identify analogue KAN architectures as a realistic silicon-based pathway toward energy-, latency-, and footprint-efficient analogue neural-network hardware, particularly for edge inference.
May 27, 2026

Sequential Neural Probabilistic Amplitude Shaping: Learning the Channel's Language

We present the first neural probabilistic amplitude shaping that outperforms existing methods while accounting for all implementation losses, using a block-less, easily implementable sequential autoregressive encoder compatible with arithmetic distribution matching, yielding reduced rate loss and higher achievable information rates.