Search arXivSearch

arXiv subjects

Sude Ertan

Publications and source records attributed to Sude Ertan.

3 recordsLinked to original sources

Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications

Classical coherent binary phase-shift keying (BPSK) reception over additive white Gaussian noise (AWGN) channels is analytically well understood, and the optimum hard-decision detector is known. Therefore, the aim of using neural receivers in this study is not to replace the classical AWGN-BPSK detector. Instead, the AWGN-BPSK setting is deliberately selected as a theoretically verifiable benchmark for analyzing how compactly neural receiver architectures can represent a known decision behavior. This paper compares multi-layer perceptron (MLP) and Kolmogorov--Arnold Network (KAN) receivers using a multi-SNR Nyquist-rate BPSK dataset. The models are evaluated using bit error rate (BER), mean squared error (MSE), and trainable parameter count. Beyond reporting accuracy alone, this work emphasizes a common-loss parameter-efficiency perspective: when two receivers reach a comparable practical BER or loss region, the receiver with fewer parameters is more attractive for real-time deployment. The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters. In particular, the KAN receiver with 3281 parameters achieves a test BER of 2.45 x 10^-4, while the MLP baseline with 8513 parameters achieves a test BER of 2.50 x 10^-4. This corresponds to approximately 61.5% fewer trainable parameters at a comparable BER operating point. This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.

eess.SP

Compact Convolutional Segmentation for Visual Landmark Extraction in GNSS-Denied UAV Navigation

Reliable localization of unmanned aerial vehicles (UAVs) becomes challenging when Global Navigation Satellite System (GNSS) signals are degraded, blocked, or intentionally jammed. In such GNSS-denied conditions, visual information obtained from onboard cameras can provide complementary cues for navigation by identifying spatially stable and distinc tive landmarks. This study proposes a compact convolutional segmentation framework for extracting candidate visual land marks from aerial imagery. The proposed model combines fully convolutional processing with dilation-based spatial con text extraction and residual feature transfer. Since a dedicated UAV landmark dataset is not available in this study, an aerial building segmentation dataset is adapted as an initial evaluation environment. Experimental results indicate that the proposed architecture provides a feasible front-end for candidate landmark extraction, while further improvements are required through extended training, UAV-specific datasets, and integration with localization or matching algorithms.

eess.IV

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.

eess.SP