Distributed precoder optimization for interfering MISO channels

David A. Schmidt; Andreas Gründinger; Wolfgang Utschick; Michael L. Honig

doi:10.1109/WSA.2008.4475571

Distributed precoder optimization for interfering MISO channels

David A. Schmidt, Andreas Gründinger, Wolfgang Utschick, Michael L. Honig

Chair of Signal Processing

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

Abstract

In this paper, we examine the problem of two multiple-input-single-output (MISO) links that interfere with each other. We discuss some straightforward strategies for the users to optimize their rates and show how a certain degree of cooperation between the users can lead to an improvement of both individual links. We propose an algorithm that is based on the users exchanging 'interference prices' and is realizable in a distributed manner. The algorithm converges towards a locally sum-rate optimal solution and exhibits nearly identical performance as a non-distributed gradient ascent algorithm, outperforming the straightforward strategies over the complete range of noise powers.

Original language	English
Title of host publication	2008 International ITG Workshop on Smart Antennas, WSA 2008
Pages	285-290
Number of pages	6
DOIs	https://doi.org/10.1109/WSA.2008.4475571
State	Published - 2008
Event	2008 International ITG Workshop on Smart Antennas, WSA 2008 - Darmstadt, Germany Duration: 26 Feb 2008 → 27 Feb 2008

Publication series

Name	2008 International ITG Workshop on Smart Antennas, WSA 2008

Conference

Conference	2008 International ITG Workshop on Smart Antennas, WSA 2008
Country/Territory	Germany
City	Darmstadt
Period	26/02/08 → 27/02/08

Access to Document

10.1109/WSA.2008.4475571

Cite this

@inproceedings{75796c046deb40e9ad5f0e1c5225de96,

title = "Distributed precoder optimization for interfering MISO channels",

abstract = "In this paper, we examine the problem of two multiple-input-single-output (MISO) links that interfere with each other. We discuss some straightforward strategies for the users to optimize their rates and show how a certain degree of cooperation between the users can lead to an improvement of both individual links. We propose an algorithm that is based on the users exchanging 'interference prices' and is realizable in a distributed manner. The algorithm converges towards a locally sum-rate optimal solution and exhibits nearly identical performance as a non-distributed gradient ascent algorithm, outperforming the straightforward strategies over the complete range of noise powers.",

author = "Schmidt, {David A.} and Andreas Gr{\"u}ndinger and Wolfgang Utschick and Honig, {Michael L.}",

year = "2008",

doi = "10.1109/WSA.2008.4475571",

language = "English",

isbn = "9781424417575",

series = "2008 International ITG Workshop on Smart Antennas, WSA 2008",

pages = "285--290",

booktitle = "2008 International ITG Workshop on Smart Antennas, WSA 2008",

note = "2008 International ITG Workshop on Smart Antennas, WSA 2008 ; Conference date: 26-02-2008 Through 27-02-2008",

}

Schmidt, DA, Gründinger, A, Utschick, W & Honig, ML 2008, Distributed precoder optimization for interfering MISO channels. in 2008 International ITG Workshop on Smart Antennas, WSA 2008., 4475571, 2008 International ITG Workshop on Smart Antennas, WSA 2008, pp. 285-290, 2008 International ITG Workshop on Smart Antennas, WSA 2008, Darmstadt, Germany, 26/02/08. https://doi.org/10.1109/WSA.2008.4475571

Distributed precoder optimization for interfering MISO channels. / Schmidt, David A.; Gründinger, Andreas; Utschick, Wolfgang et al.
2008 International ITG Workshop on Smart Antennas, WSA 2008. 2008. p. 285-290 4475571 (2008 International ITG Workshop on Smart Antennas, WSA 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Distributed precoder optimization for interfering MISO channels

AU - Schmidt, David A.

AU - Gründinger, Andreas

AU - Utschick, Wolfgang

AU - Honig, Michael L.

PY - 2008

Y1 - 2008

N2 - In this paper, we examine the problem of two multiple-input-single-output (MISO) links that interfere with each other. We discuss some straightforward strategies for the users to optimize their rates and show how a certain degree of cooperation between the users can lead to an improvement of both individual links. We propose an algorithm that is based on the users exchanging 'interference prices' and is realizable in a distributed manner. The algorithm converges towards a locally sum-rate optimal solution and exhibits nearly identical performance as a non-distributed gradient ascent algorithm, outperforming the straightforward strategies over the complete range of noise powers.

AB - In this paper, we examine the problem of two multiple-input-single-output (MISO) links that interfere with each other. We discuss some straightforward strategies for the users to optimize their rates and show how a certain degree of cooperation between the users can lead to an improvement of both individual links. We propose an algorithm that is based on the users exchanging 'interference prices' and is realizable in a distributed manner. The algorithm converges towards a locally sum-rate optimal solution and exhibits nearly identical performance as a non-distributed gradient ascent algorithm, outperforming the straightforward strategies over the complete range of noise powers.

UR - http://www.scopus.com/inward/record.url?scp=49749088790&partnerID=8YFLogxK

U2 - 10.1109/WSA.2008.4475571

DO - 10.1109/WSA.2008.4475571

M3 - Conference contribution

AN - SCOPUS:49749088790

SN - 9781424417575

T3 - 2008 International ITG Workshop on Smart Antennas, WSA 2008

SP - 285

EP - 290

BT - 2008 International ITG Workshop on Smart Antennas, WSA 2008

T2 - 2008 International ITG Workshop on Smart Antennas, WSA 2008

Y2 - 26 February 2008 through 27 February 2008

ER -

Distributed precoder optimization for interfering MISO channels

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this