Low-Complexity Scheduled Expectation Propagation based on QRD and SIC

This letter presents novel Expectation Propagation (EP) algorithms for Single User (SU) and Multiple Users (MU) Multiple-Input Multiple-Output (MIMO) detection that address the performance loss and slow convergence of classic Scalar EP (SEP) solutions with even lower computational complexity. The pr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2023-10, Vol.27 (10), p.1-1
Main Authors: Mekhiche, Adam, Cipriano, Antonio Maria, Poulliat, Charly
Format: Article
Language:English
Subjects:
Algorithms
Approximation algorithms
Complexity
Computer Science
Convergence
Engineering Sciences
Error analysis
Expectation Propagation
Matrix decomposition
Message passing
Networking and Internet Architecture
QR Decomposition
Receiving antennas
Scheduling
Signal and Image processing
Successive Interference Cancellation
Symbols
Transmitting antennas
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter presents novel Expectation Propagation (EP) algorithms for Single User (SU) and Multiple Users (MU) Multiple-Input Multiple-Output (MIMO) detection that address the performance loss and slow convergence of classic Scalar EP (SEP) solutions with even lower computational complexity. The proposed algorithms employ QR Decomposition (QRD), optimized EP message scheduling, and Successive Interference Cancellation (SIC) techniques to achieve superior performance and convergence speed comparable to those of Vector Expectation Propagation (VEP). Our results are illustrated through error rate curves and analysis of performance-complexity trade-offs in SU and MU scenarios.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2023.3303610