Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2103.12418

Relay Selection with Imperfect SIC for FD/HD NOMA Cooperative Networks over Nakagami-$m$ Fades

Efendi Fidan·Eray Güven·Mehmet Akif Durmaz·Güneş Karabulut Kurt·Oğuz Kucur
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work, a non-orthogonal multiple access (NOMA) based transmission between two sources and two end-users is examined over independent non-identically distributed (i.n.i.d.) slow Nakagami-$m$ fading channels, where a single relay using decode-and-forward (DF) protocol is selected out of a set of full-duplex/half-duplex (FD/HD) multiple relays in accordance with the quality of service criterion. Two relay selection (RS) strategies, selecting a relay to maximize data rate of user 1 at selected relay and selecting a relay out of a set of relays providing service quality for user 1 to maximize data rate of user 2, are analyzed. Additionally, not only perfect successive interference cancellation (pSIC) but also imperfect SIC (ipSIC) is considered. The exact and asymptotic outage probability (OP) expressions are derived and validated via Monte Carlo simulation technique. Unlike existing works, our expressions are unique and valid for all cases such as FD and HD together with pSIC and ipSIC, i.e. expressions are not given separately but in a single compact form. Effect of each component such as pSIC, ipSIC, and self-interference (SI) for FD transmission on error floor of OP is demonstrated. Moreover, the optimum relay location is illustrated for a plenty of scenarios consisting of combination of different power allocations, data rates, pSIC/ipSIC, and total transmitted powers.

Explore related subjects

eess.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Efendi Fidan, Eray Güven, Mehmet Akif Durmaz, Güneş Karabulut Kurt, Oğuz Kucur. 2021-03-23. Relay Selection with Imperfect SIC for FD/HD NOMA Cooperative Networks over Nakagami-$m$ Fades. https://arxiv.org/abs/2103.12418

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

KEEP EXPLORING

Related papers

arXiv2026

From Continuous sEMG Signals to Discrete Muscle State Tokens: A Robust and Interpretable Representation Framework

Surface electromyography (sEMG) signals exhibit substantial inter-subject variability and are highly susceptible to noise, posing challenges for robust and interpretable decoding. To address these limitations, we propose a discrete representation of sEMG signals based on a physiology-informed tokenization framework. The method employs a sliding window aligned with the minimal muscle contraction cycle to isolate individual muscle activation events. From each window, ten time-frequency features, including root mean square (RMS) and median frequency (MDF), are extracted, and K-means clustering is applied to group segments into representative muscle-state tokens. We also introduce a large-scale benchmark dataset, ActionEMG-43, comprising 43 diverse actions and sEMG recordings from 16 major muscle groups across the body. Based on this dataset, we conduct extensive evaluations to assess the inter-subject consistency, representation capacity, and interpretability of the proposed sEMG tokens. Our results show that the token representation exhibits high inter-subject consistency (Cohen's Kappa = 0.82+-0.09), indicating that the learned tokens capture consistent and subject-independent muscle activation patterns. In action recognition tasks, models using sEMG tokens achieve Top-1 accuracies of 75.5% with ViT and 67.9% with SVM, outperforming raw-signal baselines (72.8% and 64.4%, respectively), despite a 96% reduction in input dimensionality. In movement quality assessment, the tokens intuitively reveal patterns of muscle underactivation and compensatory activation, offering interpretable insights into neuromuscular control. Together, these findings highlight the effectiveness of tokenized sEMG representations as a compact, generalizable, and physiologically meaningful feature space for applications in rehabilitation, human-machine interaction, and motor function analysis.

eess.SP↗
arXiv2026

Adaptive 3D-RoPE: Physics-Aligned Rotary Positional Encoding for Wireless Foundation Models

Wireless foundation models (WFMs) have emerged as a promising paradigm for unified channel state information (CSI) acquisition across diverse tasks in sixth-generation (6G) networks. Although WFMs significantly outperform task-specific small models, their zero-shot cross-scenario generalization still remains limited for real-world applications. Existing positional embeddings, the sole interface through which self-attention perceives the temporal-frequency-antenna 3D physical coordinates of CSI, fail to capture the highly dynamic and axis-dependent coherence inherent in wireless channels. This paper proposes Adaptive 3D-RoPE, a channel-driven 3D rotary positional embedding framework for WFMs to dynamically align the 3D positional embeddings with the instantaneous coherence state of heterogeneous CSI. The design proceeds in three stages: first, an axis-wise learnable rotary prior independently preserves the temporal, frequency, and antenna coordinate structures; second, a feature-guided rotary modulation module maps the feature-wise standard deviation of visible CSI tokens to compact, sample-adaptive scales; third, identical coordinate offsets induce dynamically adjusted query-key interactions tailored to the instantaneous channel state. Extensive experiments on both simulated and measured datasets validate the effectiveness of Adaptive 3D-RoPE across three complementary dimensions. It reduces NMSE by 10.14, 6.25, and 4.61 dB relative to baselines under antenna, temporal, and frequency scaling, respectively. It transfers effectively to real-world measured CSI and remains robust under imperfect CSI. Finally, it transfers to the independently designed LWM backbone and beam-prediction task, improving zero-shot Top-1 accuracy by 8.03 percentage points.

eess.SP↗
arXiv2026

Multimodal Signal Restoration with Signed Twofold Graph Learning

We propose a method for jointly learning signed twofold graphs and performing signal restoration on multimodal graph signals. Multimodal signals on sensor networks are commonly modeled under the twofold graph assumption (TGA), which represents spatial structure and inter-modality relations as two separate graphs. Existing TGA-based signal restoration methods, however, either assume the graphs are known or restrict edge weights to be non-negative, preventing them from capturing negative inter-modal correlations. We address both limitations as follows. To learn twofold graphs from noisy and incomplete data, we formulate joint signal restoration and twofold graph learning as MAP estimation under a matrix normal prior, where the spatial and modality graph Laplacians appear directly as precision matrices. The resulting non-convex objective is solved by alternating minimization: The signal is updated via conjugate gradient applied to the arising Sylvester-type linear system; the graphs are updated via primal-dual hybrid gradient (PDHG). To capture negative inter-modal correlations, we estimate the signed structure of the modality graph from the dominant eigenspace of a complementary kernel matrix, which is then used in PDHG to update edge magnitudes. These iterative solvers are then unrolled into a feedforward network, with regularization weights and step sizes as layer-wise trainable parameters. Experiments on synthetic multimodal graph signals and two real-world datasets (Japan meteorological and Beijing air-quality data) confirm that the proposed method outperforms existing baselines across a range of noise levels and missing-data patterns; the learned graphs are also directly validated against the ground-truth graphs on the synthetic datasets.

eess.SP↗