Low complexity symbol-wise beamforming for MIMO-OFDM systems

Hyun Ho Lee; Ki Hong Park; Hong Chuan Yang; Young Chai Ko

doi:10.1109/GLOCOM.2011.6133725

Low complexity symbol-wise beamforming for MIMO-OFDM systems

Hyun Ho Lee, Ki Hong Park, Hong Chuan Yang, Young Chai Ko

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

2 Citations (Scopus)

Abstract

In this paper, we consider a low complexity symbol-wise beamforming for MIMO-OFDM systems. We propose a non-iterative algorithm for the symbol-wise beamforming, which can provide the performance approaching that of the conventional symbol-wise beamforming based on the iterative algorithm. We demonstrate that our proposed scheme can reduce the computational complexity significantly. From our simulation results, it is evident that our proposed scheme leads to a negligible performance loss compared to the conventional symbol-wise beamforming regardless of spatial correlation or presence of co-channel interference.

Original language	English
Title of host publication	2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs	https://doi.org/10.1109/GLOCOM.2011.6133725
Publication status	Published - 2011
Event	54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States Duration: 2011 Dec 5 → 2011 Dec 9

Publication series

Name	GLOBECOM - IEEE Global Telecommunications Conference

Other

Other	54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Country/Territory	United States
City	Houston, TX
Period	11/12/5 → 11/12/9

Keywords

MIMO-OFDM
symbol-wise beamforming

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/GLOCOM.2011.6133725

Cite this

Lee, HH, Park, KH, Yang, HC & Ko, YC 2011, Low complexity symbol-wise beamforming for MIMO-OFDM systems. in 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011., 6133725, GLOBECOM - IEEE Global Telecommunications Conference, 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011, Houston, TX, United States, 11/12/5. https://doi.org/10.1109/GLOCOM.2011.6133725

@inproceedings{c478223fd4114538ad609ddc0f116a42,

title = "Low complexity symbol-wise beamforming for MIMO-OFDM systems",

abstract = "In this paper, we consider a low complexity symbol-wise beamforming for MIMO-OFDM systems. We propose a non-iterative algorithm for the symbol-wise beamforming, which can provide the performance approaching that of the conventional symbol-wise beamforming based on the iterative algorithm. We demonstrate that our proposed scheme can reduce the computational complexity significantly. From our simulation results, it is evident that our proposed scheme leads to a negligible performance loss compared to the conventional symbol-wise beamforming regardless of spatial correlation or presence of co-channel interference.",

keywords = "MIMO-OFDM, symbol-wise beamforming",

author = "Lee, {Hyun Ho} and Park, {Ki Hong} and Yang, {Hong Chuan} and Ko, {Young Chai}",

year = "2011",

doi = "10.1109/GLOCOM.2011.6133725",

language = "English",

isbn = "9781424492688",

series = "GLOBECOM - IEEE Global Telecommunications Conference",

booktitle = "2011 IEEE Global Telecommunications Conference, GLOBECOM 2011",

note = "54th Annual IEEE Global Telecommunications Conference: {"}Energizing Global Communications{"}, GLOBECOM 2011 ; Conference date: 05-12-2011 Through 09-12-2011",

}

TY - GEN

T1 - Low complexity symbol-wise beamforming for MIMO-OFDM systems

AU - Lee, Hyun Ho

AU - Park, Ki Hong

AU - Yang, Hong Chuan

AU - Ko, Young Chai

PY - 2011

Y1 - 2011

N2 - In this paper, we consider a low complexity symbol-wise beamforming for MIMO-OFDM systems. We propose a non-iterative algorithm for the symbol-wise beamforming, which can provide the performance approaching that of the conventional symbol-wise beamforming based on the iterative algorithm. We demonstrate that our proposed scheme can reduce the computational complexity significantly. From our simulation results, it is evident that our proposed scheme leads to a negligible performance loss compared to the conventional symbol-wise beamforming regardless of spatial correlation or presence of co-channel interference.

AB - In this paper, we consider a low complexity symbol-wise beamforming for MIMO-OFDM systems. We propose a non-iterative algorithm for the symbol-wise beamforming, which can provide the performance approaching that of the conventional symbol-wise beamforming based on the iterative algorithm. We demonstrate that our proposed scheme can reduce the computational complexity significantly. From our simulation results, it is evident that our proposed scheme leads to a negligible performance loss compared to the conventional symbol-wise beamforming regardless of spatial correlation or presence of co-channel interference.

KW - MIMO-OFDM

KW - symbol-wise beamforming

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

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

U2 - 10.1109/GLOCOM.2011.6133725

DO - 10.1109/GLOCOM.2011.6133725

M3 - Conference contribution

AN - SCOPUS:84863141138

SN - 9781424492688

T3 - GLOBECOM - IEEE Global Telecommunications Conference

BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011

T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011

Y2 - 5 December 2011 through 9 December 2011

ER -

Low complexity symbol-wise beamforming for MIMO-OFDM systems

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this