Beamforming problems in amlify-forward (AF) wireless relay network can be formulated as nonconvexquadraticallyconstrainedquadraticprogramming (QCQP) problems which is very difficult to solve directly. Generally, b...
详细信息
ISBN:
(纸本)9781424492688
Beamforming problems in amlify-forward (AF) wireless relay network can be formulated as nonconvexquadraticallyconstrainedquadraticprogramming (QCQP) problems which is very difficult to solve directly. Generally, by transforming a QCQP problem into a semi-definite program (SDP) and by relaxing rank-one constraints, the problem can be tackled essentially. If resulting matrices found after solving SDP problems are of rank-one then the task can be terminated. However, in some scenarios such as minimizing individual power constraints on relays, most of the rank-one dropped SDP solutions have rank higher than one. In this case, a nonsmooth reverse convex optimization technique is employed to solve the problem iteratively then rank-one solutions can be optimized numerically.
暂无评论