Enhanced Greedy Algorithm Based Dynamic Subcarrier Allocation for Single Carrier FDMA Systems

Nwamadi, Obilor; Zhu, Xu; Nandi, Asoke K.

doi:10.1109/wcnc.2009.4917713

Cited by 33 publications

(37 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Specifically, in the OFDMA systems that transmit on each subcarrier one data stream, the matrix is constituted by number of identity sub-matrices, each of which is for one user. By contrast, in the SC-FDMA systems where one data stream is transmitted on several subcarriers, the matrix is then structured by number of Fourier transform matrices, each of which is for one user [6].…”

Section: ∈ℱmentioning

confidence: 99%

“…Based on (6), then, the subcarrier-allocation starts with the subcarrier accommodating the worst channel quality. In other words, subcarriers are allocated from left to right in (6). As shown in (6), since for the fifth subcarrier user 1 has the best channel quality, hence the fifth subcarrier is assigned to user 1, which consequently avoids assigning user 2 this subcarrier.…”

Section: A Subcarrier-allocationmentioning

confidence: 99%

“…Hence, the total number of operations is about (2 ( − 1) + 2 ln ), yielding a complexity of ( ) when assuming ≥ ln . The exact number of operations required by the Hungarian algorithm [3] is very hard to analyze, due to the randomness of the cost matrices invoked and the heuristic nature of the algorithm [6]. In [11], the maximum number of operations required by the Hungarian algorithm has been analyzed, which is found to be (11 3 +12 2 +31 )/6.…”

Section: Complexity Analysismentioning

confidence: 99%

“…However, the performance improvement of the WUF Greedy algorithm over the Greedy algorithm is very limited. In [6] a so-called Maximal Greedy algorithm has been developed. In the context of this algorithm, first, several subcarrier allocations based on the Greedy algorithm are operated by ordering the users in different ways.…”

Section: Introductionmentioning

confidence: 99%

“…Then, the allocation resulting in the best error performance is chosen as the final subcarrier-allocation. The study in [6] shows that the Maximal Greedy algorithm is capable of improving the error performance significantly, but at the cost of a significantly increase of complexity. Additionally, in [7,8] the subcarrier-allocation problem has also been investigated, which uses the Greedy algorithm to find an initial allocation and, then, improves it by iteratively swapping a pair of subcarriers of two arbitrary users.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A low-complexity subcarrier-power allocation scheme for frequency-division multiple-access systems

Liu

Yang

2010

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-This letter aims to design a low-complexity subcarrier-power allocation scheme to improve the communication reliability of various types of frequency-division multipleaccess (FDMA) systems. Both uplink and downlink are considered. Specifically, a low-complexity worst subcarrier avoiding (WSA) subcarrier-allocation scheme is proposed, in order to avoid assigning users the subcarriers experiencing severe fading. After the subcarrier-allocation, channel-inversion assisted powerallocation is employed to assign the subcarriers the corresponding power. Our studies and simulation results show that the achievable error performance of the FDMA systems employing the proposed subcarrier-power allocation algorithm is independent of the multiplexing method. The proposed algorithm outperforms the existing subcarrier-power allocation algorithms that have a similar complexity as the proposed one.

show abstract

Section: ∈ℱmentioning

confidence: 99%

Section: A Subcarrier-allocationmentioning

confidence: 99%

Section: Complexity Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A low-complexity subcarrier-power allocation scheme for frequency-division multiple-access systems

Liu

Yang

2010

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

Maximizing energy efficiency in SC‐FDMA uplink with QoS guarantees and user satisfaction

Braga

Lima

Maciel

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Despite the advent of fifth-generation mobile networks in the next years, the Long-Term Evolution system still have an important role in the mobile communication scenario. Moreover, the development of solutions that fulfill the demand of new multimedia applications as well as provide an efficient use of the energy resources is one of the drivers of future networks. Therefore, in this article, we deal with the total energy efficiency maximization problem subject to minimum satisfaction constraints per service and quality of service in the uplink of Long-Term Evolution using single-carrier frequency-division multiple access. Although the formulated problem is a nonlinear combinatorial optimization problem, we obtain the optimal solution through algebraic manipulations and by using an iterative method. Motivated by the high computational complexity to obtain the optimal solution, we propose a heuristic solution with lower computational complexity. Realistic system-level simulations indicate that the proposed solution presents good performance regarding both outage rate and energy efficiency.Trans Emerging Tel Tech. 2019;30:e3674.wileyonlinelibrary.com/journal/ett

show abstract

Differentiating and Scheduling LTE Uplink Traffic Based on Exponentially Weighted Moving Average of Data Rate

et al. 2016

View full text Add to dashboard Cite

The importance of uplink resource allocation in ensuring the Quality of Service (QoS) of guaranteed bit rate (GBR) bearers has led to the development of numerous resource allocation schemes. The criteria used in the development of such schemes include maximizing system throughput or fairness and the ability to take transmission power or user priority into account. After accepting a GBR bearer, the eNodeB (eNB) must allocate sufficient resource blocks (RBs) to guarantee the requested QoS. In order to achieve high utilization of radio resource, eNB also must allocate remaining RBs to non-GBR bearers. The QoS is generally specified by the data rate (throughput) or packet delay; however, the 3rd Generation Partnership Project (3GPP) has not specified the means by which data rates for a GBR bearer are to be measured. In this paper, we define the measurement of data rates based on the exponentially weighted moving average (EWMA), thereby enabling the eNB to perform scheduling tasks with greater accuracy. We also present an AAG-2 (Allocate As Granted-version 2) scheme capable of supporting the QoS for GBR bearers, while enabling the efficient allocation of RBs to non-GBR bearers. The existence of parties seeking superior levels of service makes it necessary for telecommunications operators to provide options with regard to QoS. This study proposes a revision of the AAG-2 scheme referred to as AAG-D to accommodate such demands. Simulation results demonstrate the efficacy of the new scheme in achieving goals related to throughput and average packet delay.

show abstract

Enhanced Greedy Algorithm Based Dynamic Subcarrier Allocation for Single Carrier FDMA Systems

Cited by 33 publications

References 11 publications

A low-complexity subcarrier-power allocation scheme for frequency-division multiple-access systems

A low-complexity subcarrier-power allocation scheme for frequency-division multiple-access systems

Maximizing energy efficiency in SC‐FDMA uplink with QoS guarantees and user satisfaction

Differentiating and Scheduling LTE Uplink Traffic Based on Exponentially Weighted Moving Average of Data Rate

Contact Info

Product

Resources

About