Max-min fairness linear transceiver design problem for a multi-user SIMO interference channel is polynomial time solvable

Ya Feng Liu, Mingyi Hong, Yu Hong Dai

Research output: Contribution to journalArticlepeer-review

22 Scopus citations

Abstract

Consider the linear transceiver design problem for a multi-user single-input multi-output (SIMO) interference channel. Assuming perfect channel knowledge, we formulate this problem as one of maximizing the minimum signal to interference plus noise ratio (SINR) among all the users, subject to individual power constraints at each transmitter. We prove in this letter that the max-min fairness linear transceiver design problem for the SIMO interference channel can be solved to global optimality in polynomial time. We further propose a low-complexity inexact cyclic coordinate ascent algorithm (ICCAA) to solve this problem. Numerical simulations show the proposed algorithm can efficiently find the global optimal solution of the considered problem.

Original languageEnglish (US)
Article number6353149
Pages (from-to)27-30
Number of pages4
JournalIEEE Signal Processing Letters
Volume20
Issue number1
DOIs
StatePublished - Jan 1 2013

Keywords

  • Beamforming
  • ICCAA
  • SIMO interference channel
  • complexity
  • max-min fairness

Fingerprint Dive into the research topics of 'Max-min fairness linear transceiver design problem for a multi-user SIMO interference channel is polynomial time solvable'. Together they form a unique fingerprint.

Cite this