Abstract
This paper explores and compares different dynamic subcarrier allocation (SA) schemes for single carrier (SC) FDMA systems. A so-called maximum greedy algorithm is proposed, which outperforms the existing greedy algorithm. We also provide an optimum solution for SA by using the so-called Hungarian algorithm. Furthermore, all the algorithms presented in this paper are very general and can be extended for OFDMA systems easily. Simulation results show that the investigated dynamic SA schemes significantly outperform the case with fixed SA. With the increase of the number of users, dynamic SA provides improved bit error rate (BER) performance, benefiting from multiuser diversity.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call