2023
DOI: 10.1109/tcsi.2022.3229690
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Approximate Expectation Propagation Detector With Block-Diagonal Neumann-Series

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 43 publications
0
1
0
Order By: Relevance
“…7 A plethora of M-MIMO detection techniques are covered in the literature, including linear, non-linear, local search, box detection, belief propagation, machine learning, and sparsity based detectors. [8][9][10][11][12][13][14][15][16] Optimal detectors like Maximum Aposteriori (MAP) and Maximal Likelihood (ML) detectors suffer from exponential computational complexity due to large antenna configurations and modulation sizes and, hence, are not feasible. 17 The belief propagation (BP) algorithm, a tree-based algorithm, can also give performance close to that of ML with low channel correlation.…”
Section: Introductionmentioning
confidence: 99%
“…7 A plethora of M-MIMO detection techniques are covered in the literature, including linear, non-linear, local search, box detection, belief propagation, machine learning, and sparsity based detectors. [8][9][10][11][12][13][14][15][16] Optimal detectors like Maximum Aposteriori (MAP) and Maximal Likelihood (ML) detectors suffer from exponential computational complexity due to large antenna configurations and modulation sizes and, hence, are not feasible. 17 The belief propagation (BP) algorithm, a tree-based algorithm, can also give performance close to that of ML with low channel correlation.…”
Section: Introductionmentioning
confidence: 99%