A Symmetric Successive Overrelaxation (SSOR) based Gauss-Seidel Massive MIMO Detection Algorithm

The scaling up of antennae and terminals in large-scale multiple-input multiple-output (MIMO) systems helps increase the spectral efficiency at the penalty of prohibitive computational complexity. In conventional linear detection such as the minimum mean square error (MMSE) signal detection, the high complexity is mainly caused by solving the inversion of random matrix, especially in large-scale MIMO systems. In order to reduce the complexity of the matrix inversion, we proposed a low-complexity MMSE detection scheme based on symmetric successive over relaxation (SSOR) method, referred to as MSSD method. The proposed method exploits the channel hardening phenomenon, which means the off-diagonal terms of the HHH matrix become increasingly weaker compared to the diagonal terms as the size of the channel gain matrix H increases. In addition, we point out that the channel estimation scheme used in channel hardening-exploiting message passing receiver (CHEMP) is very suitable for the MSSD algorithm. For the considered large MIMO settings, simulation results show that the performance of the MSSD algorithm is very close to the classical MMSE detection algorithm with a small number of iterations.

Minimum mean square error (MMSE) linear detector has been considered as one of the potential detection algorithm for uplink multi-user massive MIMO systems, because it can achieve the near-optimal bit error rate (BER) performance. However, it involves matrix inversion with high complexity. Thus, the conventional Gauss-Seidel (GS) method has been applied for obtain a low-complexity MMSE detector without employing the computationally intensive matrix inversion. In this paper, we propose a refinement for the conventional GS method based on band matrix concept in order to accelerate the convergence rate, that means reduce the number of iterations and consequently the complexity, guaranteeing the near-optimal BER performance. Analytical and numerical results show the efficiency of the proposed method in comparison to the conventional GS method.

In orthogonal frequency-division multiplexing (OFDM) systems, it is generally assumed that the channel response is static in an OFDM symbol period. However, the assumption does not hold in high-mobility environments. As a result, intercarrier interference (ICI) is induced and the system performance is degraded. A simple remedy for this problem is the application of the zero-forcing (ZF) and minimum mean square error (MMSE) equalizers. Unfortunately, the direct ZF method requires the inversion of an NxN ICI matrix, where N is the number of subcarriers. When N is large, the computational complexity can become prohibitively high. As for the direct MMSE method, in addition to an NxN matrix inverse, it requires an extra NxN matrix multiplication, making the required computational complexity higher compared to the direct ZF method. In this dissertation, we first propose a low-complexity ZF method to solve the problem in single-input-single-output (SISO) OFDM systems. The main idea is to explore the special structure inherent in the ICI matrix and to apply Newton's iteration for matrix inversion. With our formulation, fast Fourier transforms (FFTs) can be used in the iterative process, reducing the complexity from O(N^3) to O(Nlog_2 N) . Also, the required number of the iteration is typically one or two. We also analyze the convergence behavior of the proposed method and derive the theoretical output signal-to-interference-noise-ratio (SINR). For the MMSE method, we first reformulate the MMSE solution in a way that the extra matrix multiplication can be avoided. Similar to the ZF method, we then exploit the structure of the ICI matrix and apply Newton's iteration to reduce the complexity of the matrix inversion. For a multiple-input-multiple-output (MIMO) OFDM system, the required complexity of the ZF and MMSE methods becomes more intractable. We then manage to extend the proposed ZF and MMSE methods for SISO-OFDM systems to MIMO-OFDM systems. It turns out that the computational complexity can be reduced even more significantly. Simulation results show that the performance of the proposed methods is almost as good as that of the direct ZF and MMSE methods, while the required computational complexity is reduced dramatically. Finally, we explore the application of the proposed methods in mobility-induced ICI mitigation for OFDM multiple access (OFDMA) systems, and in carrier frequency offset (CFO) induced ICI mitigation for OFDMA uplink systems. As that in OFDM systems, the proposed methods can reduce the required computational complexity, effectively.

For large-scale multiple-input multiple-output (MIMO) systems, linear minimum mean square error (MMSE) method is one of the most near-optimal ways for signal detection. However, MMSE involves matrix inversion which is of high complexity for computation. In this paper, a Lanczos-based method is proposed to solve the problem by transferring the matrix inversion computation into an iteration process of solving a linear equation. The simulation result proves that the BER of Lanczos-based method outperforms the recently proposed Neumann series approximation algorithm with the same SNR. At the same time, the Lanczos-based method could reduce the computational complexity from O(K3) to O(K2), where K is the number of users. Then the convergence speed is analysed by Kaniel-Paige-Saad theory. Finally, the result shows that the performance of Lanczos-based method achieves the classical MMSE exact matrix inversion methods with only a small number of iterations.

We generalize the multiuser (CDMA spread spectrum) communication systems to the fading environments. We first extend Verdu's (1986) conventional optimum receiver to Rayleigh-fading environments and then evaluate its performance. Having no knowledge of the received power at the receiving end, we therefore need an estimator to efficiently estimate the received signal strength of each user in fading environments. A linear minimum mean square error (LMMSE) unbiased estimator is proposed to attain this goal. By using the minimum mean square error (MMSE) Bayesian estimation, we further propose the LMMSE bit estimator for efficient demodulation. Its performance is close to the optimum multiuser receiver but with a much simpler polynomial complexity. To further reduce the complexity, we extend the LMMSE estimator to the sequential LMMSE estimator. In sequential estimation, we do not need to implement the matched filter banks and to perform the matrix inversion when estimating. In addition, it converges after approximately 2k iterations, where k is the number of users. With this fast convergence property and the simple structure, the sequential LMMSE estimator provides an attractive alternative to the implementation of a multiuser system.

In present days, there has been a race among the communication systems in different schemes and generations. Gradually the transmission rate of data is increasing tremendously and breaking the previous generation's record. Now people are thinking of transmitting data beyond imagination. Using multiple antennas both at transmitter and receiver side, MIMO wireless technology efficiently provides very high spectral efficiency, boost the data transmission rate, enhance link reliability and improve system coverage. While transmitting data over mobile radio channels at high bit rates, the impulse response of the channel can be extended over a lot of symbol periods, leading fading and Inter-symbol interference (lSI). Equalizers are used to minimize Fading and interference effects. The analysis of the paper is studying the performance of Minimum mean square error method in terms of BER for MIMO (2×2) and (3×3) wireless channels. Binary Phase Shift Keying (BPSK) modulation technique was used in Rayleigh flat fading channel. Simulating in MATLAB results show that Minimum mean square error (MMSE) receivers is good for noise free channel and is successful in removing ISI. Successive interference method with optimal ordering outperforms the MMSE however a few problems arise because of iterative nature of the algorithm.

In this paper, an improved and low-complexity signal detection approach for large-scale multiple-input multiple-output (MIMO) systems has been proposed. This approach utilizes the preconditioning technique to accelerate the conventional detection algorithm based on Gauss-Seidel (GS) iterative method, and achieves a detection performance close to the minimum mean square error (MMSE) detection algorithm with relatively small iteration counts. It also outperforms the counterparts based on the Neumann series (NS) expansion and the conjugate gradient (CG) method in poor propagation environments, such as MIMO systems with large loading or correlated factors. The corresponding architecture is also proposed with both novelty and scalability. It takes advantage of the cyclic-shift property of the GS method, and therefore facilitates the hardware implementation. Both numerical results and complexity analysis demonstrate that the proposed detector is efficient and suitable for large-scale MIMO systems.

Multiple-input multiple-output (MIMO) systems can achieve high data-rate and high capacity transmission. In MIMO systems, the scheme that weight substreams based on minimum mean square error (MMSE) criterion at the transmitter using feedback channel state information (CSI) achieves good performance (denoted hereafter as MMSE precoder). However, if the optimum number of substreams is not selected based on CSI and methods for reducing the performance degradation due to feedback delay is not used, MMSE precoder cannot achieve the full performance possible. In this paper, we propose an MMSE precoder with mode selection for MIMO systems, which selects both the number of substreams and the modulation scheme for each substream to minimize the average BER at a fixed rate. We evaluate the BER of the proposed MMSE precoder with two methods for reducing performance degradation due to feedback delay, channel prediction and receive weight robust to feedback delay. We also evaluate the BER of the proposed MMSE precoder with the method that combines channel prediction with receive weight robust to feedback delay. Simulation results show that the BER of the proposed MMSE precoder is improved compared to that of the conventional MMSE precoder using the fixed number of substreams. We also show that the method that combines channel prediction with receive weight robust to feedback delay can achieve good BER even when the large feedback delay exists.

In this paper, the minimum mean square error (MSE) convergence of the RBF equalizer is evaluated and compared with the linear equalizer based on the theoretical minimum MSE. The basic idea of comparing these two equalizers comes from the fact that the relationship between the hidden and output layers in the RBF equalizer is also linear. As extensive studies of this research, various channel models are selected, which include linearly separable channel, slightly distorted channel, and severely distorted channel models. The theoretical minimum MSE for both RBF and linear equalizers were computed, compared and the sensitivity of minimum MSE due to RBF center spreads was analyzed.

The initial solution of a massive multiple-input multiple-output (M-MIMO) detector for uplink (UL) is greatly influence the balance between the bit error rate (BER) performance and the computational complexity. Although the maximum likelihood (ML) detector obtains the best BER performance, it has an extremely high computational complexity. Iterative linear minimum mean square error (MMSE) detector based on the Gauss–Seidel (GS), the successive over-relaxation (SOR), and the Jacobi (JA), obtains a good performance-complexity profile when the base station (BS)-to-user-antenna-ratio (BUAR) is large. However, when the BUAR is small, the system suffers from a considerable performance loss. In this paper, a hybrid detector based on the joint GS and SOR methods is proposed where the initial solution is determined by the first iteration of GS method. Numerical results show a considerable complexity reduction and performance enhancement using the proposed GS-SOR method over all methods when the BUAR is small.

MMSE detection method in uplink massive MIMO systems based on quantum computing

For multi-user uplink massive multiple input multiple output (MIMO) systems, minimum mean square error (MMSE) criterion-based linear signal detection algorithm achieves nearly optimal performance, on condition that the number of antennas at the base station is asymptotically large. However, it involves prohibitively high complexity in matrix inversion when the number of users is getting large. A low-complexity soft-output signal detection algorithm based on improved Kaczmarz method is proposed in this paper, which circumvents the matrix inversion operation and thus reduces the complexity by an order of magnitude. Meanwhile, an optimal relaxation parameter is introduced to further accelerate the convergence speed of the proposed algorithm and two approximate methods of calculating the log-likelihood ratios (LLRs) for channel decoding are obtained as well. Analysis and simulations verify that the proposed algorithm outperforms various typical low-complexity signal detection algorithms. The proposed algorithm converges rapidly and achieves its performance quite close to that of the MMSE algorithm with only a small number of iterations.

In this paper, we propose a joint channel estimation and symbol detection (JCESD) algorithm relying on message-passing algorithms (MPA) for orthogonal frequency division multiple access (OFDMA) systems. The channel estimation and symbol detection leverage the framework of expectation propagation (EP) and belief propagation (BP) with the aid of Gaussian approximation, respectively. Furthermore, to reduce the computation complexity involved in channel estimation, the matrix inversion is transformed into a series of diagonal matrix inversions through the Sherman-Morrison formula. Simulation experiments show that the proposed algorithm can reduce the pilot overhead by about 50%, compared with the traditional linear minimum mean square error (LMMSE) algorithm, and can approach to the bit error rate (BER) performance bound of perfectly known channel state information within 0.1 dB.

For the code division multiple access (CDMA) downlink channel, the chip-level equalization has been considered in this paper. There is no interference after despreading if all spreading codes are orthogonal, as in IS-95. However, it cannot be true for a frequency-selective fading channel. In this case, the chip-level equalization can be applied to restore the orthogonality. We investigate the chip-level equalization using finite impulse response (FIR) equalizers for the mobile station with multiple receive antennas. A blind approach and the minimum mean square error (MMSE) approach with code-multiplexed pilot are considered. A generalized MMSE equalization, which combines the MMSE and blind approaches together, is also investigated. It is shown that the generalized MMSE equalizer can effectively increase the number of samples to track the variation of channel and thereby performs better when the coherence time is small. In addition, we derive closed-form solutions of the blind, MMSE, and generalized MMSE equalizers for given channels.

Multiple user satellites monitor is an important technology which can improve both the monitoring network coverage and the capacity of multi-target signal processing. Multi user detection (MUD) is one of the key technology for multiple user satellites communication. In this paper, a new algorithm for MUD is implemented on field-programmable gate array (FPGA). This FPGA design is based on the minimum mean square error (MMSE) algorithm which consists of two main components: Matched filter and minimum mean square error matrix. Additionally, in order to conduct Monte Carlo simulation, we adopt a way which based on Mat lab, UART and FPGA platform.