Abstract

We study the design optimization of linear precoders that maximize the mutual information in complex-valued vector Gaussian channels under finite alphabet inputs. It is well known that mutual information of a vector channel with discrete constellation source is a highly nonlinear and nonconcave function of the linear precoder matrix G, thereby complicating the precoder design optimization. in this paper, we show that the mutual information is a concave function of W = GhHhHG, where H is the complex-valued channel matrix and superscript "h" represents conjugate transpose. We further propose an iterative algorithm for solving the globally optimal linear precoder G. Illustrative results show that the proposed iterative algorithm is very robust and efficient for global convergence. © 2011 IEEE.

Department(s)

Electrical and Computer Engineering

Keywords and Phrases

global optimization; Linear precoder; mutual information; vector Gaussian noise channel

International Standard Book Number (ISBN)

978-145770539-7

International Standard Serial Number (ISSN)

1520-6149

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.

Publication Date

18 Aug 2011

Share

 
COinS