2016
DOI: 10.1109/lwc.2015.2504366
|View full text |Cite
|
Sign up to set email alerts
|

Low Complexity Iterative MMSE-PIC Detection for Medium-Size Massive MIMO

Abstract: In medium-size Massive MIMO systems, the minimum mean square error parallel interference cancellation (MMSE-PIC) based Soft-Input Soft-Output (SISO) detector is often used due to its relatively low complexity and good bit error rate (BER) performance. The computational complexity of MMSE-PIC for detecting a block of data is dominated by the computation of a Gram matrix and a matrix inversion. They have computational complexity of O(K 2 M) and O(K 3), respectively, where K is the number of uplink users with one… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
45
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 64 publications
(51 citation statements)
references
References 8 publications
(20 reference statements)
1
45
0
Order By: Relevance
“…Therefore, we use the complexity with matched filter algorithm as the lower bound for comparison, which has the complexity of O(N r N t ) for every subcarrier. Table II is the summary of complexity comparison between the exact MMSE, the matched filter, the algorithms in [14], [15] and the proposed algorithm. In the table, the term N 2 t N r corresponds to the computing of Gram matrix G n and I is the number of terms in the Neumann Series expansion in [14].…”
Section: Computational Complexity Comparisonmentioning
confidence: 99%
See 4 more Smart Citations
“…Therefore, we use the complexity with matched filter algorithm as the lower bound for comparison, which has the complexity of O(N r N t ) for every subcarrier. Table II is the summary of complexity comparison between the exact MMSE, the matched filter, the algorithms in [14], [15] and the proposed algorithm. In the table, the term N 2 t N r corresponds to the computing of Gram matrix G n and I is the number of terms in the Neumann Series expansion in [14].…”
Section: Computational Complexity Comparisonmentioning
confidence: 99%
“…Table II is the summary of complexity comparison between the exact MMSE, the matched filter, the algorithms in [14], [15] and the proposed algorithm. In the table, the term N 2 t N r corresponds to the computing of Gram matrix G n and I is the number of terms in the Neumann Series expansion in [14]. The proposed algorithm has great computation saving compared to the exact implementation, while it has comparable complexity to the matched filter.…”
Section: Computational Complexity Comparisonmentioning
confidence: 99%
See 3 more Smart Citations