2020
DOI: 10.1109/lcomm.2019.2958694
|View full text |Cite
|
Sign up to set email alerts
|

Alternating Optimization Based Low Complexity Hybrid Precoding in Millimeter Wave MIMO Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…The mean azimuth and elevation angles of any cluster subject to uniform distribution in the range of [0, 2π). The angular spread of any cluster is 10 degree [16, 18]. We also show the performance of three typical hybrid beamforming algorithms: Alternating Optimization Based Hybrid Precoding (Alt‐Opt) [18], Hybrid Design by Alternating Minimization (HD‐AM) [17] and Manifold Optimization Based Hybrid Precoding (MO‐AltMin) [16].…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The mean azimuth and elevation angles of any cluster subject to uniform distribution in the range of [0, 2π). The angular spread of any cluster is 10 degree [16, 18]. We also show the performance of three typical hybrid beamforming algorithms: Alternating Optimization Based Hybrid Precoding (Alt‐Opt) [18], Hybrid Design by Alternating Minimization (HD‐AM) [17] and Manifold Optimization Based Hybrid Precoding (MO‐AltMin) [16].…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The Saleh–Valenzuela channel model is suitable to represent these characters [11]. Hence, for BS k , the channel model can be given by [18] boldH(k)=NtNrNclNray×i=1Nclj=1Nrayαij(k)boldanormalrfalse(ϕijnormalrfalse(kfalse),θijnormalrfalse(kfalse)false)boldanormalt(ϕijt(k),θijt(k))H.$$\begin{align} \mathbf {H}^{(k)}=&\sqrt {\dfrac{N_\mathrm{t} N_\mathrm{r}}{N_\mathrm{cl} N_\mathrm{ray}}} \nonumber \\ &\times \sum \limits _{i=1}^{N_\mathrm{cl}} \sum \limits _{j=1}^{N_\mathrm{ray}}{\alpha _{ij}}^{(k)} \mathbf {a}_\mathrm{r}({\phi _{ij}^\mathrm{r}}^{(k)}, {\theta _{ij}^\mathrm{r}}^{(k)}) \mathbf {a}_\mathrm{t}({\phi _{ij}^\mathrm{t}}^{(k)}, {\theta _{ij}^\mathrm{t}}^{(k)})^H. \end{align}$$ N cl is the number of clusters in the channel.…”
Section: System Modelmentioning
confidence: 99%
“…The optimization problem in ( 16 ) is a non-convex mixed-integer programming, which is NP-hard. Since there exist four optimization variables, i.e., , , , and in ( 16 ), we can decompose the primal problem into four subproblems by using the alternating optimization (AO) method, which is widely used in research related to resource allocation [ 28 , 29 , 30 ]. In the AO method, the optimal resource allocation scheme of the optimization problem is obtained by solving the subproblems in sequence, which are discussed in the following subsections.…”
Section: Resource Allocation For Sum Secrecy Rate Maximizationmentioning
confidence: 99%
“…The advantage of the analog beamforming structure is that the number of RF chains is small, which greatly reduces the hardware cost and complexity of the system. But the shortcomings of this structure are also obvious [18]. On the one hand, there is only one RF chain, which cannot take full advantage of the high degree of freedom of Massive MIMO.…”
Section: Simulating Beamformingmentioning
confidence: 99%