scholarly journals Low-Complexity Gaussian Detection for MIMO Systems

2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
Tianbin Wo ◽  
Peter Adam Hoeher
Keyword(s):  
Computational Complexity ◽  
Likelihood Function ◽  
Gaussian Approximation ◽  
Mimo Systems ◽  
Low Complexity ◽  
Delay Spread ◽  
Data Detection ◽  
Mimo Channels ◽  
Interference Structure ◽  
Single Carrier

For single-carrier transmission over delay-spread multi-input multi-output (MIMO) channels, the computational complexity of the receiver is often considered as a bottleneck with respect to (w.r.t.) practical implementations. Multi-antenna interference (MAI) together with intersymbol interference (ISI) provides fundamental challenges for efficient and reliable data detection. In this paper, we carry out a systematic study on the interference structure of MIMO-ISI channels, and sequentially deduce three different Gaussian approximations to simplify the calculation of the global likelihood function. Using factor graphs as a general framework and applying the Gaussian approximation, three low-complexity iterative detection algorithms are derived, and their performances are compared by means of Monte Carlo simulations. After a careful inspection of their merits and demerits, we propose a graph-based iterative Gaussian detector (GIGD) for severely delay-spread MIMO channels. The GIGD is characterized by a strictly linear computational complexity w.r.t. the effective channel memory length, the number of transmit antennas, and the number of receive antennas. When the channel has a sparse ISI structure, the complexity of the GIGD is strictly proportional to the number of nonzero channel taps. Finally, the GIGD provides a near-optimum performance in terms of the bit error rate (BER) for repetition encoded MIMO systems.

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 Low-Complexity Detection Algorithms for Spatial Modulation MIMO Systems

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Xinhe Zhang ◽  
Yuehua Zhang ◽  
Chang Liu ◽  
Hanzhong Jia
Keyword(s):  
Computational Complexity ◽  
Mimo Systems ◽  
Optimal Solution ◽  
Low Complexity ◽  
Search Tree ◽  
Spatial Modulation ◽  
Algorithm Analysis ◽  
Detection Algorithms ◽  
Search Order ◽  
Ber Performance

In this paper, the authors propose three low-complexity detection schemes for spatial modulation (SM) systems based on the modified beam search (MBS) detection. The MBS detector, which splits the search tree into some subtrees, can reduce the computational complexity by decreasing the nodes retained in each layer. However, the MBS detector does not take into account the effect of subtree search order on computational complexity, and it does not consider the effect of layers search order on the bit-error-rate (BER) performance. The ost-MBS detector starts the search from the subtree where the optimal solution is most likely to be located, which can reduce total searches of nodes in the subsequent subtrees. Thus, it can decrease the computational complexity. When the number of the retained nodes is fixed, which nodes are retained is very important. That is, the different search orders of layers have a direct influence on BER. Based on this, we propose the oy-MBS detector. The ost-oy-MBS detector combines the detection order of ost-MBS and oy-MBS together. The algorithm analysis and experimental results show that the proposed detectors outstrip MBS with respect to the BER performance and the computational complexity.

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 Early Neighbor Rejection-Aided Tabu Search Detection for Large MIMO Systems

2021 ◽  
Vol 11 (16) ◽  
pp. 7305
Author(s):  
Uzokboy Ummatov ◽  
Jin-Sil Park ◽  
Gwang-Jae Jang ◽  
Ju-Dong Lee
Keyword(s):  
Computational Complexity ◽  
Tabu Search ◽  
Mimo Systems ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Qr Decomposition ◽  
Efficient Computation ◽  
Multiple Input ◽  
Input Multiple Output ◽  
Ordering Schemes

In this study, a low complexity tabu search (TS) algorithm for multiple-input multiple-output (MIMO) systems is proposed. To reduce the computational complexity of the TS algorithm, early neighbor rejection (ENR) and layer ordering schemes are employed. In the proposed ENR-aided TS (ENR-TS) algorithm, the least promising k neighbors are excluded from the neighbor set in each layer, which reduces the computational complexity of neighbor examination in each TS iteration. For efficient computation of the neighbors’ metrics, the ENR scheme can be incorporated into QR decomposition-aided TS (ENR-QR-TS). To further reduce the complexity and improve the performance of the ENR-QR-TS scheme, a layer ordering scheme is employed. The layer ordering scheme determines the order in which layers are detected based on their expected metrics, which reduces the risk of excluding likely neighbors in early layers. The simulation results show that the ENR-TS achieves nearly the same performance as the conventional TS while providing up to 82% complexity reduction.

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 A Low-Complexity Data Detection Algorithm for Massive MIMO Systems

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 39341-39351 ◽  
Author(s):  
Imran A. Khoso ◽  
Xiaoming Dai ◽  
M. Nauman Irshad ◽  
Ali Khan ◽  
Xiyuan Wang
Keyword(s):  
Massive Mimo ◽  
Mimo Systems ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Data Detection

A Low-Complexity Soft-Output Signal Data Detection Algorithm for UL Massive MIMO Systems

2021 ◽  
Author(s):  
Salah Berra ◽  
Mahmoud A. M. Albreem ◽  
Maha Malek ◽  
Rui Dinis ◽  
Xingwang Li ◽  
...  
Keyword(s):  
Output Signal ◽  
Massive Mimo ◽  
Mimo Systems ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Data Detection

scholarly journals Impact of Stair and Diagonal Matrices in Iterative Linear Massive MIMO Uplink Detectors for 5G Wireless Networks

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 71 ◽  
Author(s):  
Mahmoud A. Albreem ◽  
Mohammed H. Alsharif ◽  
Sunghwan Kim
Keyword(s):  
Computational Complexity ◽  
Iterative Methods ◽  
Mimo Systems ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Matrix Inversion ◽  
Multiple Input ◽  
The Matrix ◽  
Input Multiple Output ◽  
The Impact

In massive multiple-input multiple-output (M-MIMO) systems, a detector based on maximum likelihood (ML) algorithm attains optimum performance, but it exhaustively searches all possible solutions, hence, it has a very high complexity and realization is denied. Linear detectors are an alternative solution because of low complexity and simplicity in implementation. Unfortunately, they culminate in a matrix inversion that increases the computational complexity in high loaded systems. Therefore, several iterative methods have been proposed to approximate or avoid the matrix inversion, such as the Neuamnn series (NS), Newton iterations (NI), successive overrelaxation (SOR), Gauss–Siedel (GS), Jacobi (JA), and Richardson (RI) methods. However, a detector based on iterative methods requires a pre-processing and initialization where good initialization impresses the convergence, the performance, and the complexity. Most of the existing iterative linear detectors are using a diagonal matrix ( D ) in initialization because the equalization matrix is almost diagonal. This paper studies the impact of utilizing a stair matrix ( S ) instead of D in initializing the linear M-MIMO uplink (UL) detector. A comparison between iterative linear M-MIMO UL detectors with D and S is presented in performance and computational complexity. Numerical Results show that utilization of S achieves the target performance within few iterations, and, hence, the computational complexity is reduced. A detector based on the GS and S achieved a satisfactory bit-error-rate (BER) with the lowest complexity.

scholarly journals Low-Complexity Channel Estimation in 5G Massive MIMO-OFDM Systems

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 713 ◽  
Author(s):  
Omar A. Saraereh ◽  
Imran Khan ◽  
Qais Alsafasfeh ◽  
Salem Alemaishat ◽  
Sunghwan Kim
Keyword(s):  
Channel Estimation ◽  
Compressed Sensing ◽  
Massive Mimo ◽  
Mimo Systems ◽  
Matching Pursuit ◽  
Low Complexity ◽  
Mimo Channel ◽  
Ofdm Systems ◽  
Mimo Channels ◽  
Low Snr

Pilot contamination is the reuse of pilot signals, which is a bottleneck in massive multi-input multi-output (MIMO) systems as it varies directly with the numerous antennas, which are utilized by massive MIMO. This adversely impacts the channel state information (CSI) due to too large pilot overhead outdated feedback CSI. To solve this problem, a compressed sensing scheme is used. The existing algorithms based on compressed sensing require that the channel sparsity should be known, which in the real channel environment is not the case. To deal with the unknown channel sparsity of the massive MIMO channel, this paper proposes a structured sparse adaptive coding sampling matching pursuit (SSA-CoSaMP) algorithm that utilizes the space–time common sparsity specific to massive MIMO channels and improves the CoSaMP algorithm from the perspective of dynamic sparsity adaptive and structural sparsity aspects. It has a unique feature of threshold-based iteration control, which in turn depends on the SNR level. This approach enables us to determine the sparsity in an indirect manner. The proposed algorithm not only optimizes the channel estimation performance but also reduces the pilot overhead, which saves the spectrum and energy resources. Simulation results show that the proposed algorithm has improved channel performance compared with the existing algorithm, in both low SNR and low pilot overhead.

Sign in / Sign up

Export Citation Format

Share Document