2018
DOI: 10.1016/j.phycom.2017.12.005
|View full text |Cite
|
Sign up to set email alerts
|

Low-complexity MMSE detector based on refinement Jacobi method for massive MIMO uplink

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 23 publications
(14 citation statements)
references
References 15 publications
0
14
0
Order By: Relevance
“…In layman terms, the proposed iterative algorithm expression can be easily deduced from the combination of the equations (13) and (17) as follows:…”
Section: Proposed Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In layman terms, the proposed iterative algorithm expression can be easily deduced from the combination of the equations (13) and (17) as follows:…”
Section: Proposed Methodsmentioning
confidence: 99%
“…The low-complexity of Jacobi iterative method leads some authors to work on improving its performance in terms of convergence rate. The refinement of Jacobi iterative method proposed in [13] has offered a new low-complexity MMSE detector, in fact, this refinement has been given by the use of band matrix to accelerate the convergence rate and guarantee the nearoptimal BER performance. In [14], a Jacobi method-based scheme has been established by using an initial estimation provided by steepest descent technique.…”
Section: Introductionmentioning
confidence: 99%
“…147 As well as indoor/outdoor communications technologies, for example, millimeter wave and visible light communication utilizing high frequencies/large antenna arrays, mobile and static small cells. 148 In addition, Wi-Fi overlay/offloads, massive MIMO (multiusers), 149,150 and multihop/meshed networks. 5…”
Section: Cognitive-5g Networkmentioning
confidence: 99%
“…However, it is overly sensitive to the acceleration and relaxation parameters. Iterative refinement methods such as detection and precoding based on iterative refinement [34], NI and DBNI with iterative refinement [35] and refinement Jacobi [36] have been used to achieve high precision for M-MIMO detection. The extra refinement steps increase the cost of each iteration, thereby resulting in significantly increased complexity.…”
Section: Prior Workmentioning
confidence: 99%
“…Moreover, its complexity is even higher than the exact matrix inversion algorithm for more than three expansion terms. To reduce the computational complexity by replacing the NSE, several other low-complexity approximate data detection methods [22]- [36] based on classical iterative methods have been proposed. However, all these methods exhibit degraded performance when the number of users increases and require a larger number of iterations to achieve better performance with even higher complexity than the exact matrix inversion (see the analysis in Section-III).…”
Section: Introductionmentioning
confidence: 99%