Novel subcarrier-allocation schemes for downlink MC DS-CDMA systems
Novel subcarrier-allocation schemes for downlink MC DS-CDMA systems
This paper addresses the subcarrier allocation in downlink multicarrier direct-sequence code-division multiple access (MC DS-CDMA) systems, where one subcarrier may be assigned to several users who are then distinguished from each other by their unique direct-sequence spreading codes. We first analyze the advantages and shortcomings of some existing subcarrier-allocation algorithms in the context of the MC DS-CDMA. Then, we generalize the worst subcarrier avoiding (WSA) algorithm to a so-called worst case avoiding (WCA) algorithm, which achieves better performance than the WSA algorithm. Then, the WCA algorithm is further improved to a proposed worst case first (WCF) algorithm. Furthermore, we propose an iterative worst excluding (IWE) algorithm, which can be employed in conjunction with the WSA, WCA, and the WCF algorithms, forming the IWE-WSA, IWE-WCA, and the IWE-WCF subcarrier-allocation algorithms. The complexities of these algorithms are analyzed, showing that they are all low-complexity subcarrier-allocation algorithms. The error performance is investigated and compared, demonstrating that we can now be very close to the optimum performance attained by the high-complexity Hungarian algorithm.
5716-5728
Shi, Jia
1bed2b92-b1bc-4500-8eeb-7525d9d3f0e6
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
October 2014
Shi, Jia
1bed2b92-b1bc-4500-8eeb-7525d9d3f0e6
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Shi, Jia and Yang, Lie-Liang
(2014)
Novel subcarrier-allocation schemes for downlink MC DS-CDMA systems.
IEEE Transactions on Wireless Communications, 13 (10), .
(doi:10.1109/TWC.2014.2338853).
Abstract
This paper addresses the subcarrier allocation in downlink multicarrier direct-sequence code-division multiple access (MC DS-CDMA) systems, where one subcarrier may be assigned to several users who are then distinguished from each other by their unique direct-sequence spreading codes. We first analyze the advantages and shortcomings of some existing subcarrier-allocation algorithms in the context of the MC DS-CDMA. Then, we generalize the worst subcarrier avoiding (WSA) algorithm to a so-called worst case avoiding (WCA) algorithm, which achieves better performance than the WSA algorithm. Then, the WCA algorithm is further improved to a proposed worst case first (WCF) algorithm. Furthermore, we propose an iterative worst excluding (IWE) algorithm, which can be employed in conjunction with the WSA, WCA, and the WCF algorithms, forming the IWE-WSA, IWE-WCA, and the IWE-WCF subcarrier-allocation algorithms. The complexities of these algorithms are analyzed, showing that they are all low-complexity subcarrier-allocation algorithms. The error performance is investigated and compared, demonstrating that we can now be very close to the optimum performance attained by the high-complexity Hungarian algorithm.
Text
twc-yang-2338853-proof.pdf
- Accepted Manuscript
More information
Accepted/In Press date: 24 June 2014
e-pub ahead of print date: 22 July 2014
Published date: October 2014
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 400913
URI: http://eprints.soton.ac.uk/id/eprint/400913
PURE UUID: af755810-4e7d-4667-a0d0-817ac16ff512
Catalogue record
Date deposited: 30 Sep 2016 08:47
Last modified: 15 Mar 2024 02:59
Export record
Altmetrics
Contributors
Author:
Jia Shi
Author:
Lie-Liang Yang
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