Optimized solutions for beamforming problems in amplify-forward wireless relay networks

A. H. Phan, H. D. Tuan, H. H. Kha

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

Beamforming problems in amlify-forward (AF) wireless relay network can be formulated as nonconvex quadratically constrained quadratic programming (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.

Original languageEnglish
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: 5 Dec 20119 Dec 2011

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Conference

Conference54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Country/TerritoryUnited States
CityHouston, TX
Period5/12/119/12/11

Fingerprint

Dive into the research topics of 'Optimized solutions for beamforming problems in amplify-forward wireless relay networks'. Together they form a unique fingerprint.

Cite this