An efficient precoding algorithm for mmWave massive MIMO systems
Symmetrical precoding and algorithms play a vital role in the field of wireless communications and cellular networks. This paper proposed a low-complexity hybrid precoding algorithm for mmWave massive multiple-input multiple-output (MIMO) systems. The traditional orthogonal matching pursuit (OMP) ha...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/38270/ http://psasir.upm.edu.my/id/eprint/38270/1/38270.pdf |
| _version_ | 1848848832872316928 |
|---|---|
| author | Khan, Imran Henna, Shagufta Anjum, Nasreen Sali, Aduwati Rodrigues, Jonathan Khan, Yousaf Khattak, Muhammad Irfan Altaf, Farhan |
| author_facet | Khan, Imran Henna, Shagufta Anjum, Nasreen Sali, Aduwati Rodrigues, Jonathan Khan, Yousaf Khattak, Muhammad Irfan Altaf, Farhan |
| author_sort | Khan, Imran |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Symmetrical precoding and algorithms play a vital role in the field of wireless communications and cellular networks. This paper proposed a low-complexity hybrid precoding algorithm for mmWave massive multiple-input multiple-output (MIMO) systems. The traditional orthogonal matching pursuit (OMP) has a large complexity, as it requires matrix inversion and known candidate matrices. Therefore, we propose a bird swarm algorithm (BSA) based matrix-inversion bypass (MIB) OMP (BSAMIBOMP) algorithm which has the feature to quickly search the BSA global optimum value. It only directly finds the array response vector multiplied by the residual inner product, so it does not require the candidate’s matrices. Moreover, it deploys the Banachiewicz–Schur generalized inverse of the partitioned matrix to decompose the high-dimensional matrix into low-dimensional in order to avoid the need for a matrix inversion operation. The simulation results show that the proposed algorithm effectively improves the bit error rate (BER), spectral efficiency (SE), complexity, and energy efficiency of the mmWave massive MIMO system as compared with the existing OMP hybrid and SDRAltMin algorithm without any matrix inversion and known candidate matrix information requirement. |
| first_indexed | 2025-11-15T09:40:46Z |
| format | Article |
| id | upm-38270 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T09:40:46Z |
| publishDate | 2019 |
| publisher | MDPI |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-382702020-05-04T16:10:25Z http://psasir.upm.edu.my/id/eprint/38270/ An efficient precoding algorithm for mmWave massive MIMO systems Khan, Imran Henna, Shagufta Anjum, Nasreen Sali, Aduwati Rodrigues, Jonathan Khan, Yousaf Khattak, Muhammad Irfan Altaf, Farhan Symmetrical precoding and algorithms play a vital role in the field of wireless communications and cellular networks. This paper proposed a low-complexity hybrid precoding algorithm for mmWave massive multiple-input multiple-output (MIMO) systems. The traditional orthogonal matching pursuit (OMP) has a large complexity, as it requires matrix inversion and known candidate matrices. Therefore, we propose a bird swarm algorithm (BSA) based matrix-inversion bypass (MIB) OMP (BSAMIBOMP) algorithm which has the feature to quickly search the BSA global optimum value. It only directly finds the array response vector multiplied by the residual inner product, so it does not require the candidate’s matrices. Moreover, it deploys the Banachiewicz–Schur generalized inverse of the partitioned matrix to decompose the high-dimensional matrix into low-dimensional in order to avoid the need for a matrix inversion operation. The simulation results show that the proposed algorithm effectively improves the bit error rate (BER), spectral efficiency (SE), complexity, and energy efficiency of the mmWave massive MIMO system as compared with the existing OMP hybrid and SDRAltMin algorithm without any matrix inversion and known candidate matrix information requirement. MDPI 2019 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/38270/1/38270.pdf Khan, Imran and Henna, Shagufta and Anjum, Nasreen and Sali, Aduwati and Rodrigues, Jonathan and Khan, Yousaf and Khattak, Muhammad Irfan and Altaf, Farhan (2019) An efficient precoding algorithm for mmWave massive MIMO systems. Symmetry, 11 (9). art. no. 1099. pp. 1-16. ISSN 2073-8994 https://www.mdpi.com/2073-8994/11/9/1099 10.3390/sym11091099 |
| spellingShingle | Khan, Imran Henna, Shagufta Anjum, Nasreen Sali, Aduwati Rodrigues, Jonathan Khan, Yousaf Khattak, Muhammad Irfan Altaf, Farhan An efficient precoding algorithm for mmWave massive MIMO systems |
| title | An efficient precoding algorithm for mmWave massive MIMO systems |
| title_full | An efficient precoding algorithm for mmWave massive MIMO systems |
| title_fullStr | An efficient precoding algorithm for mmWave massive MIMO systems |
| title_full_unstemmed | An efficient precoding algorithm for mmWave massive MIMO systems |
| title_short | An efficient precoding algorithm for mmWave massive MIMO systems |
| title_sort | efficient precoding algorithm for mmwave massive mimo systems |
| url | http://psasir.upm.edu.my/id/eprint/38270/ http://psasir.upm.edu.my/id/eprint/38270/ http://psasir.upm.edu.my/id/eprint/38270/ http://psasir.upm.edu.my/id/eprint/38270/1/38270.pdf |