A Low-Complexity Design of Linear Precoding for MIMO Channels with Finite-Alphabet Inputs
Authors:
- 16 December 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 1 (1) , 38-41
Abstract
This paper investigates linear precoding scheme that maximizes mutual information for multiple-input multiple-output (MIMO) channels with finite-alphabet inputs. In contrast with recent studies, optimizing mutual information directly with extensive computational burden, this work proposes a low-complexity and high-performance design. It derives a lower bound that demands low computational effort and approximates, with a constant shift, the mutual information for various settings. Based on this bound, the precoding problem is solved efficiently. Numerical examples show the efficacy of this method for constant and fading MIMO channels. Compared to its conventional counterparts, the proposed method reduces the computational complexity without performance loss.Keywords
This publication has 9 references indexed in Scilit:
- Globally Optimal Linear Precoders for Finite Alphabet Signals Over Complex Vector Gaussian ChannelsIEEE Transactions on Signal Processing, 2011
- On Two-User Gaussian Multiple Access Channels With Finite Input ConstellationsIEEE Transactions on Information Theory, 2011
- MIMO Gaussian Channels With Arbitrary Inputs: Optimal Precoding and Power AllocationIEEE Transactions on Information Theory, 2010
- MIMO Wireless Linear PrecodingIEEE Signal Processing Magazine, 2007
- Optimum power allocation for parallel Gaussian channels with arbitrary input distributionsIEEE Transactions on Information Theory, 2006
- Mutual Information and Minimum Mean-Square Error in Gaussian ChannelsIEEE Transactions on Information Theory, 2005
- Convex Optimization2004
- Capacity limits of MIMO channelsIEEE Journal on Selected Areas in Communications, 2003
- Space-time diversity systems based on linear constellation precodingIEEE Transactions on Wireless Communications, 2003