A lowcomplexity algorithm for collaborative-relay beamforming

We consider cooperative transmission in wireless relay networks, in which a source communicates with the destination with the help of a set of N cooperating amplify-and-forward relays. The relay weights are obtained to maximize the received signal-to-noise ratio at the destination, subject to indivi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) s. 5002 - 5005
Hlavní autoři: Jiangyuan Li, Petropulu, Athina P.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2013
Témata:
Algorithm design and analysis
Array signal processing
binary quadratic programming (BQP)
collaborative-relay beamforming
Complexity theory
Cooperative communications
Phase control
relay network
Relays
Signal to noise ratio
Wireless communication
ISSN:1520-6149
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider cooperative transmission in wireless relay networks, in which a source communicates with the destination with the help of a set of N cooperating amplify-and-forward relays. The relay weights are obtained to maximize the received signal-to-noise ratio at the destination, subject to individual power constraint. We consider two schemes that have appeared in the literature, i.e., (i) the optimal weight vector design method, which has been solved via second-order cone programming plus a bisection search, with complexity of O(N 3.5 ), and (ii) the one-bit feedback phase control scheme, which has been formulated as a binary quadratic programming and has been solved for exact solution via exhaustive search. We propose algorithms for these two problems that have substantially reduced complexity, i.e., O(N log 2 N) or O(N) for the first problem, and polynomial time O(N log 2 N) for the second problem.
ISSN:1520-6149
DOI:10.1109/ICASSP.2013.6638613