.png){kind=icon}
.png){kind=icon}
Return
A Low-Complexity Bit-Loading Algorithm for OFDM Systems Under Spectral Mask Constraint
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2016.2521358.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter aims to solve the power minimization problem for interference-free OFDM systems under achievable throughput and spectral mask constraints. To this end, we use a general analytic formula to yield an efficient initial bit vector, i.e., given a total number of bits, the total power use corresponding to an efficient bit vector is minimum. We propose a low-complexity algorithm that achieves the global optimum of the problem. We theoretically prove that the number of bits required to add/remove, starting fromthe efficient initial bit vector, is upper bounded by the sum of half the number of active subcarriers and an arbitrary tolerance value. Simulation results show that the total power consumption is minimized with significant reduction of the computation cost as compared to other optimum algorithms.
Keywords:
Bit-loading
greedy Algorithm
Low-complexity algorithm
Margin-adaptive
OFDM
Spectral mask constraint
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W