separately by employing convex semidefinite programming through rank-one relaxation. It is shown that our proposed algorithm outperforms conventional relay selection and BF schemes....

that the optimization problem is turned into a semidefinite programming problem with bilinear constraints. These problems can be solved using numerical or any other methods. Finally, to check the effectiveness of the method, we have listed a numerical example....

We deal with the well-known Fuglede-Putnam theorem and related FP-property.

We show that if (A,B) has the FP-property, then so has ( ˜ A(1,t1), ˜B(1,t2)) where 0 <= t1<= t2 <=1

are arbitrary.