Low Complexity PMI Selection for BICM-MIMO Rate Maximization in 5G New Radio Systems

This paper presents novel methods for selecting the best precoding matrix index (PMI) from the Type- I codebook adopted in 5\mathrm{G} New Radio (5\mathrm{G} NR (\text{gNB}) , in terms of the achievable rate for MIMO-BICM systems. To overcome the complexity of dealing with a multi-variable problem w...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2023 31st European Signal Processing Conference (EUSIPCO) s. 1445 - 1449
Hlavní autori: Maleki, Marjan, Jin, Juening, Haardt, Martin
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: EURASIP 04.09.2023
Predmet:
BICM-MIMO
channel state information (CSI)
Heuristic algorithms
New Radio
Precoder Matrix Index (PMI)
Precoding
Search methods
Signal processing
Signal processing algorithms
Simulation
Type- I Codebook
ISSN:2076-1465
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper presents novel methods for selecting the best precoding matrix index (PMI) from the Type- I codebook adopted in 5\mathrm{G} New Radio (5\mathrm{G} NR (\text{gNB}) , in terms of the achievable rate for MIMO-BICM systems. To overcome the complexity of dealing with a multi-variable problem with discrete domains, we introduce heuristic algorithms that exploit the Kronecker and DFT structure of the codebook. Our proposed methods utilize a combination of direct estimation and a low-dimensional search to derive the optimal PMI indices, and the singular value (SV) pre-coder serves as an optimal reference. The approach significantly reduces the number of codebook precoder candidates, resulting in a much lower complexity compared to the exhaustive search methods. Simulation results demonstrate the effectiveness of our proposed algorithms in achieving a performance comparable to the performance obtained by an exhaustive search.
ISSN:2076-1465
DOI:10.23919/EUSIPCO58844.2023.10290121