2006 IEEE International Symposium on Information Theory 2006
DOI: 10.1109/isit.2006.262075
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Resource Allocation for OFDMA Downlink Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

6
340
0
2

Year Published

2012
2012
2019
2019

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 451 publications
(352 citation statements)
references
References 6 publications
6
340
0
2
Order By: Relevance
“…have been proposed for transmit power minimization such as in [12], [14]. In this paper, without loss of generality, we use the Bandwidth Assignment Based on SNR (BABS) algorithm to compute the number of subchannels per user and the Amplitude-Craving Greedy (ACG) algorithm for subchannel assignment.…”
Section: Resource Allocationmentioning
confidence: 99%
“…have been proposed for transmit power minimization such as in [12], [14]. In this paper, without loss of generality, we use the Bandwidth Assignment Based on SNR (BABS) algorithm to compute the number of subchannels per user and the Amplitude-Craving Greedy (ACG) algorithm for subchannel assignment.…”
Section: Resource Allocationmentioning
confidence: 99%
“…For (7), we apply the relaxation technique to convert binary variables into continuous ones. Then we use Lagrange dual function which has been widely utilized for solving OFDMA-based resource allocation problems [6], [22].…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…Now, by considering y ks,n = α ks,n P ks,n , the total rate of OFDMA can be rewritten as [6], [22], R OFDMA ks,n (α, y) = α ks,n log 2 (1 + y ks,n h ks,n α ks,n σ 2 ).…”
Section: B Dual Approach For Ofdma-based Resource Allocationmentioning
confidence: 99%
See 1 more Smart Citation
“…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]. 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%