Enhanced Greedy Algorithm Based Dynamic Subcarrier Allocation for Single Carrier FDMA Systems
Obilor Nwamadi, Xu Zhu, Asoke Kumar Nandi
Abstract
Obilor Nwamadi, Xu Zhu, Asoke Kumar Nandi
Abstract
In this paper, we propose an enhanced greedy dynamic subcarrier allocation algorithm for single carrier frequency division multiple access (SC-FDMA) systems. This so called mean-enhanced greedy algorithm allocates subcarriers in a greedy fashion, based on the information of the users' subcarriers mean gains. We show through simulation results that the proposed algorithm outperforms the conventional greedy algorithm. It also outperforms the benchmark Hungarian algorithms in terms of bit error rate (BER) with a lower computational complexity. Furthermore, the proposed algorithm is generic and can be easily extended for orthogonal frequency division multiple access (OFDMA). We compare the performance of SC-FDMA and OFDMA, and point out that for a high number of users, there is no frequency diversity gain of SC-FDMA over OFDMA as both systems demonstrate benefit from multiuser diversity.
OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose an enhanced greedy dynamic subcarrier allocation algorithm for single carrier frequency division multiple access (SC-FDMA) systems. This so called mean-enhanced greedy algorithm allocates subcarriers in a greedy fashion, based on the information of the users' subcarriers mean gains. We show through simulation results that the proposed algorithm outperforms the conventional greedy algorithm. It also outperforms the benchmark Hungarian algorithms in terms of bit error rate (BER) with a lower computational complexity. Furthermore, the proposed algorithm is generic and can be easily extended for orthogonal frequency division multiple access (OFDMA). We compare the performance of SC-FDMA and OFDMA, and point out that for a high number of users, there is no frequency diversity gain of SC-FDMA over OFDMA as both systems demonstrate benefit from multiuser diversity.
Key concepts: Subcarrier, Greedy algorithm, Orthogonal frequency-division multiple access, Frequency-division multiple access, Computer science, Orthogonal frequency-division multiplexing, Benchmark (surveying), Algorithm