Likelihood ascent search‐aided low complexity improved performance massive MIMO detection in perfect and imperfect channel state information

Summary Massive multiple‐input multiple‐output (MIMO) systems improve spectral efficiency and link reliability. Linear minimum mean‐squared error (MMSE) detectors can achieve optimal performance in massive MIMO detection but require large dimension matrix inversion, which is computationally intensiv...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of communication systems Ročník 35; číslo 8
Hlavní autori: Chakraborty, Sourav, Sinha, Nirmalendu Bikas, Mitra, Monojit
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Chichester Wiley Subscription Services, Inc 25.05.2022
Predmet:
Algorithms
Ascent
Chebyshev approximation
Complexity
Detectors
Error detection
Gram matrix
hybrid MMSE detection
Iterative methods
LAS
massive MIMO
Searching
ISSN:1074-5351, 1099-1131
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Summary Massive multiple‐input multiple‐output (MIMO) systems improve spectral efficiency and link reliability. Linear minimum mean‐squared error (MMSE) detectors can achieve optimal performance in massive MIMO detection but require large dimension matrix inversion, which is computationally intensive. Therefore, low complexity iterative detection schemes are proposed in the literature as an alternative to the exact MMSE method. However, the performance of these schemes is greatly influenced by the choice of the initial solution. Therefore, to improve the detection performance in this paper, we proposed three hybrid detection schemes, which are Newton–Schultz–Richardson (NS‐RI), Newton–Schultz–Chebyshev (NS‐Cheby), and Newton–Schultz–Gauss–Seidel (NS‐GS). The proposed hybrid schemes show significant performance improvement and a higher convergence rate compared to their original counterpart. The performance of the proposed detectors is further improved by the likelihood ascent search (LAS) stage, which corrects the detected symbols obtained from iterative MMSE methods through a neighborhood search. However, the complexity of the LAS algorithm primarily depends on the initialization step. In this work, we introduce an efficient Gram matrix computation in the real domain. Additionally, we have applied a band approximation of the Gram matrix for the LAS initialization, which reduces the order of computational complexity of the Gram matrix from O(NT2NR) to O(ωNTNR) where ω < <2NT. This article first proposes three improved performance hybrid MMSE detection schemes. In addition, the performance is further improved by likelihood ascent search. We have introduced an efficient computation of Gram matrix in real domain which reduces the complexity significantly. A band matrix approximation of Gram matrix is used to further reduce the number of arithmetic operations.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.5113