By Topic

Two-stage constellation partition algorithm for reduced-complexity multiple-input multiple-output-maximum-likelihood detection 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 $33
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

6 Author(s)
A. I. Sulyman ; Department of Electrical Engineering, King Saud University (KSU), Riyadh 11421, Saudi Arabia ; Y. Al-Zahrani ; S. Al-Dosari ; A. Al-Sanie
more authors

This study presents the analysis of a constellation partition (CP) algorithm for multiple-input multiple-output-maximum-likelihood detection (MIMO-MLD) systems. The authors consider an Nt by Nr MIMO system, where MLD algorithm is employed at the receiver side for MIMO signal detection. The authors show that for the case of orthogonal space-time block codes and MIMO beamforming (MIMO-BF) systems, the proposed CP algorithm achieves the same error-rate performance as the optimum MLD algorithm while cutting back significantly on the complexity of MIMO-MLD scheme. Thus complexity reduction is not achieved at the expense of the optimum MLD performance in these cases, unlike the existing simplified MLD schemes in the literature. For the case of MIMO-multiplexing system, however, it is observed that the complexity reduction is achieved at the expense of the optimum MLD performance, similar to the existing simplified MLD schemes. Thus the proposed algorithm is especially attractive in real-time implementation of space-time block code and MIMO-BF systems.

Published in:

IET Communications  (Volume:6 ,  Issue: 18 )