Low Complexity Symbol-Wise Beamforming for MIMO-OFDM Systems

被引：0

作者：

Lee, Hyun-Ho ^{[1
]}

Park, Ki-Hong ^{[2
]}

Yang, Hong-Chuan ^{[3
]}

Ko, Young-Chai ^{[1
]}

机构：

[1] Korea Univ, Sch Elect Engn, Seoul, South Korea

[2] KAUST, Div Phys Sci & Engn, Makkah Pr, Saudi Arabia

[3] Univ Victoria, Dept Elect & Comp Engn, Victoria, BC, Canada

来源：

2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011) | 2011年

基金：

新加坡国家研究基金会;

关键词：

MIMO-OFDM; symbol-wise beamforming; CAPACITY; CHANNELS;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页数：5

共 14 条

[1]

Boelcskei H, 2006, IEEE WIREL COMMUN, V13, P31

[2]

Bölcskei H, 2002, IEEE T COMMUN, V50, P225, DOI 10.1109/26.983319

[3] Outdoor MIMO wireless channels:: Models and performance prediction [J].