SearcharxivSearch

arXiv · 2608.29052

DeepHSIC: Deep Learning-based Signal Detector for Hybrid Downlink IM-NOMA

Abstract

DeepHSIC is introduced as a neural receiver for hybrid downlink IM-NOMA transmission. The considered scheme combines power-domain NOMA with a composite OFDM/OFDM-IM waveform, so that user information is mapped jointly onto constellation symbols, subcarrier-index patterns, and different power levels. Although maximum-likelihood detection can achieve strong reliability for this model, its search space grows rapidly with the number of users and subcarriers. Conventional SIC reduces part of this burden, but its sequential cancellation may still accumulate errors and does not fully exploit the structure of IM-NOMA signals. To address this limitation, the proposed detector embeds dedicated deep neural network modules into the receiver and replaces the most computationally demanding SIC operations with learned inference blocks. The receiver is trained for Rayleigh fading channels and uses preprocessed channel-output features to recover user symbols. Simulation results show that DeepHSIC reaches BER performance close to model-based detectors under both perfect and imperfect CSI while requiring substantially lower detection time. These results indicate that learned SIC-style detection is a practical candidate for scalable hybrid downlink IM-NOMA receivers.

Explore related subjects

Keep this discovery

BibTeXRIS

Dung Nguyen Tran, Toan D. Gian, Tien-Hoa Nguyen, Mai Xuan Trang, Tien-Cuong Nguyen, Thien Van Luong. 2026-08-29. DeepHSIC: Deep Learning-based Signal Detector for Hybrid Downlink IM-NOMA. https://arxiv.org/abs/2608.29052

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG

Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments

We present a combinatorial proof of Simonis type MacWilliams identity for harmonic higher weight distributions of linear codes. Furthermore, we investigate the statistical moments of the harmonic higher weight enumerators for random linear codes. Defining the enumerators via rank functions of the generator matrices of linear codes, we prove that its expectation vanishes for all non-trivial harmonic functions due to the inherent symmetry of random matrices, and we also derive an explicit, non-trivial formula for the covariance.

math.CO

Edge codes constructed from unicyclic graphs

Jaramillo-Velez recently introduced edge codes, a new class of toric evaluation codes constructed from the edges of a (hyper)graph $\mathcal{H}$. In the case that $\mathcal{H}$ is a tree, Jaramillo-Velez computed both the minimum distance and the weight distribution of the associated code. In this paper, we study edge codes associated to unicyclic graphs. Our most striking result is that computing the parameters of these codes is subtle in the case that the induced cycle has an even length because these values will depend on certain conditions regarding the length of the cycle and the size of the base field.

math.CO