Low-complexity distributed beamforming for relay networks with real-valued implementation

Zhang, L. , Liu, W. and Li, J. (2013) Low-complexity distributed beamforming for relay networks with real-valued implementation. IEEE Transactions on Signal Processing, 61(20), pp. 5039-5048. (doi: 10.1109/TSP.2013.2274957)

Full text not currently available from Enlighten.


The distributed beamforming problem for amplify-and-forward relay networks is studied. Maximizing output SNR (signal-to-noise ratio) for distributed beamforming can be considered as a generalized eigenvector problem (GEP) and the principal eigenvector and its eigenvalue can be derived with a standard closed-form solution. In this paper, four classes of beamforming algorithms are derived based on different design criteria and constraints, including maximizing output SNR subject to a constraint on the total transmitted signal power, minimizing the total transmitted signal power subject to certain level of output SNR, minimizing the relay node number subject to constraints on the total signal power and output SNR, and a robust algorithm to deal with channel estimation errors. All of the algorithms have a low computational complexity due to the proposed real-valued implementation.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Zhang, Professor Lei
Authors: Zhang, L., Liu, W., and Li, J.
College/School:College of Science and Engineering > School of Engineering
Journal Name:IEEE Transactions on Signal Processing
ISSN (Online):1941-0476
Published Online:26 July 2013

University Staff: Request a correction | Enlighten Editors: Update this record