A Deeply Fused Detection Algorithm Based on Steepest Descent and Non-Stationary Richardson Iteration for Massive MIMO Systems

2020 ◽  
Vol 24 (12) ◽  
pp. 2742-2745
Author(s):  
Mengdan Lou ◽  
Jiaming Tu ◽  
Dewu Shu ◽  
Muhammad Abu Bakar ◽  
Guanghui He
Keyword(s):  
Massive Mimo ◽  
Mimo Systems ◽  
Detection Algorithm ◽  
Steepest Descent

An Efficient Detection Algorithm of Pilot Spoofing Attack in Massive MIMO Systems

2021 ◽  
pp. 107962
Author(s):  
Jun. Zeng ◽  
Dachuan. Wang ◽  
Weiyang. Xu ◽  
Bing. Li
Keyword(s):  
Massive Mimo ◽  
Mimo Systems ◽  
Detection Algorithm ◽  
Efficient Detection

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.

scholarly journals An Improved Jacobi-Based Detector for Massive MIMO Systems

Information ◽  
2019 ◽  
Vol 10 (5) ◽  
pp. 165 ◽  
Author(s):  
Xiaoqing Zhao ◽  
Zhengquan Li ◽  
Song Xing ◽  
Yang Liu ◽  
Qiong Wu ◽  
...  
Keyword(s):  
Massive Mimo ◽  
Communication Systems ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Correction Method ◽  
Detection Algorithm ◽  
Detection Accuracy ◽  
Input Multiple Output ◽  
Mmse Detector

Massive multiple-input-multiple-output (MIMO) is one of the key technologies in the fifth generation (5G) cellular communication systems. For uplink massive MIMO systems, the typical linear detection such as minimum mean square error (MMSE) presents a near-optimal performance. Due to the required direct matrix inverse, however, the MMSE detection algorithm becomes computationally very expensive, especially when the number of users is large. For achieving the high detection accuracy as well as reducing the computational complexity in massive MIMO systems, we propose an improved Jacobi iterative algorithm by accelerating the convergence rate in the signal detection process.Specifically, the steepest descent (SD) method is utilized to achieve an efficient searching direction. Then, the whole-correction method is applied to update the iterative process. As the result, the fast convergence and the low computationally complexity of the proposed Jacobi-based algorithm are obtained and proved. Simulation results also demonstrate that the proposed algorithm performs better than the conventional algorithms in terms of the bit error rate (BER) and achieves a near-optimal detection accuracy as the typical MMSE detector, but utilizing a small number of iterations.

scholarly journals Signal Detection Based on Parallel Group Detection Algorithm for High-Load Massive MIMO Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Thanh-Binh Nguyen ◽  
Minh-Tuan Le ◽  
Vu-Duc Ngo
Keyword(s):  
Massive Mimo ◽  
Mimo Systems ◽  
Mimo System ◽  
Detection Algorithm ◽  
High Load ◽  
Signal Recovery ◽  
Parallel Group ◽  
Group Detection ◽  
Practical Complexity ◽  
Ber Performance

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.

scholarly journals Active Eavesdropping Detection Based on Large-Dimensional Random Matrix Theory for Massive MIMO-Enabled IoT

Electronics ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 146 ◽  
Author(s):  
Li Xu ◽  
Jiaqi Chen ◽  
Ming Liu ◽  
Xiaoyi Wang
Keyword(s):  
Random Matrix Theory ◽  
Random Matrix ◽  
Massive Mimo ◽  
Matrix Theory ◽  
Mimo Systems ◽  
Detection Algorithm ◽  
Limit Spectrum ◽  
Spectrum Distribution ◽  
Iot Devices ◽  
Eavesdropping Detection

The increasing Internet-of-Things (IoT) applications will take a significant share of the services of the fifth generation mobile network (5G). However, IoT devices are vulnerable to security threats due to the limitation of their simple hardware and communication protocol. Massive multiple-input multiple-output (massive MIMO) is recognized as a promising technique to support massive connections of IoT devices, but it faces potential physical layer breaches. An active eavesdropper can compromises the communication security of massive MIMO systems by purposely contaminating the uplink pilots. According to the random matrix theory (RMT), the eigenvalue distribution of a large dimensional matrix composed of data samples converges to the limit spectrum distribution that can be characterized by matrix dimensions. With the assistance of RMT, we propose an active eavesdropping detection method in this paper. The theoretical limit spectrum distribution is exploited to determine the distribution range of the eigenvalues of a legitimate user signal. In addition the noise components are removed using the Marčenko–Pastur law of RMT. Hypothesis testing is then carried out to determine whether the spread range of eigenvalues is “normal” or not. Simulation results show that, compared with the classical Minimum Description Length (MDL)-based detection algorithm, the proposed method significantly improves active eavesdropping detection performance.

scholarly journals Fast Converging Iterative Precoding for Massive MIMO Systems: An Accelerated Weighted Neumann Series-Steepest Descent Approach

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 50244-50255
Author(s):  
Qian Deng ◽  
Xiaopeng Liang ◽  
Xianpeng Wang ◽  
Mengxing Huang ◽  
Chao Dong ◽  
...  
Keyword(s):  
Massive Mimo ◽  
Mimo Systems ◽  
Neumann Series ◽  
Steepest Descent
Sign in / Sign up

Export Citation Format

Share Document