Abstract
To reduce cooperation overhead in Amplify-and-Forward (AF) relay networks, a group-sparse penalty is introduced into the objective function to design beamformers for balancing the size of active relays and the signal-to-noise ratio (SNR) at the destination. To deal with the non-convexity and non-smoothness of the problem, the proximal gradient algorithm (PGA) is proposed, which can converge to a local optimal solution in theory. The simulation results show that the proposed algorithm can yield the high level of SNR performance with a small set of cooperative relays to reduce cooperation overhead and economize power.
| Original language | English |
|---|---|
| Article number | 6800052 |
| Pages (from-to) | 1023-1026 |
| Number of pages | 4 |
| Journal | IEEE Communications Letters |
| Volume | 18 |
| Issue number | 6 |
| DOIs | |
| State | Published - Jun 2014 |
| Externally published | Yes |
Keywords
- Amplify-and-forward (AF)
- beamforming
- group sparse
- proximal gradient algorithm (PGA)