Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1212.5024

On the Complexity of Joint Subcarrier and Power Allocation for Multi-User OFDMA Systems

Ya-Feng Liu·Yu-Hong Dai
View original source ↗Read source document ↗Export metadata ↓

Abstract

Consider a multi-user Orthogonal Frequency Division Multiple Access (OFDMA) system where multiple users share multiple discrete subcarriers, but at most one user is allowed to transmit power on each subcarrier. To adapt fast traffic and channel fluctuations and improve the spectrum efficiency, the system should have the ability to dynamically allocate subcarriers and power resources to users. Assuming perfect channel knowledge, two formulations for the joint subcarrier and power allocation problem are considered in this paper: the first is to minimize the total transmission power subject to quality of service constraints and the OFDMA constraint, and the second is to maximize some system utility function (including the sum-rate utility, the proportional fairness utility, the harmonic mean utility, and the min-rate utility) subject to the total transmission power constraint per user and the OFDMA constraint. In spite of the existence of various heuristics approaches, little is known about the computational complexity status of the above problem. This paper aims to fill this theoretical gap, i.e., characterizing the complexity of the joint subcarrier and power allocation problem for the multi-user OFDMA system. It is shown in this paper that both formulations of the joint subcarrier and power allocation problem are strongly NP-hard. The proof is based on a polynomial time transformation from the so-called 3-dimensional matching problem. Several subclasses of the problem which can be solved to global optimality or $ε$-global optimality in polynomial time are also identified. These complexity results suggest that there are not polynomial time algorithms which are able to solve the general joint subcarrier and power allocation problem to global optimality (unless P$=$NP), and determining an approximately optimal subcarrier and power allocation strategy is more realistic in practice.

Explore related subjects

cs.ITmath.COmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ya-Feng Liu, Yu-Hong Dai. 2013-11-17. On the Complexity of Joint Subcarrier and Power Allocation for Multi-User OFDMA Systems. https://arxiv.org/abs/1212.5024

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

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗