TY - JOUR
T1 - Fast matrix inversion based on Chebyshev acceleration for linear detection in massive MIMO systems
AU - Berra, Salah
AU - Dinis, Rui
AU - Shahabuddin, Shahriar
N1 - info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F50008%2F2020/PT#
info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F04111%2F2020/PT#
MASSIVE5G (SAICT‐45‐2017‐02)
PY - 2022/5
Y1 - 2022/5
N2 - To circumvent the prohibitive complexity of linear minimum mean square error detection in a massive multiple-input multiple-output system, several iterative methods have been proposed. However, they can still be too complex and/or lead to non-negligible performance degradation. In this letter, a Chebyshev acceleration technique is proposed to overcome the limitations of iterative methods, accelerating the convergence rates and enhancing the performance. The Chebyshev acceleration method employs a new vector combination, which combines the spectral radius of the iteration matrix with the receiver signal, and also the optimal parameters of Chebyshev acceleration have also been defined. A detector based on iterative algorithms requires pre-processing and initialisation, which enhance the convergence, performance, and complexity. To influence the initialisation, the stair matrix has been proposed as the first start of iterative methods. The performance results show that the proposed technique outperforms state-of-the-art methods in terms of error rate performance, while significantly reducing the computational complexity.
AB - To circumvent the prohibitive complexity of linear minimum mean square error detection in a massive multiple-input multiple-output system, several iterative methods have been proposed. However, they can still be too complex and/or lead to non-negligible performance degradation. In this letter, a Chebyshev acceleration technique is proposed to overcome the limitations of iterative methods, accelerating the convergence rates and enhancing the performance. The Chebyshev acceleration method employs a new vector combination, which combines the spectral radius of the iteration matrix with the receiver signal, and also the optimal parameters of Chebyshev acceleration have also been defined. A detector based on iterative algorithms requires pre-processing and initialisation, which enhance the convergence, performance, and complexity. To influence the initialisation, the stair matrix has been proposed as the first start of iterative methods. The performance results show that the proposed technique outperforms state-of-the-art methods in terms of error rate performance, while significantly reducing the computational complexity.
UR - http://www.scopus.com/inward/record.url?scp=85129056883&partnerID=8YFLogxK
U2 - 10.1049/ell2.12486
DO - 10.1049/ell2.12486
M3 - Article
AN - SCOPUS:85129056883
SN - 0013-5194
VL - 58
SP - 451
EP - 453
JO - Electronics Letters
JF - Electronics Letters
IS - 11
ER -