The optimal beamforming for cognitive multicast transmission is a nonconvex rank-one constrained optimization problem. For a solution, a popular method is the combination of relaxed convex semi-definite programming, where the rank-one constraint is dropped, and randomization. We show that in many cases, this method cannot give satisfactory solutions. As an initial step, we propose a simple and efficient alternative method, which offers much better solutions. Several numerical simulation examples are provided to illustrate the effectiveness of our method.
|Title of host publication||2010 IEEE 72nd Vehicular Technology Conference Fall, VTC2010-Fall - Proceedings|
|Publication status||Published - 2010|
|Event||2010 IEEE 72nd Vehicular Technology Conference Fall, VTC2010-Fall - Ottawa, ON, Canada|
Duration: 6 Sep 2010 → 9 Sep 2010
|Name||IEEE Vehicular Technology Conference|
|Conference||2010 IEEE 72nd Vehicular Technology Conference Fall, VTC2010-Fall|
|Period||6/09/10 → 9/09/10|