Searcharxiv⌕ Search

arXiv subjects

Anders M. Buvarp

Publications and source records attributed to Anders M. Buvarp.

6 recordsLinked to original sources

Physical Prior Mismatch in Variational Dual-Polarization Quantum SATCOM Channel Estimation

Dual-polarization quantum satellite communications require accurate estimation of complex polarization channels. We investigate physical latent-prior mismatch in variational estimation of a $2\times 2$ complex channel, using eight Cartesian latent coordinates and a fixed latent-to-channel mapping. Gaussian, matched and sharpened Rician, Laplace, and Cauchy priors are compared under a fixed neural architecture and forward Kullback-Leibler objective. Models are trained for 300,000 updates with $ζ=1/(2N_{\mathrm{est}})$ and evaluated using three training seeds and 10,000 shared held-out blocks per operating point. The Gaussian and Rician priors coincide at the Rayleigh limit. At higher Rician factors, the matched prior improves estimation accuracy, especially with fewer pilots. At $K=100$ and $N_{\mathrm{est}}=32$, the matched Rician variational estimator reduces mean squared Frobenius error by 2.50% relative to linear minimum mean-square error (LMMSE). We also derive a joint Rician Bayesian posterior-mean estimator that incorporates the complete least-squares noise covariance and reduces posterior integration to one-dimensional quadrature. It improves on LMMSE by 3.33% at the same operating point and achieves lower observed error than the scalar Rician and both neural estimators at all 12 operating points. Additional Rician prior sharpening increases error, while Laplace and Cauchy controls remain near the Gaussian baseline.

eess.SP↗

Low-Latency Joint Source-Channel Coding with Multiple Constant Curvature Curves

We propose constant-curvature curve multicode (C3M), a multi-branch extension of constant-curvature curve tube (C3T) analog joint source-channel coding for one-shot transmission over fixed isotropic AWGN channels. Instead of mapping a scalar source to a single curve on the power sphere, C3M partitions the source interval across a union of constant-speed branch curves in even-dimensional Euclidean space. This construction increases the available geometric degrees of freedom while preserving a low block length analog encoding structure. We derive the induced mixture output distribution, posterior representation, MAP and MMSE estimators, and mutual-information decomposition into branch-identification and along-curve components. We then introduce geometry- and classification-aware branch allocation rules based on tube density, curve length, and branch-classification reliability. The resulting design procedure fixes the optimal C3T curve as a starting branch and sequentially selects additional branches, thereby reducing the combinatorial cost of exhaustive multi-curve search. We use NORM-inspired branch-conditioned spectral decoders based on Fourier-feature lifting of the received ambient vector. Numerical experiments in four and six dimensions show that adding candidate branch curves improves the finite-dimensional end-to-end signal-to-distortion ratio, with selected two- and three-candidate C3M systems outperforming the one-curve baseline at +10 dB SNR. The results show that multi-curve analog mappings provide a practical finite-dimensional design route for low block length joint source-channel coding.

eess.SP↗

Variational Blind Equalization for Dual-Polarization Free-Space Quantum Communications

Dual-polarization free-space quantum communication links require receiver equalization under polarization mixing, fading, phase variation, and limited channel supervision. This paper investigates variational blind and semi-blind equalization using VISTA (Variational Inference for Signal Tracking and Adaptation), a variational autoencoder-based probabilistic physical parameter estimator. In the semi-blind branch, channel-relevant statistics are mapped to the underlying 2x2 complex polarization channel. We compare forward KL, reverse KL, Average Jeffreys, Max-KL, and Adaptive Jeffreys regularization and analyze directional KL asymmetry and the local effect of the regularization weight zeta. Over 500 paired Monte Carlo trials, forward KL is nearly insensitive to zeta, whereas reverse and symmetric objectives exhibit low-error regions followed by degradation under stronger regularization. At zeta = 3 x 10^-5, Average Jeffreys reduces median channel NRMSE by approximately 4.8% relative to forward KL at the same weight. Reduced KL asymmetry does not necessarily imply lower channel error. A separate fully blind QPSK receiver estimates a direct equalizer from received data only. Over 3000 paired trials, the VISTA variants have nearly identical median aligned block-NMSE, while their lower mean aligned block-NMSE relative to the CMA-plus-separation baseline is concentrated in difficult, large-error trials. Direct-W optimization with Adam reproduces most of this mean reduction. In the fully blind benchmark, the tested weak regularizers provide no resolved improvement over unregularized VISTA.

eess.SP↗

Quaternion-Valued Adaptive Projection Statistics for Neural Receivers in Dual-Polarization Free-Space Quantum Communications

Dual-polarization free-space quantum communication receivers produce two coupled complex heterodyne streams. We develop robust quaternion receiver methods for such links under fading, polarization mixing, calibration mismatch, impulsive contamination, and other non-Gaussian disturbances. The four polarization and quadrature components are encoded as quaternion-valued samples. We formulate an identifiable effective channel model, Quaternion-Valued Projection Statistics (QVPS), and Adaptive QVPS (AQVPS), which augments samplewise projection outlyingness with robust local second-order descriptors. Robust complex and quaternion channel estimators use radial Huber weighting, while QVPS and AQVPS are evaluated separately as disturbance diagnostics. Neural experiments compare matched real-, complex-, quaternion-, and widely linear complex-valued receivers. Robust estimation reduces sensitivity to non-Gaussian contamination. Local second-order descriptors improve detection of the tested localized disturbances relative to QVPS, and a descriptor-only ablation slightly outperforms full AQVPS. Complex LMMSE gives the lowest evaluation MSE in the clean Gaussian SNR sweep, whereas the Quaternion NN, among the compared receivers with their nominal activations, gives the lowest mean evaluation MSE in the tested contaminated sweeps. Activation-matched experiments indicate that much of the nominal Quaternion NN robustness is attributable to bounded activation rather than quaternion parameterization alone. The methods are evaluated at the receiver processing level and do not constitute a composable CV-QKD security proof.

eess.SP↗

Constant Curvature Curve Tube Codes for Low-Latency Analog Error Correction

Recent research in ultra-reliable and low latency communications (URLLC) for future wireless systems has spurred interest in short block-length codes. In this context, we analyze arbitrary harmonic bandwidth (BW) expansions for a class of high-dimension constant curvature curve codes for analog error correction of independent continuous-alphabet uniform sources. In particular, we employ the circumradius function from knot theory to prescribe insulating tubes about the centerline of constant curvature curves. We then use tube packing density within a hypersphere to optimize the curve parameters. The resulting constant curvature curve tube (C3T) codes possess the smallest possible latency, i.e., block-length is unity under BW expansion mapping. Further, the codes perform within $5$ dB signal-to-distortion ratio of the optimal performance theoretically achievable at a signal-to-noise ratio (SNR) $< -5$ dB for BW expansion factor $n \leq 10$. Furthermore, we propose a neural-network-based method to decode C3T codes. We show that, at low SNR, the neural-network-based C3T decoder outperforms the maximum likelihood and minimum mean-squared error decoders for all $n$. The best possible digital codes require two to three orders of magnitude higher latency compared to C3T codes, thereby demonstrating the latter's utility for URLLC.

cs.IT↗

Probability-Reduction of Geolocation using Reconfigurable Intelligent Surface Reflections

With the recent introduction of electromagnetic meta-surfaces and reconfigurable intelligent surfaces, a paradigm shift is currently taking place in the world of wireless communications and related industries. These new technologies have enabled the inclusion of the wireless channel as part of the optimization process. This is of great interest as we transition from 5G mobile communications towards 6G. In this paper, we explore the possibility of using a reconfigurable intelligent surface in order to disrupt the ability of an unintended receiver to geolocate the source of transmitted signals in a 5G communication system. We investigate how the performance of the MUSIC algorithm at the unintended receiver is degraded by correlated reflected signals introduced by a reconfigurable intelligent surface in the wireless channel. We analyze the impact of the direction of arrival, delay, correlation, and strength of the reconfigurable intelligent surface signal with respect to the line-of-sight path from the transmitter to the unintended receiver. An effective method is introduced for defeating direction-finding efforts using dual sets of surface reflections. This novel method is called Geolocation-Probability Reduction using Dual Reconfigurable Intelligent Surfaces (GPRIS). We also show that the efficiency of this method is highly dependent on the geometry, that is, the placement of the reconfigurable intelligent surface relative to the unintended receiver and the transmitter.

eess.SP↗