2013 22nd Wireless and Optical Communication Conference 2013
DOI: 10.1109/wocc.2013.6676367
|View full text |Cite
|
Sign up to set email alerts
|

Pilot coverage optimization for cellular network by joint beamforming of multiple sectors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…Choosing JEPD is mainly because transmission power adjustment and downtilt adjustment are commonly used two technologies for coverage control [2], [13], joint exhaustion of transmission power and downtilt gives the best coverage effect that can be achieved by using the existing methods.…”
Section: B Baseline Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Choosing JEPD is mainly because transmission power adjustment and downtilt adjustment are commonly used two technologies for coverage control [2], [13], joint exhaustion of transmission power and downtilt gives the best coverage effect that can be achieved by using the existing methods.…”
Section: B Baseline Algorithmmentioning
confidence: 99%
“…Most of the existing researches on cell coverage control technology focus on the problem of ground coverage [2][3][4]. With the developments of urbanization and three-dimensional transportation, large-scale three-dimensional structures such as viaducts, overpasses and high-rise buildings increase rapidly in recent years.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, we may drop Eq. (13e) to obtain the SDR of Problem (13), and then obtain the optimal solution {W} opt by using convex optimization toolbox.…”
Section: A Problem Solvingmentioning
confidence: 99%
“…From the procedure of HEIS algorithm, we find the computational complexity mainly comes from the solving of problem (13), which has a worst-case complexity of O max {m, n} 4 n 1/2 log (1/ε) [7]. Where, m is the number of constraint conditions in Eqs.…”
Section: B Algorithm Implementationmentioning
confidence: 99%
See 1 more Smart Citation