A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints
Access Status
Authors
Date
2015Type
Metadata
Show full item recordCitation
Source Title
Source Conference
ISBN
School
Collection
Abstract
Zero-forcing beamforming (ZFBF) is a popular pre-coding scheme for MIMO systems. Most of the studies in the literature are under total power constraints. However, the perantenna power constraints (PAPC) are more realistic. The state-of-the-art method is interior point method which is expensive to realize in practice due to the high computational complexity. Hence, a low complexity zero-forcing precoding scheme under the per-antenna power constraints is proposed in this paper. This is achieved by introducing a regularized dual method. Simulations are carried out to show the effectiveness of the proposed method, which has a low computational complexity. In addition, the algorithm can be implemented in parallel to further reduce the computational complexity.
Related items
Showing items related by title, author, creator and subject.
-
Tuthill, John D. (1995)In antenna array processing it is generally required to enhance the reception or detection of a signal from a particular direction while suppressing noise and interference signals from other directions. An optimisation ...
-
Yu, Changjun (2012)In this thesis, We propose new computational algorithms and methods for solving four classes of constrained optimization and optimal control problems. In Chapter 1, we present a brief review on optimization and ...
-
Hinton, Rachael (2009)International perspectives of women’s health have drawn on biomedical solutions and pathology-based aspects, and one of the main components of a changing and evolving definition of women’s health is to provide an alternative ...