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

Linear Precoding for MIMO Broadcast Channels With Finite-Alphabet Constraints

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

5 Author(s)
Yongpeng Wu ; National Mobile Communications Research Laboratory, Southeast University, Nanjing, 210096, China ; Wang, Mingxi ; Chengshan Xiao ; Zhi Ding
more authors

We investigate the design of linear transmit precoder for multiple-input multiple-output (MIMO) broadcast channels (BC) with finite alphabet input signals. We first derive an explicit expression for the achievable rate region of the MIMO BC with discrete constellation inputs, which is generally applicable to cases involving arbitrary user number and arbitrary antenna number. We further present a weighted sum rate upper bound of the MIMO BC with identical transmit precoding matrices. The resulting bound exhibits a serious performance loss because of the non-uniquely decodable transmit signals for MIMO BC with finite alphabet inputs in high signal-to-noise ratio (SNR) region. This performance loss motivates the use of a simple precoding to combat the non-unique decodability. Based on a constrained optimization problem formulation, we apply the Karush-Kuhn-Tucker analysis to derive necessary conditions for MIMO BC precoders to maximize the weighted sum-rate. We then propose an iterative gradient descent algorithm with backtracking line search to optimize the linear precoders for each user. Our { simulation} results under the practical transmit symbols of discrete constellations demonstrate significant gains by the proposed algorithm over other precoding schemes including the traditional iterative water-filling (WF) design for the Gaussian input signals. For the low-density parity-check coded systems, our precoder provides considerably coded BER improvement through iterative decoding and detection.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:11 ,  Issue: 8 )

Date of Publication:

August 2012

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.