Abstract

This paper considers the precoder design for dual-hop amplify-and-forward relay networks and formulates the design from the standpoint of finite-alphabet inputs. in particular, the mutual information is employed as the utility function, which, however, results in a nonlinear and nonconcave problem. This paper exploits the structure of the optimal precoder that maximizes the mutual information and develops a two-step algorithm based on convex optimization and optimization on the Stiefel manifold. by doing so, the proposed algorithm is insensitive to initial point selection and able to achieve a near global optimal precoder solution. Besides, it converges fast and offers high mutual information gain. These advantages are verified by numerical examples, which also show the large performance gain in mutual information also represents the large gain in the coded bit-error rate. © 2012 IEEE.

Department(s)

Electrical and Computer Engineering

Comments

National Science Foundation, Grant CCF-0915846

Keywords and Phrases

amplify-and-forward; finite-alphabet input; precoder design; Relay networks

International Standard Serial Number (ISSN)

1536-1276

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

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

Publication Date

01 Mar 2012

Download

Full Text Link

Share

 
COinS