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 |
| _version_ | 1848754090638573568 |
|---|---|
| author | Li, Bin Dam, Hai Huyen Heidi Teo, Kok Lay Cantoni, A. |
| author_facet | Li, Bin Dam, Hai Huyen Heidi Teo, Kok Lay Cantoni, A. |
| author_sort | Li, Bin |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T08:34:53Z |
| format | Conference Paper |
| id | curtin-20.500.11937-33960 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:34:53Z |
| publishDate | 2015 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-339602017-09-13T15:07:51Z A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints Li, Bin Dam, Hai Huyen Heidi Teo, Kok Lay Cantoni, A. 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. 2015 Conference Paper http://hdl.handle.net/20.500.11937/33960 10.1109/ICASSP.2015.7178537 IEEE restricted |
| spellingShingle | Li, Bin Dam, Hai Huyen Heidi Teo, Kok Lay Cantoni, A. A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints |
| title | A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints |
| title_full | A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints |
| title_fullStr | A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints |
| title_full_unstemmed | A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints |
| title_short | A low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints |
| title_sort | low complexity optimization algorithm for zero-forcing precoding under per-antenna power constraints |
| url | http://hdl.handle.net/20.500.11937/33960 |