2017 6th International Conference on Modern Circuits and Systems Technologies (MOCAST) 2017
DOI: 10.1109/mocast.2017.7937616
|View full text |Cite
|
Sign up to set email alerts
|

Hardware trade-offs for massive MIMO uplink detection based on Newton iteration method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
6
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
2
2

Relationship

3
5

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 0 publications
0
6
0
Order By: Relevance
“…The IR is estimated once for the N T ×N M -QAM symbols by M2 using matrix A and the computational complexity of this method is depicted in Table II. The complexity of ZF is also in Table II, where for the required matrix inversion work from [50] is considered. The IR component and the Cholesky decomposition have a combined complexity practically equivalent with ZF detector.…”
Section: B Computational Complexitymentioning
confidence: 99%
“…The IR is estimated once for the N T ×N M -QAM symbols by M2 using matrix A and the computational complexity of this method is depicted in Table II. The complexity of ZF is also in Table II, where for the required matrix inversion work from [50] is considered. The IR component and the Cholesky decomposition have a combined complexity practically equivalent with ZF detector.…”
Section: B Computational Complexitymentioning
confidence: 99%
“…The complexity of ZF is in Table II, where for the required matrix inversion work from [52] is considered. Table II also presents the arithmetic operations, performed at each node.…”
Section: B Computational Complexitymentioning
confidence: 99%
“…If N R is not a power number of 2 as in this work, then one multiplier is required. The complexity of ZF is in Table II, where for the required matrix inversion work from [56] is considered. Table II also presents the arithmetic operations, performed at each node.…”
Section: B Computational Complexitymentioning
confidence: 99%