An Improved Low Complexity OFDM Adaptive Bit Power Allocation Method

Adaptive modulation technology can adaptively perform bit and power allocation of subcarriers based on channel state information to improve the transmission performance of the communication system. The traditional Greedy algorithm can achieve optimal bit and power allocation results, but requires a...

Full description

Saved in:
Bibliographic Details
Published in2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) pp. 315 - 320
Main Authors Zhou, Kaifu, Cheng, Wei, Dou, Lichao, Bao, Leilei
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2019
Subjects
adaptive modulation
Adaptive systems
bit power allocation
Bit rate
Complexity theory
Greedy algorithm
Greedy algorithms
mapping relation table
Modulation
OFDM
Resource management
Online AccessGet full text

Cover

More Information
Summary:Adaptive modulation technology can adaptively perform bit and power allocation of subcarriers based on channel state information to improve the transmission performance of the communication system. The traditional Greedy algorithm can achieve optimal bit and power allocation results, but requires a lot of search and sorting during the allocation process. When the number of subcarriers or average number of bits per subcarrier (BPS) is large, the algorithm has high complexity and poor real-time performance. This paper proposes a fast pre-allocation Greedy algorithm based on table lookup. The method establishes a Mapping table between bit allocation and channel gain, realizes bit fast pre-allocation by looking up the table, and then performs iterative optimization allocation based on the Greedy algorithm. The simulation results show that the improved algorithm complexity is greatly reduced, and its bit error performance is similar to the algorithm.
DOI:10.1109/ITNEC.2019.8729328