Chunk Allocation Schemes for SC-FDMA Systems

A Combined User-order and Chunk-order Algorithm to Minimize The Average BER for Chunk Allocation in SC-FDMA Systems

“…To reduce the complexity, the subcarrier allocation using equal power allocation is proposed in [9], [14][15][16][17][18][19][20][21][22]. In [9,17], subcarrier allocations are developed on subcarrier by subcarrier based while in [14][15][16], [18][19][20][21][22] are developed on chunk by chunk based which could impact the decrease of complexity. In [9,14], [16][17], [19][20][21], the spectral efficiency are maximized while in [15,18], data rate fairness are maximized.…”

“…In [9,17], subcarrier allocations are developed on subcarrier by subcarrier based while in [14][15][16], [18][19][20][21][22] are developed on chunk by chunk based which could impact the decrease of complexity. In [9,14], [16][17], [19][20][21], the spectral efficiency are maximized while in [15,18], data rate fairness are maximized. In [20], chunk by chunk based using waterfilling power allocation are developed while fractional power control is implemented for limiting the user's transmit power.…”

“…In MEG [18], SMEG [18], iterative swapping chunk [16] and combined-order [22] algorithms also perform the subcarrier allocation in term of chunk. They perform subcarriers grouping before allocation process which have the similar process with our proposed algorithm in initialization process.…”

“…In MEG, SMEG and iterative swapping chunk algorithms have the time complexity as O(KC 2 ) [18], O(KC) [18] and O(KClogC) [16], respectively. The comparison of the combined order allocation using BER-based with some previous works is presented on Table 1.…”

“…Time Complexity Mean Enhanced Greedy [18] O(KC 2 ) Single Mean Enhanced Greedy [18] O(KC) Iterative Swapping Chunk [16] O(KClogC) Combined-order Allocation [22] O(KC) Combined Allocation using BER-based O(KC) Table 1 shows that the proposed algorithm has the same complexity with the combinedorder [22] and SMEG [18] algorithms. It has less time complexity than MEG [18] and iterative swapping chunk [16] algorithms due to the use of single average calculation on each time transmission interval.…”