A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints
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 re...
| Main Authors: | , , , |
|---|---|
| Format: | Conference Paper |
| Published: |
IEEE
2015
|
| Online Access: | http://hdl.handle.net/20.500.11937/33960 |
| Summary: | 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. |
|---|