By Topic

Optimal precoding for orthogonalized spatial multiplexing in closed-loop MIMO 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
$33 $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

4 Author(s)

In this paper, we propose a new precoding algorithm for orthogonalized spatial multiplexing (OSM) systems over flat-fading multiple-input multiple-output (MIMO) channels. The OSM scheme was recently introduced for closed-loop MIMO systems which allows single symbol decodable maximum likelihood detection. To further improve the performance of the OSM system, we propose a new precoding method by maximizing the minimum Euclidean distance between constellation points in the effective channel. In order to efficiently identify the parameters of a precoder which maximizes the minimum distance, we introduce a partitioning approach. Through analysis, it is shown that one real value parameter and two bits are required for feedback information for precoding in 16-QAM systems. Simulation results demonstrate that our algorithm provides 9 dB and 7.5 dB gains at a bit error rate (BER) of 10-4 over the conventional OSM systems for 4-QAM and 16-QAM, respectively. We also confirm that the performance of the proposed scheme is the same as that of the optimum closed-loop MIMO systems in terms of the minimum distance. Consequently, our precoding algorithm significantly improves the system performance with a small increase of feedback amount.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:26 ,  Issue: 8 )