2020
DOI: 10.48550/arxiv.2009.11172
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Matrix Decomposition for Massive MIMO Detection

Abstract: Massive multiple-input multiple-output (MIMO) is a key technology for fifth generation (5G) communication system. MIMO symbol detection is one of the most computationally intensive tasks for a massive MIMO baseband receiver. In this paper, we analyze matrix decomposition algorithms for massive MIMO systems, which were traditionally used for smallscale MIMO detection due to their numerical stability and modular design. We present the computational complexity of linear detection mechanisms based on QR, Cholesky … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
0
0
Order By: Relevance
“…A substantial literature in detection schemes for massive MIMO UL has appeared and comprehensive surveys are presented in [18,20]. In [21], the computational complexity of linear detection mechanisms based on the QR, Cholesky, and LDL decomposition algorithms for different massive MIMO configurations is presented. Other detectors, such as the sphere decoding (SD), require the QR-decomposition which increases the computational complexity.…”
Section: Introductionmentioning
confidence: 99%
“…A substantial literature in detection schemes for massive MIMO UL has appeared and comprehensive surveys are presented in [18,20]. In [21], the computational complexity of linear detection mechanisms based on the QR, Cholesky, and LDL decomposition algorithms for different massive MIMO configurations is presented. Other detectors, such as the sphere decoding (SD), require the QR-decomposition which increases the computational complexity.…”
Section: Introductionmentioning
confidence: 99%