Cart (Loading....) | Create Account
Close category search window
 

Coordinated Spatial Multiplexing with Orthogonalized Channels for Multiuser MIMO Downlink Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jin-Sung Kim ; Sch. of Electr. Eng., Korea Univ., Seoul, South Korea ; Sung-Hyun Moon ; Inkyu Lee

In this paper, we propose a new coordinated spatial multiplexing algorithm for multiuser multiple-input multiple-output (MIMO) downlink systems. Unlike other conventional coordination methods, our scheme exploits orthogonalized effective channels to yield the transmit precoding and receive combining matrices without requiring an iterative operation. In order to determine each row of the effective channels, a greedy type successive process is utilized. Simulation results show that the performance of our proposed scheme is very close to the conventional iterative scheme with significantly reduced complexity. Also, our method achieves a 3 dB performance gain over the conventional non-iterative scheme.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:11 ,  Issue: 6 )

Date of Publication:

June 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.