Location-Aided mMIMO Channel Tracking and Hybrid Beamforming for High-Speed Railway Communications: An Angle-Domain Approach

Xu, Kui; Shen, Zhexian; Wang, Yurong; Xia, Xiaochen

doi:10.1109/jsyst.2019.2911296

Cited by 53 publications

(36 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There can be even multi armed bandit (MAB) issue in which signals get mixed when the number of users are higher than half of sensor array. Beamforming with the constraint of Thompson sampling (TS) is responsible for achieving the maximum gain by increasing the convergence rate [36].…”

Section: Background For Radiation Formationmentioning

confidence: 99%

Conventional and Subspace Algorithms for Mobile Source Detection and Radiation Formation

Thazeen¹,

Mallikarjunaswamy²,

Siddesh³

et al. 2021

View full text Add to dashboard Cite

Background/objectives: The objective of the study is to increase the resolution and radiate sharper beam towards the user in mobile communication using Smart Antenna. Methodology: The Conventional and Subspace Algorithms from the literature are studied and simulated in MATLAB so that the foundation is laid for better detection of algorithms and radiation formation. The results are explained for varying number of antenna elements and mobiles sources placed close to far. Findings: The classical direction of arrival algorithms namely CAPCON, Maximum Entropy Method, Maximum Likelihood Method are used to find the direction of mobile users based on the computation of the power spectrum. Several methods namely Least Mean Square, Griffiths Method, Variable Step Size Griffiths and Recursive Least Square are used to form the main beam for the user detected by the direction of arrival algorithms. Novelty/improvements: In order to take further the research on enhancing the resolution and having a higher convergence rate with reasonable step size, this paper presents the well-known conventional and modern algorithms from the literature. The results are simulated are well described for performing parameters.

show abstract

Section: Background For Radiation Formationmentioning

confidence: 99%

Conventional and Subspace Algorithms for Mobile Source Detection and Radiation Formation

Thazeen¹,

Mallikarjunaswamy²,

Siddesh³

et al. 2021

View full text Add to dashboard Cite

show abstract

“…So the comparison is conducted with the SVD method denoted as normal GSC [15, p. 60]. Since the simulation is designed to show performance of Blocking Matrix generation, any GSC algorithm like LMS GSC, NLMS GSC, Conjugate Gradient GSC [35] can serve the purpose and the angles used in constraints matrix are assumed to be derived by tracking or estimation through location aided scheme [24], [25] or other fast schemes like deep learning algorithm [30] etc. In this simulation we choose NLMS as it makes the selection of step size normalized and easy for comparison.…”

Section: Numerical Simulation and Analysismentioning

confidence: 99%

A Fast Blocking Matrix Generating Algorithm for Generalized Sidelobe Canceller Beamformer in High Speed Rail Like Scenario

Dai

Abbasi

2021

IEEE Sensors J.

View full text Add to dashboard Cite

A fast algorithm to generate the Blocking Matrix for Generalized Sidelobe Canceller (GSC) beamforming is proposed in this paper. The proposed algorithm uses a Simplified Zero Placement Algorithm (SZPA) to directly generate the column vectors of the Blocking Matrix using the polynomial method. The constrained signal incoming angles are converted to spatial frequency and designated as zero locations in the Z domain. Independent vectors that span the whole left null space of the constraint matrix is then built using a simple shift operation. The algorithm also supports the derivative constraints used for robust beamforming. Compared to the conventional methods based on Singular Value Decomposition (SVD), the SZPA algorithm can generate Blocking Matrix more than 9 times faster for scenarios with 15 constraints and will be even more advantageous for more constraints. The Blocking Matrix generated by the SZPA and SVD methods is then implemented in the same GSC architecture for performance evaluation. The numerical simulation confirms that the same overall optimum state performance and learning speed can be achieved. By reducing the calculation time of blocking matrix from 1.541ms of SVD method to 0.168ms, the proposed SZPA algorithm is fast and insensitive to the number of constraints as the required calculation time incremental for each additional constraint with SZPA is only around 1/16 of SVD method. This makes it suitable for scenarios like train to infrastructure communication in High Speed Rail (HSR) where there are multiple constraints and frequent constraints update is required.

show abstract

“…Zero-forcing (ZF) and regularized zero-forcing (RZF) methods can efficiently manage interuser interference and provide some performance improvements [11]. The low-complexity schemes have been extended in recent works for more practical and complex cases, e.g., secure transmissions [12] and high-speed railway communications [13]. In these schemes, only channel state information (CSI) is exploited to determine the design of precoders.…”

Section: Introductionmentioning

confidence: 99%

Symbol Error Rate Minimization Based Constructive Interference Precoding for Multi-User Systems

Zhang

Gui

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Symbol level precoding based on the concept of constructive interference has been recognized as an advanced version of conventional interference-avoidance precoding for multiuser transmission. With the full knowledge of channel state information (CSI) and symbol information, inter-user interference is adjusted to bring constructive effect to the desired signal. However, the existing schemes are limited within the concept of channel pre-equalization which could be further improved. In this paper, we propose a symbol error rate (SER) minimization based constructive interference precoding scheme for multiuser systems. The constructive interference region is firstly defined based on the analysis of the SER expression, which implies that the proposed scheme is essentially a symbol pre-detection scheme. Then, we prove that the optimal precoded signal for SER minimization shall be the linear combination of the channel vectors. Accordingly, a modified feasible direction algorithm is developed to handle the complex expression of SER, where an extra projection step is proposed to enhance the efficiency of the feasible direction. Finally, the proposed scheme is further extended for transmit power optimization and imperfect CSI cases. Simulation results highlight the efficiency of the modified feasible direction, and the superiority of the proposed scheme in terms of SER and transmit power. INDEX TERMS Constructive interference precoding, multiuser systems, symbol error rate minimization, modified feasible direction, symbol pre-detection.

show abstract

Location-Aided mMIMO Channel Tracking and Hybrid Beamforming for High-Speed Railway Communications: An Angle-Domain Approach

Cited by 53 publications

References 43 publications

Conventional and Subspace Algorithms for Mobile Source Detection and Radiation Formation

Conventional and Subspace Algorithms for Mobile Source Detection and Radiation Formation

A Fast Blocking Matrix Generating Algorithm for Generalized Sidelobe Canceller Beamformer in High Speed Rail Like Scenario

Symbol Error Rate Minimization Based Constructive Interference Precoding for Multi-User Systems

Contact Info

Product

Resources

About