A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system
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 iter...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2015
|
| Online Access: | http://hdl.handle.net/20.500.11937/9893 |
| _version_ | 1848746081194606592 |
|---|---|
| author | Dam, Hai Huyen Heidi Cantoni, A. Li, Bin |
| author_facet | Dam, Hai Huyen Heidi Cantoni, A. Li, Bin |
| author_sort | Dam, Hai Huyen Heidi |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T06:27:35Z |
| format | Journal Article |
| id | curtin-20.500.11937-9893 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T06:27:35Z |
| publishDate | 2015 |
| publisher | Institute of Electrical and Electronics Engineers Inc. |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-98932017-09-13T14:49:28Z A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system Dam, Hai Huyen Heidi Cantoni, A. Li, Bin 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. 2015 Journal Article http://hdl.handle.net/20.500.11937/9893 10.1109/LSP.2015.2407903 Institute of Electrical and Electronics Engineers Inc. restricted |
| spellingShingle | Dam, Hai Huyen Heidi Cantoni, A. Li, Bin A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system |
| title | A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system |
| title_full | A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system |
| title_fullStr | A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system |
| title_full_unstemmed | A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system |
| title_short | A fast low complexity method for optimal zero-forcing beamformer MU-MIMO system |
| title_sort | fast low complexity method for optimal zero-forcing beamformer mu-mimo system |
| url | http://hdl.handle.net/20.500.11937/9893 |