SIAM Journal on Optimization
Complex Matrix Decomposition and Quadratic Programming
Mathematics of Operations Research
Multiple peer-to-peer communications using a network of relays
IEEE Transactions on Signal Processing
Downlink distributed beamforming through relay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Coded cooperation in wireless communications: space-time transmission and iterative decoding
IEEE Transactions on Signal Processing
Transceiver optimization for multiuser MIMO systems
IEEE Transactions on Signal Processing
Transmit beamforming for physical-layer multicasting
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Signal Processing
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
Distributed beamforming and power allocation for cooperative networks
IEEE Transactions on Wireless Communications - Part 2
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
Partially-coherent distributed space-time codes with differential encoder and decoder
IEEE Journal on Selected Areas in Communications
Downlink distributed beamforming through relay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 0.00 |
In this paper, we study the tradeoffs between basestation beamforming and distributed beamforming in the uplink. Here, multiple single-antenna sources access a multiple-antenna destination (basestation) through a network of single-antenna relays. In order to determine the solution, we decouple the problem into that of optimizing a linear decoder at the destination and that of optimizing relay beamforming weights. We find the optimal linear decoder at the destination and the corresponding feasible SINR feasible upperbound when the number of receive antennas at the destination is no less than the number of relays. We then apply a recently developed semidefinite relaxation technique that optimizes the relay weights. The proposed algorithm iteratively optimizes the weight matrix at the relays and the linear decoder at the destination and is able to reach a fixed point in only a few iterations. In addition, the tradeoffs between basestation and relay network complexity are investigated.