A Computationally Efficient Discrete Bit-Loading Algorithm for OFDM Systems Subject to Spectral-Compatibility Limits

This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems. The contribution is twofold. First, we propose a simple criterion to switch between two well-known algorithms from the literature: the conventional Gr...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 63; číslo 6; s. 2261 - 2272
Hlavní autoři:	Thanh Nhan Vo, Amis, Karine, Chonavel, Thierry, Siohan, Pierre
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.06.2015 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Témata:	Algorithm design and analysis Algorithms Bit-loading Complexity theory Computational efficiency Engineering Sciences Greedy Algorithm Greedy algorithms Heuristic Loading Low-complexity algorithm Mathematical analysis Maximization OFDM Orthogonal Frequency Division Multiplexing Rate adaptive Signal and Image processing Spectra Subcarriers Switches Throughput Vectors (mathematics) Greedy algorithm Bit-loading rate-adaptive OFDM low-complexity algorithm
ISSN:	0090-6778, 1558-0857
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!