Proceedings IEEE 56th Vehicular Technology Conference
DOI: 10.1109/vetecf.2002.1040769
|View full text |Cite
|
Sign up to set email alerts
|

Multiuser subcarrier allocation for QoS provision in the OFDMA systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
43
0
1

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 82 publications
(44 citation statements)
references
References 4 publications
0
43
0
1
Order By: Relevance
“…Such approach is motivated by a simple observation that users with good channels require less transmit power, thus causes less CCI and therefore have higher chances for admission. Various options of this routine have been described in many papers, including [5], [4] and [3]. An alternative strategy is to use the optimal Hungarian algorithm or to improve the greedy assignment by swapping subcarriers between users as in [5], [3].…”
Section: Step 2: Subcarrier To User Allocationmentioning
confidence: 99%
See 2 more Smart Citations
“…Such approach is motivated by a simple observation that users with good channels require less transmit power, thus causes less CCI and therefore have higher chances for admission. Various options of this routine have been described in many papers, including [5], [4] and [3]. An alternative strategy is to use the optimal Hungarian algorithm or to improve the greedy assignment by swapping subcarriers between users as in [5], [3].…”
Section: Step 2: Subcarrier To User Allocationmentioning
confidence: 99%
“…Various options of this routine have been described in many papers, including [5], [4] and [3]. An alternative strategy is to use the optimal Hungarian algorithm or to improve the greedy assignment by swapping subcarriers between users as in [5], [3]. These methods, however, are not considered here due to their increased computational complexity.…”
Section: Step 2: Subcarrier To User Allocationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, while achieving significant gain, this algorithm might not reach the optimal solution (in terms of achieving the total maximum channel gain for users). The Hungarian method [9] and sort-swap algorithm [10] are introduced and extended to solve this allocation problem as an assignment problem in maximizing total channel gain and achieve an optimal solution. However, simulation results show that the DSA algorithm in [3] achieves perceived channel gains within a fraction of a decibel of the optimal solution [11].…”
Section: Introductionmentioning
confidence: 99%
“…More specifically, using a simple but efficient uniform SSCH (USSCH) pattern, the SSCH/SDMA-OFDM system is capable of achieving a high frequency diversity, and hence exhibits a high robustness to MUI. In the literature, substantial research efforts have been invested in designing subcarrier allocation algorithms for singleinput-single-output (SISO) OFDM systems, which are subject to various design constraints, such as requiring the minimal overall transmit power [14][15][16][17][18][19], achieving the maximum capacity [19][20][21] or complying with specific quality-of-service (QoS) criteria [22], etc. A subcarrier and bit allocation algorithm designed for minimising the overall transmit power for a MIMO-OFDM systems was proposed in [23].…”
Section: Introductionmentioning
confidence: 99%