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: | , , , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Multidisciplinary Digital Publishing Institute
2020
|
| Online Access: | https://hdl.handle.net/1721.1/125374 |
| _version_ | 1811096688703569920 |
|---|---|
| author | Khan, Imran Henna, Shagufta Anjum, Nasreen Sali, Aduwati Rodrigues, Jonathan Khan, Yousaf Khattak, Muhammad Irfan Altaf, Farhan |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Khan, Imran Henna, Shagufta Anjum, Nasreen Sali, Aduwati Rodrigues, Jonathan Khan, Yousaf Khattak, Muhammad Irfan Altaf, Farhan |
| author_sort | Khan, Imran |
| collection | MIT |
| 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. Keywords: beamforming; 5G; massive MIMO; mmWave communications; spectral efficiency |
| first_indexed | 2024-09-23T16:47:28Z |
| format | Article |
| id | mit-1721.1/125374 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T16:47:28Z |
| publishDate | 2020 |
| publisher | Multidisciplinary Digital Publishing Institute |
| record_format | dspace |
| spelling | mit-1721.1/1253742022-10-03T08:19:38Z 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 Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 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. Keywords: beamforming; 5G; massive MIMO; mmWave communications; spectral efficiency 2020-05-21T14:30:08Z 2020-05-21T14:30:08Z 2019-09-02 2019-06 2020-03-02T12:55:45Z Article http://purl.org/eprint/type/JournalArticle 2073-8994 https://hdl.handle.net/1721.1/125374 Khan, Imran, et al., "An Efficient Precoding Algorithm for mmWave Massive MIMO Systems." Symmetry 11, 9 (Sept. 2019): no. 1099 doi 10.3390/sym11091099 ©2019 Author(s) 10.3390/sym11091099 Symmetry Creative Commons Attribution https://creativecommons.org/licenses/by/4.0/ application/pdf Multidisciplinary Digital Publishing Institute Multidisciplinary Digital Publishing Institute |
| 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 | https://hdl.handle.net/1721.1/125374 |
| work_keys_str_mv | AT khanimran anefficientprecodingalgorithmformmwavemassivemimosystems AT hennashagufta anefficientprecodingalgorithmformmwavemassivemimosystems AT anjumnasreen anefficientprecodingalgorithmformmwavemassivemimosystems AT saliaduwati anefficientprecodingalgorithmformmwavemassivemimosystems AT rodriguesjonathan anefficientprecodingalgorithmformmwavemassivemimosystems AT khanyousaf anefficientprecodingalgorithmformmwavemassivemimosystems AT khattakmuhammadirfan anefficientprecodingalgorithmformmwavemassivemimosystems AT altaffarhan anefficientprecodingalgorithmformmwavemassivemimosystems AT khanimran efficientprecodingalgorithmformmwavemassivemimosystems AT hennashagufta efficientprecodingalgorithmformmwavemassivemimosystems AT anjumnasreen efficientprecodingalgorithmformmwavemassivemimosystems AT saliaduwati efficientprecodingalgorithmformmwavemassivemimosystems AT rodriguesjonathan efficientprecodingalgorithmformmwavemassivemimosystems AT khanyousaf efficientprecodingalgorithmformmwavemassivemimosystems AT khattakmuhammadirfan efficientprecodingalgorithmformmwavemassivemimosystems AT altaffarhan efficientprecodingalgorithmformmwavemassivemimosystems |