scholarly journals PCA-Aided Linear Precoding in Massive MIMO Systems with Imperfect CSI

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Van-Khoi Dinh ◽  
Minh-Tuan Le ◽  
Vu-Duc Ngo ◽  
Chi-Hieu Ta
Keyword(s):  
Principal Component Analysis ◽  
Computational Complexity ◽  
Massive Mimo ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Principal Component ◽  
Low Complexity ◽  
Component Analysis ◽  
Linear Precoding ◽  
Block Diagonalization

In this paper, a low-complexity linear precoding algorithm based on the principal component analysis technique in combination with the conventional linear precoders, called Principal Component Analysis Linear Precoder (PCA-LP), is proposed for massive MIMO systems. The proposed precoder consists of two components: the first one minimizes the interferences among neighboring users and the second one improves the system performance by utilizing the Principal Component Analysis (PCA) technique. Numerical and simulation results show that the proposed precoder has remarkably lower computational complexity than its low-complexity lattice reduction-aided regularized block diagonalization using zero forcing precoding (LC-RBD-LR-ZF) and lower computational complexity than the PCA-aided Minimum Mean Square Error combination with Block Diagonalization (PCA-MMSE-BD) counterparts while its bit error rate (BER) performance is comparable to those of the LC-RBD-LR-ZF and PCA-MMSE-BD ones.

scholarly journals A Joint Approach for Low-Complexity Channel Estimation in 5G Massive MIMO Systems

Electronics ◽  
2018 ◽  
Vol 7 (10) ◽  
pp. 218 ◽  
Author(s):  
Kifayatullah Bangash ◽  
Imran Khan ◽  
Jaime Lloret ◽  
Antonio Leon
Keyword(s):  
Computational Complexity ◽  
Channel Estimation ◽  
Massive Mimo ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Low Complexity ◽  
Least Square ◽  
Mimo Channel ◽  
Finite Sample ◽  
The Impact

Traditional Minimum Mean Square Error (MMSE) detection is widely used in wireless communications, however, it introduces matrix inversion and has a higher computational complexity. For massive Multiple-input Multiple-output (MIMO) systems, this detection complexity is very high due to its huge channel matrix dimension. Therefore, low-complexity detection technology has become a hot topic in the industry. Aiming at the problem of high computational complexity of the massive MIMO channel estimation, this paper presents a low-complexity algorithm for efficient channel estimation. The proposed algorithm is based on joint Singular Value Decomposition (SVD) and Iterative Least Square with Projection (SVD-ILSP) which overcomes the drawback of finite sample data assumption of the covariance matrix in the existing SVD-based semi-blind channel estimation scheme. Simulation results show that the proposed scheme can effectively reduce the deviation, improve the channel estimation accuracy, mitigate the impact of pilot contamination and obtain accurate CSI with low overhead and computational complexity.

scholarly journals Low Complexity Angular-Domain Detection for the Uplink of Multi-User mmWave Massive MIMO Systems

Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 795
Author(s):  
Xiaoxuan Xia ◽  
Wence Zhang ◽  
Yinkai Fu ◽  
Xu Bao ◽  
Jing Xia
Keyword(s):  
Energy Efficiency ◽  
Computational Complexity ◽  
Massive Mimo ◽  
Communication Systems ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Digital Processing ◽  
Low Complexity ◽  
Angular Domain

To compromise between the system performance and hardware cost, millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems have been regarded as an enabling technology for the fifth generation of mobile communication systems (5G). This paper considers a low-complexity angular-domain compressing based detection (ACD) for uplink multi-user mmWave massive MIMO systems, which involves hybrid analog and digital processing. In analog processing, we perform angular-domain compression on the received signal by exploiting the sparsity of the mmWave channel to reduce the dimension of the signal space. In digital processing, the proposed ACD scheme works well with zero forcing (ZF)/maximum ratio combining (MRC)/minimum mean square error (MMSE) detection schemes. The performance analysis of the proposed ACD scheme is provided in terms of achievable rates, energy efficiency and computational complexity. Simulations are carried out and it shows that compared with existing works, the proposed ACD scheme not only reduces the computational complexity by more than 50 % , but also improves the system’s achievable rates and energy efficiency.

Comparisons of Environmental Ordinations with Principal Component Vegetational Ordinations for Sets of Data Having Different Degrees of Complexity

1971 ◽  
Vol 1 (2) ◽  
pp. 99-112 ◽  
Author(s):  
J. K. Jeglum ◽  
C. F. Wehrhahn ◽  
J. M. A. Swan
Keyword(s):  
Principal Component Analysis ◽  
Water Level ◽  
Principal Component ◽  
Low Complexity ◽  
Component Analysis ◽  
Two Dimensional ◽  
High Complexity ◽  
Water Conductivity ◽  
Data Set ◽  
Total Data

Data from a survey of lowland, mainly peatland, vegetation were subjected to environmental ordination based on measurements of water level and water conductivity, and to vegetational ordination derived from principal component analysis (P.C.A.). Analyzed were the total set of the data ("all types"), half sets ("nonwoody" and "woody types") and quarter sets (stands of "marshes", "meadows", "shrub fens", and "other woody types"); the number of distinct physiognomic groups in a set of data, and presumably the amount of contained heterogeneity, decreased at each segmentation.The effectiveness of the ordination models was tested by correlating measured distances in two-dimensional ordination models with 2W/(A + B) indices of vegetational similarity for randomly selected pairs of types or stands. As the physiognomic complexity decreased, the effectiveness of the P.C.A. vegetational ordination increased whereas that of the environmental ordination decreased. The environmental ordination seemed most appropriate to the data encompassing high complexity (total data set), while the P.C.A. vegetational ordination seemed most appropriate to data with low complexity (quarter sets of the data).

scholarly journals A Novel Iterative Discrete Estimation Algorithm for Low-Complexity Signal Detection in Uplink Massive MIMO Systems

Electronics ◽  
2019 ◽  
Vol 8 (9) ◽  
pp. 980 ◽  
Author(s):  
Hui Feng ◽  
Xiaoqing Zhao ◽  
Zhengquan Li ◽  
Song Xing
Keyword(s):  
Computational Complexity ◽  
Massive Mimo ◽  
Mimo Systems ◽  
Estimation Algorithm ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Base Station ◽  
Damping Factor ◽  
Mimo Detection ◽  
Discrete Estimation

In this paper, a novel iterative discrete estimation (IDE) algorithm, which is called the modified IDE (MIDE), is proposed to reduce the computational complexity in MIMO detection in uplink massive MIMO systems. MIDE is a revision of the alternating direction method of multipliers (ADMM)-based algorithm, in which a self-updating method is designed with the damping factor estimated and updated at each iteration based on the Euclidean distance between the iterative solutions of the IDE-based algorithm in order to accelerate the algorithm’s convergence. Compared to the existing ADMM-based detection algorithm, the overall computational complexity of the proposed MIDE algorithm is reduced from O N t 3 + O N r N t 2 to O N t 2 + O N r N t in terms of the number of complex-valued multiplications, where Ntand Nr are the number of users and the number of receiving antennas at the base station (BS), respectively. Simulation results show that the proposed MIDE algorithm performs better in terms of the bit error rate (BER) than some recently-proposed approximation algorithms in MIMO detection of uplink massive MIMO systems.

Sign in / Sign up

Export Citation Format

Share Document