Sum-rate optimal multi-antenna downlink beamforming strategy based on clique search

Author(s):  
Taesang Yoo ◽  
A. Goldsmith
2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Eduardo Castañeda ◽  
Adão Silva ◽  
Ramiro Samano-Robles ◽  
Atílio Gameiro

We present in this work a low-complexity algorithm to solve the sum rate maximization problem in multiuser MIMO broadcast channels with downlink beamforming. Our approach decouples the user selection problem from the resource allocation problem and its main goal is to create a set of quasiorthogonal users. The proposed algorithm exploits physical metrics of the wireless channels that can be easily computed in such a way that a null space projection power can be approximated efficiently. Based on the derived metrics we present a mathematical model that describes the dynamics of the user selection process which renders the user selection problem into an integer linear program. Numerical results show that our approach is highly efficient to form groups of quasiorthogonal users when compared to previously proposed algorithms in the literature. Our user selection algorithm achieves a large portion of the optimum user selection sum rate (90%) for a moderate number of active users.


2018 ◽  
Vol 14 (8) ◽  
pp. 155014771878692
Author(s):  
Xian-zhong Xie ◽  
Chuan-wen Li ◽  
Shuang-guo Cheng ◽  
He-lin Yang ◽  
Shu Tang

In the device-to-device communication network, there is the interference problem when device-to-device users share the same spectrum with cellular users, a distributed beamforming scheme based on non-cooperative game is proposed to maximize weighted sum rate under the rated transmit power and the users’ quality of service. Since the optimization problem is non-concave, we first obtain the solution of the Karush-Kuhn-Tucher (KKT) condition for the downlink beamforming problem of each sender by dual decomposition. Second, a distributed beamforming algorithm based on the non-cooperative game is proposed, which can quickly converge to the Nash equilibrium point with a lower information exchange overhead. Finally, the simulation results show that the proposed algorithm has better performance in terms of system sum rate and fairness than the existing algorithms.


2009 ◽  
Vol E92-B (2) ◽  
pp. 683-686 ◽  
Author(s):  
Huan SUN ◽  
Sheng MENG ◽  
Yan WANG ◽  
Xiaohu YOU

Author(s):  
Maryam Alibeigi ◽  
Shahriar S. Moghaddam

Background & Objective: This paper considers a multi-pair wireless network, which communicates peer-to-peer using some multi-antenna amplify-and-forward relays. Maximizing the throughput supposing that the total relay nodes’ power consumption is constrained, is the main objective of this investigation. We prove that finding the beamforming matrix is not a convex problem. Methods: Therefore, by using a semidefinite relaxation technique we find a semidefinite programming problem. Moreover, we propose a novel algorithm for maximizing the total signal to the total leakage ratio. Numerical analyses show the effectiveness of the proposed algorithm which offers higher throughput compared to the existing total leakage minimization algorithm, with much less complexity. Results and Conclusion: Furthermore, the effect of different parameters such as, the number of relays, the number of antennas in each relay, the number of transmitter/receiver pairs and uplink and downlink channel gains are investigated.


Sign in / Sign up

Export Citation Format

Share Document