D.C. programming for cooperative beamforming in SC-FDMA multi-user multi-relay networks

Publication Type:
Conference Proceeding
GLOBECOM - IEEE Global Telecommunications Conference, 2012, pp. 4998 - 5003
Issue Date:
Filename Description Size
Thumbnail2012004169OK.pdf1.6 MB
Adobe PDF
Full metadata record
We are concerned with a cooperative beamforming design for multi-user multi-relay wireless networks in which the single-carrier frequency division multiple access (SC-FDMA) technique is employed at the terminals. The problem of interest is to find the beamforming weights across relays to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among users subject to individual power constraints at each relay. Such a beamforming design is shown to be a hard nonconvex program and therefore it is mathematically challenging to find the optimal solution. By exploring its partial convex structures, we recast the design problem as minimization of a d.c. (difference of two convex) objective function subject to convex constraints and develop an effective iterative algorithm of low complexity to solve it. Simulation results show that our optimal cooperative beamforming scheme realizes the inherent diversity order of the relay network and it performs significantly better than the equal-power beamforming weights. © 2012 IEEE.
Please use this identifier to cite or link to this item: