Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.34808

HiCoMAC: Histogram-State Coded Multiple Access Computing via Computation-Oriented Modulation Design

Xiaojing Yan·Carlo Fischione
View original source ↗Read source document ↗Export metadata ↓

Abstract

Nowadays, over-the-air computation (AirComp) exploits the waveform superposition property of the wireless multiple access channel to directly compute a function of distributed data from simultaneously transmitted signals. In this paper, we propose Histogram-State Coded Multiple Access Computing (HiCoMAC), a fundamentally new convolutional-coded method for digital AirComp that directly recovers the arithmetic-sum sequence from the superposition of coded and modulated user signals. HiCoMAC exploits the permutation invariance of the sum function to represent the multi-user convolutional encoder state by the numbers of users occupying the individual encoder states. This central idea enables log-max maximum a posterior (MAP) histogram-state Viterbi decoding with substantially reduced state complexity compared to joint full-state decoding. We further introduce the computational free distance to distinguish histogram paths that produce different arithmetic-sum sequences and develop a weighted product graph for its shortest path evaluation. This distance is then used to optimize the rectangular ratio of a fixed labeled quadrature amplitude modulation (QAM) constellation to improve the computational accuracy. Simulation results show that the computation-oriented modulation design increases the computational free distance and reduces the normalized mean square error (NMSE), while HiCoMAC outperforms the considered multi-symbol digital AirComp baselines under equal transmission and energy budgets.

Explore related subjects

eess.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaojing Yan, Carlo Fischione. 2026-09-28. HiCoMAC: Histogram-State Coded Multiple Access Computing via Computation-Oriented Modulation Design. https://arxiv.org/abs/2609.34808

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Symmetric Location Problem: a Song of Efficiency and Robustness

The aim of this Lecture Note is to introduce the Signal Processing (SP) community to a powerful yet still under-utilised tool: the semiparametric statistics. In short, the semiparametric framework allows us to estimate or perform hypothesis testing on a finite-dimensional parameter $\boldsymbolθ \in Θ\subseteq \mathbb{R}^p$ in the presence of an \textit{infinite-dimensional nuisance parameter} $g \in \mathcal{S}$ (i.e. a function), such as the density of the noise. Clearly, this framework is general enough to include almost every SP application. Remarkably, as the title suggests drawing on George R. R. Martin's famous book series, the greatest advantage of semiparametric statistics over parametric and non-parametric ones lies in the fact that it is able to reconcile two seemingly dichotomous concepts: statistical efficiency and distributional robustness. To explain exactly what this means, in this Lecture Note we will focus our attention on the famous and fundamental symmetric location problem.

eess.SP↗
arXiv2026

Single-Voxel Wireless NeRF for Spatial Spectrum Prediction

Wireless channel measurements across multiple spatial directions are crucial for AI-driven applications, such as RF digital twins and integrated communication and sensing. However, collecting channel data across large scenes is labor-intensive. Wireless NeRFs address this challenge by learning propagation behavior from sparse measurements and synthesizing channel spatial spectrum magnitude at unseen locations. However, existing wireless NeRFs inherit dense volumetric sampling from vision NeRFs, which requires substantial computation. This paper asks whether such dense sampling is necessary for predicting magnitudes of the wireless spatial spectrum. We empirically show that wireless NeRFs are over-parameterized for this task and introduce SV-INGP, a sparse volumetric sampling variant of Instant Neural Graphics Primitives (INGP). Across real-world and simulated datasets, SV-INGP matches the median Structural Similarity Index Measure (SSIM) of the NeRF2 baseline while reducing training time by 184x. These results generalize across LoS and NLoS scenes, sub-6 and millimeter-wave frequencies, and antenna array tapering configurations, suggesting a simpler and more efficient design path for RF digital twins

eess.SP↗
arXiv2026

Best Practices in EEG Analysis: Preprocessing, Modeling, and Machine Learning

Electroencephalography (EEG) analysis requires careful choices in preprocessing, statistical modeling, and machine learning because EEG signals are highly susceptible to artifacts, volume conduction, low signal-to-noise ratio, and substantial inter-subject variability. This chapter provides a practical and methodological guide to modern EEG analysis, spanning EEG preprocessing, artifact removal, filtering, bad-channel detection and interpolation, re-referencing, independent component analysis (ICA), and preprocessing of simultaneous EEG-fMRI recordings. We review major approaches for computational EEG analysis, including event-related potentials (ERPs), time-frequency analysis, functional and effective connectivity, source localization, multivariate decoding, permutation testing, and multiple-comparison correction. We then examine machine-learning methods for EEG, from feature-based classifiers to deep learning and emerging EEG foundation models, with emphasis on cross-subject generalization, limited-data regimes, data leakage, evaluation metrics, and fair benchmarking. Reproducibility is treated as a core requirement throughout, including transparent preprocessing, BIDS-EEG data organization, standardized derivatives, preservation of raw data, and FAIR data practices. The chapter is intended as a practical reference for researchers developing reliable, interpretable, and reproducible EEG analysis and machine-learning pipelines.

eess.SP↗