Abstract
In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity or the transmission rate with the Gaussian inputs assumption may lead to significant loss for a practical system with finite constellation set constraint. a linear precoding scheme is proposed to maximize the transmission rate, i.e., the mutual information, for relay networks. We exploit the structure of the optimal precoding matrix and develop a unified two-step iterative algorithm utilizing the theory of convex optimization and optimization on the complex Stiefel manifold. Numerical examples show that this novel iterative algorithm achieves significant gains compared to its conventional counterpart. © 2011 IEEE.
Recommended Citation
W. Zeng et al., "Linear Precoding for Relay Networks with Finite-alphabet Constraints," IEEE International Conference on Communications, article no. 5962566, Institute of Electrical and Electronics Engineers, Sep 2011.
The definitive version is available at https://doi.org/10.1109/icc.2011.5962566
Department(s)
Electrical and Computer Engineering
International Standard Book Number (ISBN)
978-161284233-2
International Standard Serial Number (ISSN)
0536-1486
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
02 Sep 2011
