UM
Robust linear transceiver design for multi-hop non-regenerative MIMO relaying systems
Xing C.2; Fei Z.2; Ma S.1; Kuang J.2; Wu Y.-C.1
2011-12-01
Source Publication2011 International Conference on Wireless Communications and Signal Processing, WCSP 2011
AbstractIn this paper, optimal linear transceiver designs for multi-hop amplify-and-forward (AF) Multiple-input Multiple-out (MIMO) relaying systems with Gaussian distributed channel estimation errors are investigated. Some commonly used transceiver design criteria are unified into a single matrix-variate optimization problem. With novel applications of majorization theory and properties of matrix-variate function, the optimal structure of robust transceiver is first derived. Based on the optimal structure, the original transceiver design problems are reduced to much simpler problems with only scalar variables whose solutions are readily obtained by iterative water-filling algorithms. The performance advantages of the proposed robust designs are demonstrated by the simulation results. © 2011 IEEE.
KeywordAmplify-and-forward (AF) majorization theory MIMO relay robust transceiver design
DOI10.1109/WCSP.2011.6096793
URLView the original
Language英語
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionUniversity of Macau
Affiliation1.The University of Hong Kong
2.Beijing Institute of Technology
Recommended Citation
GB/T 7714
Xing C.,Fei Z.,Ma S.,et al. Robust linear transceiver design for multi-hop non-regenerative MIMO relaying systems[C],2011.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xing C.]'s Articles
[Fei Z.]'s Articles
[Ma S.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xing C.]'s Articles
[Fei Z.]'s Articles
[Ma S.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xing C.]'s Articles
[Fei Z.]'s Articles
[Ma S.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.