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

On the Diversity-Multiplexing Tradeoff Under Groupwise Successive Interference Cancelation

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

2 Author(s)
In Sook Park ; Dept. of Electr. Eng., KAIST, Daejeon, South Korea ; Sae-Young Chung

In this paper, we study the diversity-multiplexing tradeoff assuming groupwise successive interference cancelation (GSIC). GSIC with layered codes in multiple-input multiple-output (MIMO) can vary from the plain SIC to the maximum likelihood (ML) decoding according to the group sizes, thus is flexible in both complexity and performance. The maximum group size is a dominating factor for the computation complexity of GSIC when the processing complexity is polynomially dependent on the group size with a high order. In this paper, we show the tradeoff among the maximum group size, diversity gain, and multiplexing gain (GDMT) under the GSIC and under the GSIC combined with antenna selection (GSICAS). For a given group-size bound c, we show that the number of groups achieving the optimal DMT under the GSIC with α selected transmit antennas is equal to ⌈α/c⌉ and a larger group should have a higher priority in decoding order. The optimal grouping is obtained in a systematic way. Based on these results, we find a limited set of groupings that contains the grouping achieving the optimal GDMT under GSIC and under GSICAS. The optimal multiplexing gain allocation for the optimal grouping is then found systematically and efficiently within the limited set.

Published in:

Communications, IEEE Transactions on  (Volume:59 ,  Issue: 10 )

Date of Publication:

October 2011

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.