Randomized Iterative Sampling Decoding Algorithm For Large-Scale MIMO Detection

In this paper, the paradigm of the traditional iterative decoding schemes for the uplink large-scale MIMO detection is extended by sampling in an Markov chain Monte Carlo (MCMC) way. Different from iterative decoding whose performance is upper bounded by the suboptimal linear decoding scheme like ZF...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on signal processing Ročník 72; s. 1 - 14
Hlavní autoři: Wang, Zheng, Xia, Yili, Ling, Cong, Huang, Yongming
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Convergence
Iterative decoding
iterative methods
Jacobian matrices
Large-scale MIMO detection
Markov analysis
Markov chains
Markov processes
massive MIMO detection
Maximum likelihood decoding
MCMC
MIMO communication
Performance enhancement
Random sampling
sampling decoding
Signal processing algorithms
ISSN:1053-587X, 1941-0476
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, the paradigm of the traditional iterative decoding schemes for the uplink large-scale MIMO detection is extended by sampling in an Markov chain Monte Carlo (MCMC) way. Different from iterative decoding whose performance is upper bounded by the suboptimal linear decoding scheme like ZF or MMSE, the proposed iterative random sampling decoding (IRSD) algorithm is capable of achieving the optimal ML decoding performance with the increment of Markov moves, thus establishing a flexible trade-off between suboptimal and optimal decoding performance. According to convergence analysis, we show that the Markov chain induced by IRSD algorithm experiences the exponential convergence, and its related convergence rate is also derived in detail. Based on it, the Markov mixing becomes tractable, followed by the decoding optimization with respect to the standard deviation of the target distribution. Meanwhile, further decoding performance enhancement and parallel implementation are also studied so that the proposed IRSD algorithm is well suited for various cases of large-scale MIMO systems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2023.3336199