2007•Unpublished venueRequires access

Performance of Practical Subcarrier Allocation Schemes for OFDMA

Natalia Y. Ermolova, Boris Makarevitch

Open publisher page 19 citations

Abstract

In this paper, we consider the problem of adaptive resource allocation for OFDMA. Aiming at practical (low-complexity) algorithms we study disjoint subcarrier and power allocation. A number of low-complexity subcarrier allocation strategies are discussed. We study "user by user" subcarrier assignment (i.e. the iteration over users) based on a user ordering according to the user average power gains as well as "subcarrier by subcarrier" assignment (i.e. the iteration over subcarriers) employing subcarrier ordering according to different metrics. By employing the order statistics theory we prove that the iteration over users starting from the worst user outperforms other orderings in Rayleigh environment. Efficiency of strengthening the considered subcarrier allocation algorithms by a non-iterative power loading technique is also studied.

About this research paper

What this paper is about

In this paper, we consider the problem of adaptive resource allocation for OFDMA. Aiming at practical (low-complexity) algorithms we study disjoint subcarrier and power allocation. A number of low-complexity subcarrier allocation strategies are discussed. We study "user by user" subcarrier assignment (i.e. the iteration over users) based on a user ordering according to the user average power gains as well as "subcarrier by subcarrier" assignment (i.e. the iteration over subcarriers) employing subcarrier ordering according to different metrics. By employing the order statistics theory we prove that the iteration over users starting from the worst user outperforms other orderings in Rayleigh environment. Efficiency of strengthening the considered subcarrier allocation algorithms by a non-iterative power loading technique is also studied.

Why it matters

OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we consider the problem of adaptive resource allocation for OFDMA. Aiming at practical (low-complexity) algorithms we study disjoint subcarrier and power allocation. A number of low-complexity subcarrier allocation strategies are discussed. We study "user by user" subcarrier assignment (i.e. the iteration over users) based on a user ordering according to the user average power gains as well as "subcarrier by subcarrier" assignment (i.e. the iteration over subcarriers) employing subcarrier ordering according to different metrics. By employing the order statistics theory we prove that the iteration over users starting from the worst user outperforms other orderings in Rayleigh environment. Efficiency of strengthening the considered subcarrier allocation algorithms by a non-iterative power loading technique is also studied.

Key concepts: Subcarrier, Computer science, Resource allocation, Mathematical optimization, Frequency-division multiple access, Orthogonal frequency-division multiplexing, Computer network, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Performance of Practical Subcarrier Allocation Schemes for OFDMA — Research Paper | ScholarLens