Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Two-stage constellation partition algorithm for reduced-complexity multiple-input multiple-output–maximum-likelihood detection systems

Two-stage constellation partition algorithm for reduced-complexity multiple-input multiple-output–maximum-likelihood detection systems

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
      • E. Biglieri , G. Taricco . (2004) Transmission and reception with multiple antennas: theoretical foundations.
    5. 5)
    6. 6)
    7. 7)
      • Wubben, D., Bonke, R., Kuhn, V., Kammeyer, K.-D.: `Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice-reduction', Proc. IEEE-ICC2004, June 2004, 2, p. 798–802.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
      • Hassibi, B., Vikalo, H.: `On the expected complexity of sphere decoding', Proc. Asilomar Conf. Signals, Systems and Computers, 2001, Pacific Groove, CA, 2, p. 1051–1055.
    14. 14)
    15. 15)
      • Hyundong, S., Jae, H.L.: `Exact symbol error probability of orthogonal space-time block codes', Proc. IEEE Global Telecommunication Conf. (IEEE-GLOBECOM’02), November 2002, 2, p. 1197–1201.
    16. 16)
      • Sulyman, A.I., Al-Zahrani, Y., Al-Dosari, S., Al-Sanie, A., Al-Shebeili, S.: `A two-stage constellation partition algorithm for reduced-complexity MIMO-MLD systems', Proc. IEEE Int. workshop on Wireless Local Networks (WLN 2010), October 2010, Denver, CO, USA, p. 757–760.
    17. 17)
      • Cui, T., Tellambura, C.: `An efficient generalized sphere decoder for rank-deficient MIMO systems', Proc. IEEE-VTC’2004, 2004, 5, p. 3689–3692.
    18. 18)
    19. 19)
    20. 20)
    21. 21)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2012.0173
Loading

Related content

content/journals/10.1049/iet-com.2012.0173
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address