2018
DOI: 10.1109/access.2018.2870861
|View full text |Cite
|
Sign up to set email alerts
|

A Low Complexity Precoding Algorithm Based on Parallel Conjugate Gradient for Massive MIMO Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…Here, we assume that the channel matrices {H n } are perfectly known at the BS, which can be determined by exploiting the channel reciprocity [14], [15] of time division multiplexing (TDD) systems. It can be easily verified that the ZF has a high computational complexity [16], [17] since it needs to compute large-scale pseudo-inverse matrix.…”
Section: B Multi-user Precoding Schemementioning
confidence: 99%
“…Here, we assume that the channel matrices {H n } are perfectly known at the BS, which can be determined by exploiting the channel reciprocity [14], [15] of time division multiplexing (TDD) systems. It can be easily verified that the ZF has a high computational complexity [16], [17] since it needs to compute large-scale pseudo-inverse matrix.…”
Section: B Multi-user Precoding Schemementioning
confidence: 99%
“…It aims to cancel out multi-user interference (MUI) between the legitimate receivers. The computational complexity of ZF precoding is discussed in [16], [17]. The adopted ZF precoding vector, F ∈ C N t ×N r , is can be written as…”
Section: System Modelmentioning
confidence: 99%