2013
DOI: 10.1109/wcl.2013.052813.130085
|View full text |Cite
|
Sign up to set email alerts
|

Joint Optimization of Bit and Power Loading for Multicarrier Systems

Abstract: Abstract-In this letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient α, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial α causes the transmit power not to violate the power constrain… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 20 publications
(14 citation statements)
references
References 6 publications
0
14
0
Order By: Relevance
“…To prove Proposition 1(i), we first show that the achievable rate R(H, Q) can be asymptotically characterized by C MT and Q regardless of channel realization H. Combining (38) and (39), we obtain (37). With Remark 1, we can obtain an upper bound for the full CSIT capacity as detailed below.…”
Section: A Proof Of Propositionmentioning
confidence: 96%
See 1 more Smart Citation
“…To prove Proposition 1(i), we first show that the achievable rate R(H, Q) can be asymptotically characterized by C MT and Q regardless of channel realization H. Combining (38) and (39), we obtain (37). With Remark 1, we can obtain an upper bound for the full CSIT capacity as detailed below.…”
Section: A Proof Of Propositionmentioning
confidence: 96%
“…In a MIMO channel with antenna correlation, information rates should be carefully allocated to different channel eigen-directions. Adaptive modulation is a standard approach for this purpose [37], [38]. Denote the number of bits carried by the symbol on the n-th eigen-direction by Q n , and its average over all eigen-directions byQ.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, MOOP has attracted researchers' attention due to its flexible and superior performance over single objective optimization approaches [10]. For most of the MOOP problems, due to the contradiction and incommensurability of the competing objective functions, it is not possible to find a single solution that optimizes all the objective functions simultaneously.…”
Section: Optimization Problem and Proposed Algorithmmentioning
confidence: 99%
“…MOPs are considered widely in recent literature (e.g. [23]- [28]). In detail, considering multicarrier systems, [23] proposed an algorithm to jointly maximize the throughput and minimize the transmission power while satisfying target constraints on the bit-error-rate (BER) per subcarrier and on the total transmit power.…”
Section: Introductionmentioning
confidence: 99%