View Item 

Multiuser Multihop MIMO Relay System Design Based on Mutual Information Maximization

Access Status
Open access
Authors
He, Z.
Guo, S.
Ou, Y.
Rong, Yue
Date
2014
Type
Journal Article

Metadata
Show full item record
Citation
He, Z. and Guo, S. and Ou, Y. and Rong, Y. 2014. Multiuser Multihop MIMO Relay System Design Based on Mutual Information Maximization. IEEE Transactions on Signal Processing. 62 (21): pp. 5725-5733.
Source Title
IEEE Transactions on Signal Processing
DOI
ISSN
School
Department of Electrical and Computer Engineering
Funding and Sponsorship
Remarks

Copyright © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

URI
Collection
Abstract

In this paper, we consider multiuser multihop relay communication systems, where the users, relays, and the destination node may have multiple antennas. We address the issue of source and relay precoding matrices design to maximize the system mutual information (MI). By exploiting the linkbetween the maximal MI and the weighted minimal mean-squared error (WMMSE) objective functions, we show that the intractable maximal MI-based source and relay optimization problem can be solved via the WMMSE-based source and relay design through an iterative approach which is guaranteed toconverge to at least a stationary point. For the WMMSE problem, we derive the optimal structure of the relay precoding matrices and show that the WMMSE matrix at the destination node can be decomposed into the sum of WMMSE matrices at all hops. Under a (moderately) high signal-to-noise ratio (SNR) condition, this WMMSE matrix decomposition significantly simplifies the solution to the WMMSE problem. Numerical simulations are performed to demonstrate the effectiveness of the proposed algorithm.