By Topic

Robust Peer-to-Peer Relay Beamforming: A Probabilistic Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ponukumati, D. ; Qualcomm India Private Ltd., Hyderabad, India ; Feifei Gao ; Chengwen Xing

In this work, we design outage constrained collaborative relay beamforming (CRBF) vectors for a peer-to-peer amplify-and-forward (AF) relay network with imperfect channel state information (CSI) at the relays. Specifically, we model channel estimation error as a Gaussian random vector with known statistical distribution. The objective is to minimize the total transmit power at relays subject to probabilistic quality of service (QoS) constraints at each receiver. To solve the original non-convex problem, we utilize Bernstein-type inequalities and recast the original probabilistic constraints into conservative deterministic linear matrix inequalities (LMI). An alternative method is to replace the probabilistic constraint with a conservative one by applying S-procedure. Employing rank relaxation technique, the two convex reformulations are numerically solved with semidefinite programming (SDP). Simulation results are provided to corroborate our studies.

Published in:

Communications Letters, IEEE  (Volume:17 ,  Issue: 2 )