2007
DOI: 10.1155/2008/643081
|View full text |Cite
|
Sign up to set email alerts
|

Bit and Power Allocation in Constrained Multicarrier Systems: The Single-User Case

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
75
0
9

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 100 publications
(85 citation statements)
references
References 18 publications
1
75
0
9
Order By: Relevance
“…However, since we obtain the global optimum for each sub-problem, the proposed AO algorithm converges to a stationary point of the objective function (15). This conclusion has been proved in Appendix 3 and verified by simulation examples in Section 8.…”
Section: Converge Of the Ao Algorithmsupporting
confidence: 57%
See 3 more Smart Citations
“…However, since we obtain the global optimum for each sub-problem, the proposed AO algorithm converges to a stationary point of the objective function (15). This conclusion has been proved in Appendix 3 and verified by simulation examples in Section 8.…”
Section: Converge Of the Ao Algorithmsupporting
confidence: 57%
“…6 Signaling path gains see Fig. 9 Normalized path gains see Fig. 10 This indicates that θ {n} is a stationary point of (15).…”
Section: Discussionmentioning
confidence: 96%
See 2 more Smart Citations
“…The algorithm is performed iteratively until the remaining power budget is not enough to increase the data rate in any band. This algorithm is similar to the bit-loading technique found in the literature, e.g., [10] and references therein.…”
Section: B Greedy Algorithmmentioning
confidence: 98%