By Topic

Optimal Successive Group Decoders for MIMO Multiple-Access Channels

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)
Narayan Prasad ; NEC Labs. America, Princeton, NJ ; Guosen Yue ; Xiaodong Wang ; Mahesh Varanasi

We consider a slow-fading narrowband multiple-input multiple-output (MIMO) multiple-access channel (MAC) in which multiple users, each equipped with multiple transmit antennas, communicate to a receiver equipped with multiple receive antennas. The users are unaware of the channel state information (CSI) whereas the receiver has perfect CSI and employs a successive group decoder (SGD). We obtain achievable outage probabilities for the case where an outage must be declared simultaneously for all users (common outage) as well as the case where outages can be declared individually for each user (individual outage). We then derive the optimum successive group decoder (OSGD) that simultaneously minimizes the common outage probability and the individual outage probability of each user, over all SGDs of permissible decoding complexity. For each channel realization, the OSGD is also shown to maximize the error exponent of the decodable set of users. An adaptive SGD is derived which not only retains the outage optimality of the OSGD but also minimizes the expected decoding complexity. Asymptotically tight (in the limit of high signal-to-noise ratio (SNR)) affine approximations are then obtained for the weighted sum common and individual outage capacities and the symmetric outage capacity yielded by the OSGD. Limiting expressions for the relevant capacities as the number of users and the number of receive antennas approach infinity are also obtained and it is shown that the OSGD yields symmetric capacity gains commensurate with the decoding complexity allowed. Simulation results with practical low-density parity-check (LDPC) outer codes show that the OSGD offers significantly improved performance at low decoding complexity.

Published in:

IEEE Transactions on Information Theory  (Volume:54 ,  Issue: 11 )