Low complexity non-iterative coordinated beamforming in 2-user broadcast channels

Ki Hong Park, Young-Chai Ko, Mohamed Slim Alouini

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We propose a new non-iterative coordinated beamforming scheme to obtain full multiplexing gain in 2-user MIMO systems. In order to find the beamforming and combining matrices, we solve a generalized eigenvector problem and describe how to find generalized eigenvectors according to the Gaussian broadcast channels. Selected simulation results show that the proposed method yields the same sum-rate performance as the iterative coordinated beamforming method, while maintaining lower complexity by non-iterative computation of the beamforming and combining matrices. We also show that the proposed method can easily exploit selective gain by choosing the best combination of generalized eigenvectors.

Original languageEnglish
Article number5567184
Pages (from-to)2810-2815
Number of pages6
JournalIEEE Transactions on Communications
Volume58
Issue number10
DOIs
Publication statusPublished - 2010 Oct 1

Fingerprint

Beamforming
Eigenvalues and eigenfunctions
Multiplexing
MIMO systems

Keywords

  • Coordinated beamforming
  • Gaussian broadcast channel
  • generalized eigenvector problem

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Low complexity non-iterative coordinated beamforming in 2-user broadcast channels. / Park, Ki Hong; Ko, Young-Chai; Alouini, Mohamed Slim.

In: IEEE Transactions on Communications, Vol. 58, No. 10, 5567184, 01.10.2010, p. 2810-2815.

Research output: Contribution to journalArticle

@article{a21c6f58fea6492d9267530727c25d76,
title = "Low complexity non-iterative coordinated beamforming in 2-user broadcast channels",
abstract = "We propose a new non-iterative coordinated beamforming scheme to obtain full multiplexing gain in 2-user MIMO systems. In order to find the beamforming and combining matrices, we solve a generalized eigenvector problem and describe how to find generalized eigenvectors according to the Gaussian broadcast channels. Selected simulation results show that the proposed method yields the same sum-rate performance as the iterative coordinated beamforming method, while maintaining lower complexity by non-iterative computation of the beamforming and combining matrices. We also show that the proposed method can easily exploit selective gain by choosing the best combination of generalized eigenvectors.",
keywords = "Coordinated beamforming, Gaussian broadcast channel, generalized eigenvector problem",
author = "Park, {Ki Hong} and Young-Chai Ko and Alouini, {Mohamed Slim}",
year = "2010",
month = "10",
day = "1",
doi = "10.1109/TCOMM.2010.083110.090013",
language = "English",
volume = "58",
pages = "2810--2815",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Low complexity non-iterative coordinated beamforming in 2-user broadcast channels

AU - Park, Ki Hong

AU - Ko, Young-Chai

AU - Alouini, Mohamed Slim

PY - 2010/10/1

Y1 - 2010/10/1

N2 - We propose a new non-iterative coordinated beamforming scheme to obtain full multiplexing gain in 2-user MIMO systems. In order to find the beamforming and combining matrices, we solve a generalized eigenvector problem and describe how to find generalized eigenvectors according to the Gaussian broadcast channels. Selected simulation results show that the proposed method yields the same sum-rate performance as the iterative coordinated beamforming method, while maintaining lower complexity by non-iterative computation of the beamforming and combining matrices. We also show that the proposed method can easily exploit selective gain by choosing the best combination of generalized eigenvectors.

AB - We propose a new non-iterative coordinated beamforming scheme to obtain full multiplexing gain in 2-user MIMO systems. In order to find the beamforming and combining matrices, we solve a generalized eigenvector problem and describe how to find generalized eigenvectors according to the Gaussian broadcast channels. Selected simulation results show that the proposed method yields the same sum-rate performance as the iterative coordinated beamforming method, while maintaining lower complexity by non-iterative computation of the beamforming and combining matrices. We also show that the proposed method can easily exploit selective gain by choosing the best combination of generalized eigenvectors.

KW - Coordinated beamforming

KW - Gaussian broadcast channel

KW - generalized eigenvector problem

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

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

U2 - 10.1109/TCOMM.2010.083110.090013

DO - 10.1109/TCOMM.2010.083110.090013

M3 - Article

AN - SCOPUS:77958105923

VL - 58

SP - 2810

EP - 2815

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 10

M1 - 5567184

ER -