scholarly journals High-Performance Fingerprint Localization in Massive MIMO System

2021 ◽  
Author(s):  
Yijie Ren ◽  
Zhixing Xiao ◽  
Yuan Tang ◽  
Fei Tang ◽  
Xiaojun Wang ◽  
...  

Location-based service (LBS) for both security and commercial use is becoming more and more important with the rise of 5G. Fingerprint localization (FL) is one of the most efficient positioning methods for both indoor and outdoor localization. However, the positioning time of previous research cannot achieve real-time requirement and the positioning error is meter level. In this paper, we concentrated on high-performance in massive multiple-in-multiple-out (MIMO) systems. Principal Component Analysis (PCA) is applied to reduce the dimension of fingerprint, so that the positioning time is about tens of milliseconds with lower storage. What’s more, a novel fingerprint called Angle Delay Fingerprint (ADF) is proposed. Simulation result of the positioning method based on ADF shows the positioning error is about 0.3 meter and the positioning time is about hundreds of milliseconds, which is much better than other previous known methods. (Foundation items: Social Development Projects of Jiangsu Science and Technology Department (No.BE2018704).)

2021 ◽  
Author(s):  
Seyedeh Samira Moosavi ◽  
Paul Fortier

Abstract Currently, localization in distributed massive MIMO (DM-MIMO) systems based on the fingerprinting (FP) approach has attracted great interest. However, this method suffers from severe multipath and signal degradation such that its accuracy is deteriorated in complex propagation environments, which results in variable received signal strength (RSS). Therefore, providing robust and accurate localization is the goal of this work. In this paper, we propose an FP-based approach to improve the accuracy of localization by reducing the noise and the dimensions of the RSS data. In the proposed approach, the fingerprints rely solely on the RSS from the single-antenna MT collected at each of the receive antenna elements of the massive MIMO base station. After creating a radio map, principal component analysis (PCA) is performed to reduce the noise and redundancy. PCA reduces the data dimension which leads to the selection of the appropriate antennas and reduces complexity. A clustering algorithm based on K-means and affinity propagation clustering (APC) is employed to divide the whole area into several regions which improves positioning precision and reduces complexity and latency. Finally, in order to have high precise localization estimation, all similar data in each cluster are modeled using a well-designed deep neural network (DNN) regression. Simulation results show that the proposed scheme improves positioning accuracy significantly. This approach has high coverage and improves average root-mean-squared error (RMSE) performance to a few meters, which is expected in 5G and beyond networks. Consequently, it also proves the superiority of the proposed method over the previous location estimation schemes.


Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1552
Author(s):  
Tongzhou Han ◽  
Danfeng Zhao

In centralized massive multiple-input multiple-output (MIMO) systems, the channel hardening phenomenon can occur, in which the channel behaves as almost fully deterministic as the number of antennas increases. Nevertheless, in a cell-free massive MIMO system, the channel is less deterministic. In this paper, we propose using instantaneous channel state information (CSI) instead of statistical CSI to obtain the power control coefficient in cell-free massive MIMO. Access points (APs) and user equipment (UE) have sufficient time to obtain instantaneous CSI in a slowly time-varying channel environment. We derive the achievable downlink rate under instantaneous CSI for frequency division duplex (FDD) cell-free massive MIMO systems and apply the results to the power control coefficients. For FDD systems, quantized channel coefficients are proposed to reduce feedback overhead. The simulation results show that the spectral efficiency performance when using instantaneous CSI is approximately three times higher than that achieved using statistical CSI.


Author(s):  
Adeeb Salh ◽  
Lukman Audah ◽  
Nor Shahida M. Shah ◽  
Shipun A. Hamzah

<span>Massive multi-input–multi-output (MIMO) systems are crucial to maximizing energy efficiency (EE) and battery-saving technology. Achieving EE without sacrificing the quality of service (QoS) is increasingly important for mobile devices. We first derive the data rate through zero forcing (ZF) and three linear precodings: maximum ratio transmission (MRT), zero forcing (ZF), and minimum mean square error (MMSE). Performance EE can be achieved when all available antennas are used and when taking account of the consumption circuit power ignored because of high transmit power. The aim of this work is to demonstrate how to obtain maximum EE while minimizing power consumed, which achieves a high data rate by deriving the optimal number of antennas in the downlink massive MIMO system. This system includes not only the transmitted power but also the fundamental operation circuit power at the transmitter signal. Maximized EE depends on the optimal number of antennas and determines the number of active users that should be scheduled in each cell. We conclude that the linear precoding technique MMSE achieves the maximum EE more than ZF and MRT</span><em></em><span>because the MMSE is able to make the massive MIMO system less sensitive to SNR at an increased number of antennas</span><span>.</span>


Information ◽  
2020 ◽  
Vol 11 (6) ◽  
pp. 301
Author(s):  
Samarendra Nath Sur ◽  
Rabindranath Bera ◽  
Akash Kumar Bhoi ◽  
Mahaboob Shaik ◽  
Gonçalo Marques

Massive multi-input-multi-output (MIMO) systems are the future of the communication system. The proper design of the MIMO system needs an appropriate choice of detection algorithms. At the same time, Lattice reduction (LR)-aided equalizers have been well investigated for MIMO systems. Many studies have been carried out over the Korkine–Zolotareff (KZ) and Lenstra–Lenstra–Lovász (LLL) algorithms. This paper presents an analysis of the channel capacity of the massive MIMO system. The mathematical calculations included in this paper correspond to the channel correlation effect on the channel capacity. Besides, the achievable gain over the linear receiver is also highlighted. In this study, all the calculations were further verified through the simulated results. The simulated results show the performance comparison between zero forcing (ZF), minimum mean squared error (MMSE), integer forcing (IF) receivers with log-likelihood ratio (LLR)-ZF, LLR-MMSE, KZ-ZF, and KZ-MMSE. The main objective of this work is to show that, when a lattice reduction algorithm is combined with the convention linear MIMO receiver, it improves the capacity tremendously. The same is proven here, as the KZ-MMSE receiver outperforms its counterparts in a significant margin.


Sensors ◽  
2020 ◽  
Vol 20 (21) ◽  
pp. 6255
Author(s):  
Taehyoung Kim ◽  
Sangjoon Park

In this paper, we propose a novel statistical beamforming (SBF) method called the partial-nulling-based SBF (PN-SBF) to serve a number of users that are undergoing distinct degrees of spatial channel correlations in massive multiple-input multiple-output (MIMO) systems. We consider a massive MIMO system with two user groups. The first group experiences a low spatial channel correlation, whereas the second group has a high spatial channel correlation, which can happen in massive MIMO systems that are based on fifth-generation networks. By analyzing the statistical signal-to-interference-plus-noise ratio, it can be observed that the statistical beamforming vector for the low-correlation group should be designed as the orthogonal complement for the space spanned by the aggregated channel covariance matrices of the high-correlation group. Meanwhile, the spatial degrees of freedom for the high-correlation group should be preserved without cancelling the interference to the low-correlation group. Accordingly, a group-common pre-beamforming matrix is applied to the low-correlation group to cancel the interference to the high-correlation group. In addition, to deal with the intra-group interference in each group, the post-beamforming vector for each group is designed in the manner of maximizing the signal-to-leakage-and-noise ratio, which yields additional performance improvements for the PN-SBF. The simulation results verify that the proposed PN-SBF outperforms the conventional SBF schemes in terms of the ergodic sum rate for the massive MIMO systems with distinct spatial correlations, without the rate ceiling effect in the high signal-to-noise ratio region unlike conventional SBF schemes.


2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Thanh-Binh Nguyen ◽  
Minh-Tuan Le ◽  
Vu-Duc Ngo

In this paper, a parallel group detection (PGD) algorithm is proposed in order to address the degradation in the bit error rate (BER) performance of linear detectors when they are used in high-load massive MIMO systems. The algorithm is constructed by converting the equivalent extended massive MIMO system into two subsystems, which can be simultaneously detected by the classical detection procedures. Then, using the PGD and the classical ZF as well as the QR-decomposition- (QRD-) based detectors, we proposed two new detectors, called ZF-based PGD (ZF-PGD) and QRD-based PGD (QRD-PGD). The PGD is further combined with the sorted longest basis (SLB) algorithm to make the signal recovery more accurate, thereby resulting in two new detectors, namely, the ZF-PGD-SLB and the QRD-PGD-SLB. Various complexity evaluations and simulations prove that the proposed detectors can significantly improve the BER performance compared to their classical linear and QRD counterparts with the practical complexity levels. Hence, our proposed detectors can be used as efficient means of estimating the transmitted signals in high-load massive MIMO systems.


2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Van-Khoi Dinh ◽  
Minh-Tuan Le ◽  
Vu-Duc Ngo ◽  
Chi-Hieu Ta

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.


2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Gustavo Anjos ◽  
Daniel Castanheira ◽  
Adão Silva ◽  
Atílio Gameiro ◽  
Marco Gomes ◽  
...  

The exploration of the physical layer characteristics of the wireless channel is currently the object of intensive research in order to develop advanced secrecy schemes that can protect information against eavesdropping attacks. Following this line of work, in this manuscript we consider a massive MIMO system and jointly design the channel precoder and security scheme. By doing that we ensure that the precoding operation does not reduce the degree of secrecy provided by the security scheme. The fundamental working principle of the proposed technique is to apply selective random rotations in the transmitted signal at the antenna level in order to achieve a compromise between legitimate and eavesdropper channel capacities. These rotations use the phase of the reciprocal wireless channel as a common random source between the transmitter and the intended receiver. To assess the security performance, the proposed joint scheme is compared with a recently proposed approach for massive MIMO systems. The results show that, with the proposed joint design, the number of antenna elements does not influence the eavesdropper channel capacity, which is proved to be equal to zero, in contrast to previous approaches.


2017 ◽  
Vol 67 (6) ◽  
pp. 668
Author(s):  
Qingzhu Wang ◽  
Mengying Wei ◽  
Yihai Zhu

<p class="p1">To make full use of space multiplexing gains for the multi-user massive multiple-input multiple-output, accurate channel state information at the transmitter (CSIT) is required. However, the large number of users and antennas make CSIT a higher-order data representation. Tensor-based compressive sensing (TCS) is a promising method that is suitable for high-dimensional data processing; it can reduce training pilot and feedback overhead during channel estimation. In this paper, we consider the channel estimation in frequency division duplexing (FDD) multi-user massive MIMO system. A novel estimation framework for three dimensional CSIT is presented, in which the modes include the number of transmitting antennas, receiving antennas, and users. The TCS technique is employed to complete the reconstruction of three dimensional CSIT. The simulation results are given to demonstrate that the proposed estimation approach outperforms existing algorithms.</p>


2019 ◽  
Vol 8 (2S11) ◽  
pp. 2834-2840

This paper deals with various low complexity algorithms for higher order matrix inversion involved in massive MIMO system precoder design. The performance of massive MIMO systems is optimized by the process of precoding which is divided into linear and nonlinear. Nonlinear precoding techniques are most complex precoding techniques irrespective of its performance. Hence, linear precoding is generally preferred in which the complexity is mainly contributed by matrix inversion algorithm. To solve this issue, Krylov subspace algorithm such as Conjugate Gradient (CG) was considered to be the best choice of replacement for exact matrix inversions. But CG enforces a condition that the matrix needs to be Symmetric Positive Definite (SPD). If the matrix to be inverted is asymmetric then CG fails to converge. Hence in this paper, a novel approach for the low complexity inversion of asymmetric matrices is proposed by applying two different versions of CG algorithms- Conjugate Gradient Squared (CGS) and Bi-conjugate Gradient (Bi-CG). The convergence behavior and BER performance of these two algorithms are compared with the existing CG algorithm. The results show that these two algorithms outperform CG in terms of convergence speed and relative residue.


Sign in / Sign up

Export Citation Format

Share Document