2018 IEEE Globecom Workshops (GC Wkshps) 2018
DOI: 10.1109/glocomw.2018.8644321
|View full text |Cite
|
Sign up to set email alerts
|

Machine Learning Based Hybrid Precoding for MmWave MIMO-OFDM with Dynamic Subarray

Abstract: Hybrid precoding design can be challenging for broadband millimeter-wave (mmWave) massive MIMO due to the frequency-flat analog precoder in radio frequency (RF). Prior broadband hybrid precoding work usually focuses on fully-connected array (FCA), while seldom considers the energyefficient partially-connected subarray (PCS) including the fixed subarray (FS) and dynamic subarray (DS). Against this background, this paper proposes a machine learning based broadband hybrid precoding for mmWave massive MIMO with DS… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 21 publications
0
9
0
Order By: Relevance
“…As we mentioned before, all variables can be updated in the closed-form. Thus, we propose an iterative hybrid beamforming design algorithm (similar to the block coordinate descent (BCD) method) to effectively solve problem (13). The details of updating each variable are described in the following subsections.…”
Section: A Closed-form Fp-aided Transformationmentioning
confidence: 99%
See 2 more Smart Citations
“…As we mentioned before, all variables can be updated in the closed-form. Thus, we propose an iterative hybrid beamforming design algorithm (similar to the block coordinate descent (BCD) method) to effectively solve problem (13). The details of updating each variable are described in the following subsections.…”
Section: A Closed-form Fp-aided Transformationmentioning
confidence: 99%
“…Then, we turn to demonstrate the convergence of algorithm. Essentially, Algorithm 2 is a BCD algorithm for the reformulated problem (13) and there are four optimized variables needed to be updated. In each iteration, the optimal solution of ρ, ξ, and f BB l,k can be easily proved to be monotonic.…”
Section: E Convergence and Computational Complexity Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, we conclude this paper in Section VII. This paper was presented in part at the IEEE GLOBE-COM'18 [43], [44]. Except for the work presented in [43], [44], the unique contribution of this paper is the expansion of the PCS structure on hybrid combiner and the evaluation of the performance, including the EE performance of the system, the computational complexity of the antenna grouping algorithm, the robustness of antenna grouping algorithm to time-varying channel, and the robustness to channel perturbation.…”
Section: B Our Contributionsmentioning
confidence: 99%
“…Furthermore, the capacity-oriented adaptive transmit antenna selection (ATAS) based on principal component analysis (PCA) is proposed for mmWave LOS MIMO channel. PCA is a statistical procedure that uses orthogonal transformation to convert a set of correlated variables into a set of linearly uncorrelated variables [29], [30]. The proposed ATAS based on PCA can adaptively determine the number and indices of transmit antennas according to the channel conditions.…”
Section: Introductionmentioning
confidence: 99%