Stochastic Successive Weighted Sum-Rate Maximization for Multiuser MIMO Systems with Finite-Alphabet Inputs

Weighted sum-rate maximization (WSRM) is a fundamental problem for multiuser multiple-input-multiple-output (MU- MIMO) systems with finite-alphabet inputs. However, solving this problem is challenging because of the intractable expectation involved in rate functions. The state-of-art WSRM methods fo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) s. 4870 - 4874
Hlavní autoři: Guan, Xin, Zhao, Xiaotong, Shi, Qingjiang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 06.06.2021
Témata:
Conferences
finite-alphabet
inexact lower bound
Linear programming
Minimization
MU- MIMO
Signal processing
Signal processing algorithms
Simulation
Speech processing
stochastic successive WSRM
ISSN:2379-190X
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í:Weighted sum-rate maximization (WSRM) is a fundamental problem for multiuser multiple-input-multiple-output (MU- MIMO) systems with finite-alphabet inputs. However, solving this problem is challenging because of the intractable expectation involved in rate functions. The state-of-art WSRM methods for the case of finite-alphabet inputs suffer from high computational complexity due to the issue of complicated numerical integrals for expectation calculation. Inspired by the stochastic successive upper-bound minimization (SSUM) method [1], this paper proposes a stochastic successive inexact lower-bound maximization (SSILM) algorithm for the WSRM problem with finite-alphabet inputs. Our algorithm significantly differs from SSUM in that we use an inexact lower bound of the objective function which is skillfully devised based on an exact but extremely loose lower bound of the objective function. Simulation results show that the proposed algorithm exhibits much faster convergence than state-of-art algorithms.
ISSN:2379-190X
DOI:10.1109/ICASSP39728.2021.9413799