Title :
A convex inner approximation technique for rank-two beamforming in multicasting relay networks
Author :
Schad, Adrian ; Law, Ka L. ; Pesavento, Marius
Author_Institution :
Commun. Syst. Group, Tech. Univ. Darmstadt, Darmstadt, Germany
Abstract :
In this paper, we propose a novel scheme for single-group multicasting using a relay network. We assume a source that transmits messages via an amplify-and-forward relay network to multiple destinations. The goal is to minimize the maximum transmitted power of the relays under constraints on the signal-to-noise ratios at the destinations. To increase the degrees of freedoms in the system, the relays process two source signals jointly, using two different relay beamforming weight vectors. The Alamouti space-time block code is transmitted over two beams. Simulation results demonstrate the performance of the proposed scheme combined with a proposed sequential convex programming algorithm compared to methods of the literature and to the theoretical lower bound.
Keywords :
amplify and forward communication; approximation theory; array signal processing; convex programming; multicast communication; space-time block codes; Alamouti space-time block code; amplify-and-forward relay network; convex inner approximation technique; degree of freedoms; multicasting relay networks; rank-two beamforming; relay beamforming weight vectors; sequential convex programming algorithm; signal-to-noise ratios; single-group multicasting; Approximation methods; Array signal processing; Iterative methods; Multicast communication; Relays; Signal to noise ratio; Vectors; Amplify-and-forward; convex optimization; distributed beamforming; multicasting; relay networks; space-time block coding;
Conference_Titel :
Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European
Conference_Location :
Bucharest
Print_ISBN :
978-1-4673-1068-0