scholarly journals A Low-Complexity Double EP-based Detector for Iterative Detection and Decoding in MIMO

2020 ◽  
Author(s):  
Juan José Murillo Fuentes ◽  
irene santos ◽  
José Carlos Aradillas ◽  
Matilde Sánchez-Fernández
Keyword(s):  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Computational Cost ◽  
Neumann Series ◽  
Low Complexity ◽  
Iterative Detection ◽  
Expectation Propagation ◽  
Novel Approach ◽  
Iterative Detection And Decoding ◽  
The Matrix

<div> <div> <div> <p>We propose a new iterative detection and decoding algorithm for multiple-input multiple-output (MIMO) based on expectation propagation (EP) with application to massive MIMO scenarios. Two main results are presented. We first introduce EP to iteratively improve the Gaussian approximations of both the estimation of the posterior by the MIMO detector and the soft output of the channel decoder. With this novel approach, denoted by double-EP (DEP), the convergence is very much improved with a computational complexity just two times the one of the linear minimum mean square error (LMMSE), as illustrated by the included experiments. Besides, as in the LMMSE MIMO detector, when the number of antennas increases, the computational cost of the matrix inversion operation required by the DEP becomes unaffordable. In this work we also develop approaches of DEP where the mean and the covariance matrix of the posterior are approximated by using the Gauss-Seidel and Neumann series methods, respectively. This low-complexity DEP detector has quadratic complexity in the number of antennas, i.e., the same as the low-complexity LMMSE techniques. Experimental results show that the new low-complexity DEP achieves the performance of the DEP as the ratio between the number of transmitting and receiving antennas decreases </p> </div> </div> </div>

scholarly journals A Low-Complexity Double EP-based Detector for Iterative Detection and Decoding in MIMO

2020 ◽  
Author(s):  
Juan José Murillo Fuentes ◽  
irene santos ◽  
José Carlos Aradillas ◽  
Matilde Sánchez-Fernández
Keyword(s):  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Computational Cost ◽  
Neumann Series ◽  
Low Complexity ◽  
Iterative Detection ◽  
Expectation Propagation ◽  
Novel Approach ◽  
Iterative Detection And Decoding ◽  
The Matrix

<div> <div> <div> <p>We propose a new iterative detection and decoding algorithm for multiple-input multiple-output (MIMO) based on expectation propagation (EP) with application to massive MIMO scenarios. Two main results are presented. We first introduce EP to iteratively improve the Gaussian approximations of both the estimation of the posterior by the MIMO detector and the soft output of the channel decoder. With this novel approach, denoted by double-EP (DEP), the convergence is very much improved with a computational complexity just two times the one of the linear minimum mean square error (LMMSE), as illustrated by the included experiments. Besides, as in the LMMSE MIMO detector, when the number of antennas increases, the computational cost of the matrix inversion operation required by the DEP becomes unaffordable. In this work we also develop approaches of DEP where the mean and the covariance matrix of the posterior are approximated by using the Gauss-Seidel and Neumann series methods, respectively. This low-complexity DEP detector has quadratic complexity in the number of antennas, i.e., the same as the low-complexity LMMSE techniques. Experimental results show that the new low-complexity DEP achieves the performance of the DEP as the ratio between the number of transmitting and receiving antennas decreases </p> </div> </div> </div>

scholarly journals Low Complexity Submatrix Divided MMSE Sparse-SQRD Detection for MIMO-OFDM with ESPAR Antenna Receiver

VLSI Design ◽  
2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Diego Javier Reinoso Chisaguano ◽  
Minoru Okada
Keyword(s):  
Orthogonal Frequency Division Multiplexing ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Computational Cost ◽  
Low Complexity ◽  
Detection Process ◽  
Large Size ◽  
Multiple Input ◽  
Input Multiple Output ◽  
Mimo Ofdm

Multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) with an electronically steerable passive array radiator (ESPAR) antenna receiver can improve the bit error rate performance and obtains additional diversity gain without increasing the number of Radio Frequency (RF) front-end circuits. However, due to the large size of the channel matrix, the computational cost required for the detection process using Vertical-Bell Laboratories Layered Space-Time (V-BLAST) detection is too high to be implemented. Using the minimum mean square error sparse-sorted QR decomposition (MMSE sparse-SQRD) algorithm for the detection process the average computational cost can be considerably reduced but is still higher compared with a conventional MIMOOFDM system without ESPAR antenna receiver. In this paper, we propose to use a low complexity submatrix divided MMSE sparse-SQRD algorithm for the detection process of MIMOOFDM with ESPAR antenna receiver. The computational cost analysis and simulation results show that on average the proposed scheme can further reduce the computational cost and achieve a complexity comparable to the conventional MIMO-OFDM detection schemes.

scholarly journals Low-complexity sparse-aware multiuser detection for large-scale MIMO systems

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Rong Ran ◽  
Hayoung Oh
Keyword(s):  
Large Scale ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Finite Alphabet ◽  
Multiuser Detectors ◽  
Input Multiple Output ◽  
Error Detector ◽  
Significant Performance

AbstractSparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a relatively better tradeoff between the performance and complexity compared with several existing detectors.

Low-Complexity MIMO MMSE Receiver with Performance Enhancement via Coordinate Interleaving

2020 ◽  
Vol 29 (14) ◽  
pp. 2050231
Author(s):  
Serdar Özyurt ◽  
Mustafa Öztürk ◽  
Enver Çavuş
Keyword(s):  
Performance Enhancement ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Complexity Reduction ◽  
Error Performance ◽  
Signal Space Diversity ◽  
Mmse Receiver ◽  
Field Programmable ◽  
Input Multiple Output

Multiple-input multiple-output (MIMO) Minimum mean-square error (MMSE) receivers are widely adopted in the latest communication standards and reducing the complexity of these receivers while preserving the error performance is highly desirable. In this work, we study the error performance and implementation complexity of MIMO MMSE receivers when combined with a coordinate interleaved signal space diversity (SSD) technique. Contrary to the well-known trade-off between the error performance and implementation complexity, the proposed system leads to a considerably simplified MIMO MMSE receiver with significant performance gains when compared to the original MIMO MMSE receiver. Unlike the standard MIMO MMSE receiver, the proposed coordinate interleaved technique induces a block diagonal transmit correlation matrix providing both performance enhancement and complexity reduction. The results show that the error performance can be improved more than 10[Formula: see text]dB with up to 71% computational complexity reduction. The complexity comparison between the original and proposed approaches is also verified by means of field-programmable gate array (FPGA) implementation.

scholarly journals Low-Complexity Joint Weighted Neumann Series and Gauss-Seidel Soft-Output Detection  for Massive MIMO Systems

2021 ◽  
Author(s):  
Xiaoming Dai ◽  
Tiantian Yan ◽  
Yuanyuan Dong ◽  
Yuquan Luo ◽  
Hua Li
Keyword(s):  
Mean Squared Error ◽  
Mimo Systems ◽  
Multiple Input Multiple Output ◽  
Neumann Series ◽  
Low Complexity ◽  
Computation Method ◽  
Likelihood Ratios ◽  
Performance Loss ◽  
Minimum Mean Squared Error ◽  
Input Multiple Output

Abstract We introduce a joint weighted Neumann series (WNS) and Gauss-Seidel (GS) approach to implement an approximated linear minimum mean-squared error (LMMSE) detector for uplink massive multiple-input multiple-output (M-MIMO) systems. We first propose to initialize the GS iteration by a WNS method, which produces a closer-to-LMMSE initial solution than the conventional zero vector and diagonal-matrix based scheme. Then the GS algorithm is applied to implement an approximated LMMSE detection iteratively. Furthermore, based on the WNS, we devise a low-complexity approximate log-likelihood ratios (LLRs) computation method whose performance loss is negligible compared with the exact method. Numerical results illustrate that the proposed joint WNS-GS approach outperforms the conventional method and achieves near-LMMSE performance with significantly lower computational complexity.

scholarly journals A Low-Complexity Double EP-based Detector for Iterative Detection and Decoding in MIMO

2020 ◽  
pp. 1-1
Author(s):  
Juan Jose Murillo-Fuentes ◽  
Irene Santos ◽  
Jose Carlos Aradillas ◽  
Matilde Sanchez-Fernandez
Keyword(s):  
Low Complexity ◽  
Iterative Detection ◽  
Iterative Detection And Decoding

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.

Sign in / Sign up

Export Citation Format

Share Document