2000
DOI: 10.1109/26.818869
|View full text |Cite
|
Sign up to set email alerts
|

Computationally efficient optimal power allocation algorithms for multicarrier communication systems

Abstract: Abstract-In this paper, we present an optimal, computationally efficient, integer-bit power allocation algorithm for discrete multitone modulation. Using efficient lookup table searches and a Lagrange-multiplier bisection search, our algorithm converges faster to the optimal solution than existing techniques and can replace the use of suboptimal methods because of its low computational complexity. Fast algorithms are developed for the data rate and performance margin maximization problems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
171
0
3

Year Published

2004
2004
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 322 publications
(175 citation statements)
references
References 5 publications
1
171
0
3
Order By: Relevance
“…(3) has been solved by the authors via expansion to coded systems of the well known bisection approach used by Krongold et al [1]. The set of all rate-power pairs at a given BER/FER P Target of all allowed transmission modes, employing SNR thresholds obtained from AWGN simulation as well as analytical expressions for uncoded M -QAMs, has been used to find a convex set allowing for a convex optimisation solution of (3) via Lagrangian multipliers [10].…”
Section: Simulation Supported Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…(3) has been solved by the authors via expansion to coded systems of the well known bisection approach used by Krongold et al [1]. The set of all rate-power pairs at a given BER/FER P Target of all allowed transmission modes, employing SNR thresholds obtained from AWGN simulation as well as analytical expressions for uncoded M -QAMs, has been used to find a convex set allowing for a convex optimisation solution of (3) via Lagrangian multipliers [10].…”
Section: Simulation Supported Methodsmentioning
confidence: 99%
“…In order to carry out the optimisation, the rates have to be formulated as explicit functions of the powers, such that r k = f (p k ), which in case of coded systems with finite symbol alphabets is a non-trivial problem. If channel coding is neglected, analytical BER/FER expressions, e.g., for M -QAM modulations, can be used [1][2][3]. Due to the difficulties in finding analytical expressions for the FER of coded systems, however, the simulated performance of different code and modulation combinations is often utilised to quantify the performance [8,10].…”
Section: Simulation Supported Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In [18] the optimal and suboptimal power allocations are combined with Coded Weak Sub Carrier Excision (CWSE) method, where the weak subcarriers are excluded from transmission. Power allocation with objective to maximize the bit rate subject to a finite total allocated power and minimizing the total power allocation subject to a finite target rate optimization problem are decribed in [19], while in [20] a look up table, to find rate-SNR operating point, and Lagrange multiplier bisection search method are applied to calculate the allocated power on each carrier.…”
Section: Adaptive Power Allocationmentioning
confidence: 99%
“…The most prominent example is the Hughes-Hartogs algorithm [1], but there also exist far more efficient implementations that exploit the convexity of the rate-power region, e.g. [8]. Note that instead of simple scaling it is, of course, also possible to redistribute the transmit powers according to [7] once the bit allocation has been found.…”
Section: Bit and Power Loadingmentioning
confidence: 99%