An efficient precoding algorithm for mmWave massive MIMO systems

• Main Authors: Khan, Imran, Henna, Shagufta, Anjum, Nasreen, Sali, Aduwati, Rodrigues, Jonathan, Khan, Yousaf, Khattak, Muhammad Irfan, Altaf, Farhan
• Format: Article
• Language: English
• Published: MDPI 2019
• Online Access: http://psasir.upm.edu.my/id/eprint/38270/1/38270.pdf; http://psasir.upm.edu.my/id/eprint/38270/; https://www.mdpi.com/2073-8994/11/9/1099
• Institution: Universiti Putra Malaysia

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.