Pith. sign in

REVIEW

Achieving Global Optimality for Joint Source and Relay Beamforming Design in Two-Hop Relay Channels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.02081 v1 pith:FDIISQNM submitted 2020-03-01 eess.SP cs.ITmath.IT

Achieving Global Optimality for Joint Source and Relay Beamforming Design in Two-Hop Relay Channels

classification eess.SP cs.ITmath.IT
keywords sourcerelaydesignjointobtainedproposedvectorbeamforming
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper deals with joint source and relay beamforming (BF) design for an amplify-and-forward (AF) multi-antenna multirelay network. Considering that the channel state information (CSI) from relays to destination is imperfect, we aim to maximize the worst case received signal-to-noise ratio (SNR). The associated optimization problem is then solved in two steps. In the first step, by fixing the source BF vector, a semi-closed form solution of the relay BF matrices is obtained, up to a power allocation factor. In the second step, the global optimal source BF vector is obtained based on the Polyblock outer Approximation (PA) algorithm. We also propose two low-complexity methods for obtaining the source BF vector, which are different in their complexities and performances. The optimal joint source-relay BF solution obtained by the proposed algorithms serves as the benchmark for evaluating the existing schemes and the proposed low-complexity methods. Simulation results show that the proposed robust design can significantly reduce the sensitivity of the channel uncertainty to the system performance.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.