Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137)
DOI: 10.1109/glocom.2000.891705
|View full text |Cite
|
Sign up to set email alerts
|

An efficient multiuser loading algorithm for OFDM-based broadband wireless systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
151
0

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 254 publications
(154 citation statements)
references
References 1 publication
0
151
0
Order By: Relevance
“…To reduce the computational load, some suboptimal algorithms have been proposed for MA and RA optimizations in [4]- [6]. However, the use of these algorithms is rather limited for the following reasons: In [4], it is assumed that the average signal-to-noise ratios (SNRs) of all users are identical; [5] is based on a modification of the RA cost; and [6] considers the case where the total transmission power is equally distributed to all subcarriers. Adaptive loading techniques for OFDM systems with multiple antennas have been developed in [7] and [8].…”
mentioning
confidence: 99%
“…To reduce the computational load, some suboptimal algorithms have been proposed for MA and RA optimizations in [4]- [6]. However, the use of these algorithms is rather limited for the following reasons: In [4], it is assumed that the average signal-to-noise ratios (SNRs) of all users are identical; [5] is based on a modification of the RA cost; and [6] considers the case where the total transmission power is equally distributed to all subcarriers. Adaptive loading techniques for OFDM systems with multiple antennas have been developed in [7] and [8].…”
mentioning
confidence: 99%
“…Furthermore, in rate adaptive optimization, Jang et al in [6] developed an algorithm, which maximizes the total user's rate subject to the transmitted power constraint. Yin et al in [7] extended the work of [6] while keeping the transmitted power at a minimum rate. Working on rate adaptive optimization, Rhee et al in [8] created an effective subcarrier allocation algorithm which ensures the fairness in resource allocation problems.…”
Section: ⅰ Introductionmentioning
confidence: 99%
“…First, they initialized the number of subcarriers per user based on the reasonable assumption of Yin et al in [7]. Then, after the power allocation, the proportion of subcarriers for each user become nearly equal to the normalized proportionality constants.…”
Section: Subcarrier Allocationmentioning
confidence: 99%
“…In general, there are three different approaches to solve such a mixed integer programming problem: The exhaustive search checks all possible subcarrier assignments [16,18], relaxing of constraints transforms integers into real valued variables [11,14] and dual decomposition searches for the optimal CA in the dual domain [16,17]. Yin and Lui [13] showed that the subcarrier allocation for the OFDMA downlink can be solved efficiently by the Hungarian algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…The solution for multiple users in an orthogonal frequency division multiple access (OFDMA) system is more involved due to the additional carrier allocation (CA) problem. OFDMA uplink and downlink have been considered by several authors, and many solutions have been proposed [11][12][13][14][15][16][17][18]. In general, there are three different approaches to solve such a mixed integer programming problem: The exhaustive search checks all possible subcarrier assignments [16,18], relaxing of constraints transforms integers into real valued variables [11,14] and dual decomposition searches for the optimal CA in the dual domain [16,17].…”
Section: Related Workmentioning
confidence: 99%