Resource allocation in a K-user wireless broadcast system with N-layer superposition coding

In this paper, we study the resource allocation problem in a K-user wireless broadcast system with N-layer superposition coding (SPC). The problem is formulated as a sumutility maximization problem based on the average throughput. Using stochastic approximation, iteratively solving an approximated p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 IEEE Wireless Communications and Networking Conference (WCNC) s. 789 - 794
Hlavní autoři: Xuan Wang, Lin Cai
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2013
Témata:
Approximation methods
Computational complexity
Fading
Optimized production technology
Resource management
Signal to noise ratio
Throughput
ISBN:9781467359382, 1467359386
ISSN:1525-3511
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!
Popis
Shrnutí:In this paper, we study the resource allocation problem in a K-user wireless broadcast system with N-layer superposition coding (SPC). The problem is formulated as a sumutility maximization problem based on the average throughput. Using stochastic approximation, iteratively solving an approximated problem yields the optimality. The approximated problem can be solved by selecting the user group with the maximal weighted-sum-rate, which has a high computational complexity. Two low-complexity suboptimal algorithms are proposed. The simulation results show that the SPC gain highly depends on the variability of the channel and the SNR range of users. SPC is more favourable in the scenario with small-variation fast-fading channel and a large SNR range of users. The performance of the proposed low-complexity algorithms are close to the optimal solution, and the SPC gain achieved is substantial.
ISBN:9781467359382
1467359386
ISSN:1525-3511
DOI:10.1109/WCNC.2013.6554664