Water‐filling technique‐based proportionally fair scheduling algorithm for SC‐FDMA. Issue 12 (22nd September 2016)

• Record Type: Journal Article
• Authors: Gu, Jaheon; Lee, Tae‐Jin; Chung, Min Young
• Is Part Of: Transactions on emerging telecommunications technologies. Volume 27:Issue 12(2016:Dec.)
• Page Start: 1664
• Page End: 1671
• Publication Date: 2016-09-22
• Subjects: Telecommunication -- Periodicals; 384.05
• DOI: 10.1002/ett.3107
• Languages: English
• ISSNs: 2161-5748

Abstract

ABSTRACT: Single carrier frequency division multiple access (SC‐FDMA) regulates that subchannels allocated to a user should be contiguous in frequency domain (i.e., contiguity constraint). Due to the constraint, the proportionally fair (PF) scheduling in SC‐FDMA is known to be non‐deterministic polynomial‐time (NP) hard. In this paper, a novel PF scheduling algorithm is proposed based on the water‐filling (WF) technique to effectively solve PF scheduling in SC‐FDMA. The proposed algorithm is composed of 2 phases: subchannel allocation and data rate adjustment phases. In the subchannel allocation phase, user's power is allocated to frequency‐contiguous subchannels for maximizing users' data rates based on the WF technique. In the data rate adjustment phase, the modulation and coding scheme of user is decided by solving the PF scheduling problem with the WF technique. Through simulations, it is shown that the proposed scheme achieves total data rates and logarithmic sum of average user data rates close to those of the optimal PF scheduling. In addition, the proposed scheme performs better than coherence subband based resource allocation scheme. Abstract : This paper proposes a novel heuristic algorithm of the PF scheduling based on water‐filling technique. Firstly, the subchannel allocation phase assigns subchannels to users so that users' data rates could be maximized. Then, the data rate adjustment phase determines the modulation and coding scheme of users to satisfy the objective function of the PF scheduling. The simulation result shows that the performance of the proposed algorithm approaches those of the PF scheduling.