Abstract | ||
---|---|---|
Optimization problems of beamforming in multi-user amplify-and-forward (AF) wireless relay networks are indefinite (nonconvex) quadratic programs, which require effective computational solutions. Solutions to these problems have often been obtained by relaxing the original problems to semi-definite programs (SDPs) of convex optimization. Most existing works have claimed that these relaxed SDPs act... |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/TWC.2012.021512.111040 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
Relays,Optimization,Array signal processing,Vectors,Wireless communication,Signal to noise ratio,Interference | Beamforming,Mathematical optimization,Wireless,Quadratic equation,Convex optimization,Optimization problem,Relay,Mathematics,Multi-user,Computational complexity theory | Journal |
Volume | Issue | ISSN |
11 | 4 | 1536-1276 |
Citations | PageRank | References |
22 | 0.73 | 18 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Anh Huy Phan | 1 | 828 | 51.60 |
Hoang D. Tuan | 2 | 1936 | 191.03 |
H H Kha | 3 | 338 | 26.82 |
Ha H. Nguyen | 4 | 976 | 96.55 |