The University of Southampton
University of Southampton Institutional Repository

Bidirectional worst subchannel avoiding versus best subchannel seeking subcarrier-allocation in downlink OFDMA systems

Bidirectional worst subchannel avoiding versus best subchannel seeking subcarrier-allocation in downlink OFDMA systems
Bidirectional worst subchannel avoiding versus best subchannel seeking subcarrier-allocation in downlink OFDMA systems
In this paper, we design and investigate two subcarrier-allocation algorithms for downlink orthogonal frequency division multiple access (OFDMA) systems. One is designed to avoid assigning users as many as possible the worst subchannels, which is referred to as the bidirectional worst subchannel avoiding (BWSA) algorithm. The other one is called the best subchannel seeking (BSS) algorithm, which aims at assigning users the best possible subchannels. We study and compare the error rate, spectrum-efficiency and the complexity of the two algorithms. We also compare them with some existing subcarrier-allocation algorithms. Our studies show that both the BWSA and BSS algorithms belong to the class of low-complexity subcarrier-allocation algorithms. In general, they outperform all the other considered sub-optimal algorithms, in terms of both error performance and spectrum-efficiency. When operated in relatively large OFDMA systems, we find that both the error performance and the spectrum-efficiency attainable by the BWSA and BSS algorithms are close to that achieved by the Hungarian algorithm of high-complexity.
LTE/LTE-A, orthogonal frequency division multiple access, complexity, greedy, resource-allocation, subcarrier-allocation
0018-9545
7160-7172
Shi, Jia
afea1152-6108-47af-b5f5-95cd1c53f868
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Shi, Jia
afea1152-6108-47af-b5f5-95cd1c53f868
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7

Shi, Jia and Yang, Lie-Liang (2016) Bidirectional worst subchannel avoiding versus best subchannel seeking subcarrier-allocation in downlink OFDMA systems. IEEE Transactions on Vehicular Technology, 65 (9), 7160-7172. (doi:10.1109/TVT.2015.2499263).

Record type: Article

Abstract

In this paper, we design and investigate two subcarrier-allocation algorithms for downlink orthogonal frequency division multiple access (OFDMA) systems. One is designed to avoid assigning users as many as possible the worst subchannels, which is referred to as the bidirectional worst subchannel avoiding (BWSA) algorithm. The other one is called the best subchannel seeking (BSS) algorithm, which aims at assigning users the best possible subchannels. We study and compare the error rate, spectrum-efficiency and the complexity of the two algorithms. We also compare them with some existing subcarrier-allocation algorithms. Our studies show that both the BWSA and BSS algorithms belong to the class of low-complexity subcarrier-allocation algorithms. In general, they outperform all the other considered sub-optimal algorithms, in terms of both error performance and spectrum-efficiency. When operated in relatively large OFDMA systems, we find that both the error performance and the spectrum-efficiency attainable by the BWSA and BSS algorithms are close to that achieved by the Hungarian algorithm of high-complexity.

Text
tvt-yang-2499263-proof.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 26 October 2015
e-pub ahead of print date: 20 November 2015
Published date: September 2016
Keywords: LTE/LTE-A, orthogonal frequency division multiple access, complexity, greedy, resource-allocation, subcarrier-allocation

Identifiers

Local EPrints ID: 385195
URI: http://eprints.soton.ac.uk/id/eprint/385195
ISSN: 0018-9545
PURE UUID: f88fde7a-c2f3-495d-85f7-167737a59a65
ORCID for Lie-Liang Yang: ORCID iD orcid.org/0000-0002-2032-9327

Catalogue record

Date deposited: 18 Jan 2016 11:29
Last modified: 17 Dec 2019 01:55

Export record

Altmetrics

Contributors

Author: Jia Shi
Author: Lie-Liang Yang ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×