Skip to main navigation Skip to search Skip to main content

Particle Swarm Optimization for Weighted Sum Rate Maximization in MIMO Broadcast Channels

  • Ho Chi Minh City University of Technology - HCMUT
  • Queen's University Belfast
  • Duy Tan University

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

In this paper, we investigate the downlink multiple-input-multiple-output (MIMO) broadcast channels in which a base transceiver station (BTS) broadcasts multiple data streams to K MIMO mobile stations (MSs) simultaneously. In order to maximize the weighted sum-rate (WSR) of the system subject to the transmitted power constraint, the design problem is to find the pre-coding matrices at BTS and the decoding matrices at MSs. However, such a design problem is typically a nonlinear and nonconvex optimization and, thus, it is quite hard to obtain the analytical solutions. To tackle with the mathematical difficulties, we propose an efficient stochastic optimization algorithm to optimize the transceiver matrices. Specifically, we utilize the linear minimum mean square error Wiener filters at MSs. Then, we introduce the constrained particle swarm optimization algorithm to jointly optimize the precoding and decoding matrices. Numerical experiments are exhibited to validate the effectiveness of the proposed algorithm in terms of convergence, computational complexity and total WSR.

Original languageEnglish
Pages (from-to)3907-3921
Number of pages15
JournalWireless Personal Communications
Volume96
Issue number3
DOIs
Publication statusPublished - 1 Oct 2017

Bibliographical note

Publisher Copyright:
© 2017, Springer Science+Business Media New York.

Keywords

  • Broadcast channel
  • Multiuser MIMO
  • Particle swarm optimization
  • Transceiver designs
  • Weighted sum rate maximization

Fingerprint

Dive into the research topics of 'Particle Swarm Optimization for Weighted Sum Rate Maximization in MIMO Broadcast Channels'. Together they form a unique fingerprint.

Cite this