TY - GEN
T1 - Distributed beamforming algorithms for non-regenerative MIMO relay networks
AU - Chen, Xi
AU - Wang, Zuo
AU - Wang, Jing
PY - 2013
Y1 - 2013
N2 - In this paper, we investigate distributed beam-forming design for non-regenerative MIMO relay networks, in which all nodes are equipped with multiple antennas. We first give an unified formulation for SNR maximizing beamforming algorithm, which is suitable for both MIMO relay and SISO relay networks, and for both instantaneous channel state information and stochastic channel state information. Based on the general formulation, we design two distributed SNR maximizing beam-forming algorithms. First, we design a beamforming algorithm for MIMO relay based on instantaneous channel state information with individual power constraints, using positive semi-definite programming (SDP). In order to reduce network cost for channel estimation, second, we also deign a beamforming algorithm for MIMO relay networks based on stochastic channel state information. We prove that in a symmetric network for the beamforming algorithm based on stochastic channel state information with individual power constraints, there exists a closed-form solution that has almost the same performance as that of the numerical methods. This result can be easily extended to a general beamforming algorithm based on stochastic channel state information, but with total power constraint.
AB - In this paper, we investigate distributed beam-forming design for non-regenerative MIMO relay networks, in which all nodes are equipped with multiple antennas. We first give an unified formulation for SNR maximizing beamforming algorithm, which is suitable for both MIMO relay and SISO relay networks, and for both instantaneous channel state information and stochastic channel state information. Based on the general formulation, we design two distributed SNR maximizing beam-forming algorithms. First, we design a beamforming algorithm for MIMO relay based on instantaneous channel state information with individual power constraints, using positive semi-definite programming (SDP). In order to reduce network cost for channel estimation, second, we also deign a beamforming algorithm for MIMO relay networks based on stochastic channel state information. We prove that in a symmetric network for the beamforming algorithm based on stochastic channel state information with individual power constraints, there exists a closed-form solution that has almost the same performance as that of the numerical methods. This result can be easily extended to a general beamforming algorithm based on stochastic channel state information, but with total power constraint.
KW - Lagrangian relaxation
KW - MIMO relay
KW - SDP
KW - Stochastic channel state information
UR - http://www.scopus.com/inward/record.url?scp=84902124904&partnerID=8YFLogxK
U2 - 10.1049/cp.2013.2402
DO - 10.1049/cp.2013.2402
M3 - Conference contribution
AN - SCOPUS:84902124904
SN - 9781849197267
T3 - IET Conference Publications
SP - 172
EP - 176
BT - 5th IET International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2013
PB - Institution of Engineering and Technology
T2 - 5th IET International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2013
Y2 - 22 November 2013 through 25 November 2013
ER -