On downlink beamforming with greedy user selection: Performance analysis and a simple new algorithm

Goran Dimić; Nicholas D. Sidiropoulos

doi:10.1109/TSP.2005.855401

On downlink beamforming with greedy user selection: Performance analysis and a simple new algorithm

Goran Dimić, Nicholas D. Sidiropoulos

Electrical and Computer Engineering

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

542 Scopus citations

Abstract

This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array to create multiple "beams" directed toward the individual users, and the aim is to increase throughput, measured by sum capacity. In particular, we are interested in the practically important case of more users than transmit antennas, which requires user selection. Optimal solutions to this problem can be prohibitively complex for online implementation at the base station and entail so-called Dirty Paper (DP) precoding for known interference. Suboptimal solutions capitalize on multiuser (selection) diversity to achieve a significant fraction of sum capacity at lower complexity cost. We analyze the throughput performance in Rayleigh fading of a suboptimal greedy DP-based scheme proposed by Tu and Blum. We also propose another user-selection method of the same computational complexity based on simple zero-forcing beamforming. Our results indicate that the proposed method attains a significant fraction of sum capacity and throughput of Tu and Blum's scheme and, thus, offers an attractive alternative to DP-based schemes.

Original language	English (US)
Pages (from-to)	3857-3868
Number of pages	12
Journal	IEEE Transactions on Signal Processing
Volume	53
Issue number	10 I
DOIs	https://doi.org/10.1109/TSP.2005.855401
State	Published - Oct 2005

Bibliographical note

Funding Information:
Manuscript received May 12, 2004; revised November 26, 2004. This work was supported in part by the European Research Office (ERO) of the U.S. Army under Contract N62558-03-C-0012 and in part by the Army Research Laboratory under Cooperative Agreement DADD19-01-2-0011. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of ERO and ARL of the U.S. Army. U.S.–Greek exchange supported in part by a GSRT collaborative exchange grant. An earlier version of part of this work appears in Proc. IEEE ICASSP 2004, May 17-21, 2004, Montréal, QC, Canada. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Vikram Krishnamurthy.

Keywords

Beamforming
Downlink
Multiuser diversity

Publisher link

10.1109/TSP.2005.855401

Find It

Find It at U of M Libraries

Cite this

@article{964396b4c2ba468db0de147894962f24,

title = "On downlink beamforming with greedy user selection: Performance analysis and a simple new algorithm",

abstract = "This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array to create multiple {"}beams{"} directed toward the individual users, and the aim is to increase throughput, measured by sum capacity. In particular, we are interested in the practically important case of more users than transmit antennas, which requires user selection. Optimal solutions to this problem can be prohibitively complex for online implementation at the base station and entail so-called Dirty Paper (DP) precoding for known interference. Suboptimal solutions capitalize on multiuser (selection) diversity to achieve a significant fraction of sum capacity at lower complexity cost. We analyze the throughput performance in Rayleigh fading of a suboptimal greedy DP-based scheme proposed by Tu and Blum. We also propose another user-selection method of the same computational complexity based on simple zero-forcing beamforming. Our results indicate that the proposed method attains a significant fraction of sum capacity and throughput of Tu and Blum's scheme and, thus, offers an attractive alternative to DP-based schemes.",

keywords = "Beamforming, Downlink, Multiuser diversity",

author = "Goran Dimi{\'c} and Sidiropoulos, {Nicholas D.}",

note = "Funding Information: Manuscript received May 12, 2004; revised November 26, 2004. This work was supported in part by the European Research Office (ERO) of the U.S. Army under Contract N62558-03-C-0012 and in part by the Army Research Laboratory under Cooperative Agreement DADD19-01-2-0011. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of ERO and ARL of the U.S. Army. U.S.–Greek exchange supported in part by a GSRT collaborative exchange grant. An earlier version of part of this work appears in Proc. IEEE ICASSP 2004, May 17-21, 2004, Montr{\'e}al, QC, Canada. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Vikram Krishnamurthy.",

year = "2005",

month = oct,

doi = "10.1109/TSP.2005.855401",

language = "English (US)",

volume = "53",

pages = "3857--3868",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10 I",

}

TY - JOUR

T1 - On downlink beamforming with greedy user selection

T2 - Performance analysis and a simple new algorithm

AU - Dimić, Goran

AU - Sidiropoulos, Nicholas D.

N1 - Funding Information: Manuscript received May 12, 2004; revised November 26, 2004. This work was supported in part by the European Research Office (ERO) of the U.S. Army under Contract N62558-03-C-0012 and in part by the Army Research Laboratory under Cooperative Agreement DADD19-01-2-0011. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of ERO and ARL of the U.S. Army. U.S.–Greek exchange supported in part by a GSRT collaborative exchange grant. An earlier version of part of this work appears in Proc. IEEE ICASSP 2004, May 17-21, 2004, Montréal, QC, Canada. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Vikram Krishnamurthy.

PY - 2005/10

Y1 - 2005/10

N2 - This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array to create multiple "beams" directed toward the individual users, and the aim is to increase throughput, measured by sum capacity. In particular, we are interested in the practically important case of more users than transmit antennas, which requires user selection. Optimal solutions to this problem can be prohibitively complex for online implementation at the base station and entail so-called Dirty Paper (DP) precoding for known interference. Suboptimal solutions capitalize on multiuser (selection) diversity to achieve a significant fraction of sum capacity at lower complexity cost. We analyze the throughput performance in Rayleigh fading of a suboptimal greedy DP-based scheme proposed by Tu and Blum. We also propose another user-selection method of the same computational complexity based on simple zero-forcing beamforming. Our results indicate that the proposed method attains a significant fraction of sum capacity and throughput of Tu and Blum's scheme and, thus, offers an attractive alternative to DP-based schemes.

AB - This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array to create multiple "beams" directed toward the individual users, and the aim is to increase throughput, measured by sum capacity. In particular, we are interested in the practically important case of more users than transmit antennas, which requires user selection. Optimal solutions to this problem can be prohibitively complex for online implementation at the base station and entail so-called Dirty Paper (DP) precoding for known interference. Suboptimal solutions capitalize on multiuser (selection) diversity to achieve a significant fraction of sum capacity at lower complexity cost. We analyze the throughput performance in Rayleigh fading of a suboptimal greedy DP-based scheme proposed by Tu and Blum. We also propose another user-selection method of the same computational complexity based on simple zero-forcing beamforming. Our results indicate that the proposed method attains a significant fraction of sum capacity and throughput of Tu and Blum's scheme and, thus, offers an attractive alternative to DP-based schemes.

KW - Beamforming

KW - Downlink

KW - Multiuser diversity

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

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

U2 - 10.1109/TSP.2005.855401

DO - 10.1109/TSP.2005.855401

M3 - Article

AN - SCOPUS:27844471971

SN - 1053-587X

VL - 53

SP - 3857

EP - 3868

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 10 I

ER -

On downlink beamforming with greedy user selection: Performance analysis and a simple new algorithm

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this