Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.08900

Enhanced Uplink Resource Allocation in Non-Orthogonal Multiple Access Systems

Rukhsana Ruby·Shuxin Zhong·Hailiang Yang·Kaishun Wu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Non-orthogonal multiple access (NOMA) is envisioned to be one of the most beneficial technologies for next generation wireless networks due to its enhanced performance compared to other conventional radio access techniques. Although the principle of NOMA allows multiple users to use the same frequency resource, due to decoding complication, information of users in practical systems cannot be decoded successfully if many of them use the same channel. Consequently, assigned spectrum of a system needs to be split into multiple subchannels in order to multiplex that among many users. Uplink resource allocation for such systems is more complicated compared to the downlink ones due to the individual users' power constraints and discrete nature of subchannel assignment. In this paper, we propose an uplink subchannel and power allocation scheme for such systems. Due to the NP-hard and non-convex nature of the problem, the complete solution, that optimizes both subchannel assignment and power allocation jointly, is intractable. Consequently, we solve the problem in two steps. First, based on the assumption that the maximal power level of a user is subdivided equally among its allocated subchannels, we apply many-to-many matching model to solve the subchannel-user mapping problem. Then, in order to enhance the performance of the system further, we apply iterative water-filling and geometric programming two power allocation techniques to allocate power in each allocated subchannel-user slot optimally. Extensive simulation has been conducted to verify the effectiveness of the proposed scheme. The results demonstrate that the proposed scheme always outperforms all existing works in this context under all possible scenarios.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rukhsana Ruby, Shuxin Zhong, Hailiang Yang, Kaishun Wu. 2017-11-24. Enhanced Uplink Resource Allocation in Non-Orthogonal Multiple Access Systems. https://arxiv.org/abs/1711.08900

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

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗
arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗
arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗