A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system
MetadataShow full item record
This letter proposes a new algorithm for solving the optimal zero-forcing beamforming problem that maximizes the user achievable rate with restriction on the per-antenna element power constraints. An accelerated gradient method with step size search is proposed for solving the problem. For each iteration of the gradient approach, a quick one dimensional search is employed to obtain the step size. The advantage of the step-size search is that it is relatively fast and requires only a few calculations of the objective function. Design examples show that the proposed algorithm converges faster than the gradient approach and the accelerated gradient approach with a constant step size while achieving a low computational complexity.
Showing items related by title, author, creator and subject.
Dam, Hai Huyen; Rimantho, D.; Nordholm, Sven (2013)This paper proposes a new computational procedure for solving the second-order gradient-based blind signal separation (BSS) problem with convolutive mixtures. The problem is formulated as a constrained optimization problem ...
Dam, Hai Huyen Heidi; Nordholm, Sven (2017)This paper proposes an algorithm for the second-order blind signal separation problem with convolutive mixtures. An iterative first order gradient method based on the accelerated gradient is developed for solving the ...
Dam, Hai Huyen; Nordholm, Sven (2007)In this paper, we present a scheme which improve the convergence for the multistage second-order gradient based blind signal separation (BSS) algorithm. For the multistage second-order BSS, the constraints for each stage ...