Permutation optimization in QRD based multi-relay systems

Authors:
Hang Long;Kan Zheng;Meiying Wei;Fangxiang Wang;Wenbo Wang
Affiliations:
Wireless Signal Processing and Network Lab, Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, China;Wireless Signal Processing and Network Lab, Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, China;Wireless Signal Processing and Network Lab, Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, China;Wireless Signal Processing and Network Lab, Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, China;Wireless Signal Processing and Network Lab, Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, China
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 3
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Optimizations of a MIMO Relay Network

IEEE Transactions on Signal Processing - Part II
Joint optimization of relay-precoders and decoders with partial channel side information in cooperative networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

QR decomposition (QRD) based relay protocols can achieve both the distributed array gain and the intra-node array gain in multi-relay systems. Because the QRD is not unique if column permutation is utilized, the traditional QRD based relay protocol can be further improved. Row permutation of the forward channel and column permutation of the backward channel are proposed in this paper. Exhaustive and iterative search algorithms are presented to solve the permutation optimization problem. The iterative search algorithm with modified QRD is a good trade-off between capacity performance and complexity.