2019
DOI: 10.1109/tcomm.2019.2944373
|View full text |Cite
|
Sign up to set email alerts
|

Spectral Efficiency Optimization of Spatially-Correlated Multi-Pair Full-Duplex Massive MIMO Relaying

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 34 publications
1
6
0
Order By: Relevance
“…( 32)- (36), and the "Numerical Results" are generated according to Eqns. ( 18)-( 23) and ( 25)- (28). We can observe that large-scale approximations closely match the numerical results, and the sum SE increases with increasing inter-antenna distance while experiencing a smaller spatial correlation.…”
Section: ) Total Complexitysupporting
confidence: 73%
See 3 more Smart Citations
“…( 32)- (36), and the "Numerical Results" are generated according to Eqns. ( 18)-( 23) and ( 25)- (28). We can observe that large-scale approximations closely match the numerical results, and the sum SE increases with increasing inter-antenna distance while experiencing a smaller spatial correlation.…”
Section: ) Total Complexitysupporting
confidence: 73%
“…( 42)- (46), and the "Numerical Results" are generated by Eqns. ( 18)-( 23) and ( 25)- (28). We can see that the sum SE increases as the inter-antenna distance increases and begins to saturate when d > 0.5λ.…”
Section: ) Total Complexitymentioning
confidence: 84%
See 2 more Smart Citations
“…However, the power allocation in FD-style CF systems is non-convex and computationally challenging due to the large size of optimization variables. To date, many optimization algorithms for resource allocation have been proposed, such as Dinkelbach's transform [16], quadratic transform (QT) [17,18], dual decomposition [19] and successive convex approximation (SCA) [20,21]. These approaches can generally converge to local optimum within several iterations, but their computational complexity expands exponentially as the size of network.…”
Section: A Related Workmentioning
confidence: 99%