Novel User Scheduling Schemes Based on Nonlinear Precoding for Multiuser MIMO Systems

2012 ◽  
Vol 195-196 ◽  
pp. 270-276 ◽  
Author(s):  
Cun Yi Zhang ◽  
Mu Qing Wu ◽  
Run Qian Chen ◽  
Guo Dong Ma

This paper proposes a novel greedy user ordering algorithm for the multiuser multiple-input multiple-output (MIMO) systems employing block diagonal geometric mean decomposition method and Tomlinson-Harashima precoding (THP). Theoretical analysis and computer simulations illustrate its low computation complexity relative to the optimal user ordering achieving by brute search over all the possible ordering permutations resulting in extremely high computation complexity. Meanwhile the bit error rate (BER) performance of the proposed algorithm is very close to the optimal user ordering. Moreover, in order to mitigate the impact of users with smaller sub-channel gains to the whole systems BER performance, a joint pre-processing scheme design of adaptive data streams reduction and greedy user ordering (ADSR-GUO) is proposed. By means of choosing different values for the controlling factor, we can obtain different system sum-rate and BER performance to satisfy different quality-of-service (QoS) requirements.

2020 ◽  
Author(s):  
Arthur Sousa de Sena ◽  
Pedro Nardelli

This paper addresses multi-user multi-cluster massive multiple-input-multiple-output (MIMO) systems with non-orthogonal multiple access (NOMA). Assuming the downlink mode, and taking into consideration the impact of imperfect successive interference cancellation (SIC), an in-depth analytical analysis is carried out, in which closed-form expressions for the outage probability and ergodic rates are derived. Subsequently, the power allocation coefficients of users within each sub-group are optimized to maximize fairness. The considered power optimization is simplified to a convex problem, which makes it possible to obtain the optimal solution via Karush-Kuhn-Tucker (KKT) conditions. Based on the achieved solution, we propose an iterative algorithm to provide fairness also among different sub-groups. Simulation results alongside with insightful discussions are provided to investigate the impact of imperfect SIC and demonstrate the fairness superiority of the proposed dynamic power allocation policies. For example, our results show that if the residual error propagation levels are high, the employment of orthogonal multiple access (OMA) is always preferable than NOMA. It is also shown that the proposed power allocation outperforms conventional massive MIMO-NOMA setups operating with fixed power allocation strategies in terms of outage probability.


Author(s):  
Layak Ali Sd ◽  
K. Kishan Rao ◽  
M. Sushanth Bab

In this papers an efficient ordering scheme for an ordered successive interference cancellation detector is determined under the bit error rate minimization criterion for multiple-input multiple-output(MIMO) communication systems using transmission power control. From the convexity of the Q-function, we evaluate the choice of suitable quantization characteristics for both the decoder messages and the received samples in Low Density Parity Check (LDPC)-coded systems using M-QAM schemes. We derive the ordering strategy that makes the channel gains converge to their geometric mean. Based on this approach, the fixed ordering algorithm is first designed, for which the geometric mean is used for a constant threshold using correlation among ordering results.


2010 ◽  
Vol 8 ◽  
pp. 81-85 ◽  
Author(s):  
P. Beinschob ◽  
U. Zölzer

Abstract. In search for faster and more reliable communication, multiple-input multiple-output (MIMO) in conjuction with Orthogonal Frequency Division Multiplexing (OFDM) are subject of extensive research. In spatial multiplexing transmission an instantaneous rise of data rates governed by the number of transmit antennas can be realised. The system performance depends highly on signal-to-interference-plus-noise ratios (SINR) at the receiver. The receiver's equaliser is supposed to maximize the SINR by mitigating the spatial interference and thus separating the transmitted signals. For this problem several solutions exist such as linear and nonlinear, per subcarrier or OFDM symbol-based. An overview of common algorithms is given and complexity is discussed. Bit error rate (BER) performance evaluations are presented. Another aspect is the impact of the equalisation strategy on the performance of bit-interleaved soft information-based channel coding schemes. As a representative, LDPC codes are chosen. Simulation results show a significant BER performance loss for symbol decision-based equalisers compared to the uncoded performance. To overcome this problem a modification of the Maximum Likelihood algorithm is proposed which yields good performance for low SNR applications.


Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 71 ◽  
Author(s):  
Mahmoud A. Albreem ◽  
Mohammed H. Alsharif ◽  
Sunghwan Kim

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.


Author(s):  
Robin Chataut ◽  
Robert Akl

The global bandwidth shortage in the wireless communication sector has motivated the study and exploration of wireless access technology known as massive Multiple-Input Multiple-Output (MIMO). Massive MIMO is one of the key enabling technology for next-generation networks, which groups together antennas at both transmitter and the receiver to provide high spectral and energy efficiency using relatively simple processing. Obtaining a better understating of the massive MIMO system to overcome the fundamental issues such as pilot contamination, channel estimation, precoding, user scheduling, energy efficiency, and signal detection is vital for the successful deployment of 5G and beyond networks. Some of the recent trends in massive MIMO are terahertz communication, ultra massive MIMO (UM-MIMO), visible light communication (VLC), machine learning, and deep learning. 


Author(s):  
Thanh-Binh Nguyen ◽  
Minh-Tuan Le ◽  
Vu-Duc Ngo ◽  
Tien-Dong Nguyen ◽  
Huy-Dung Han

In Multiple Input Multiple Output (MIMO) systems, the complexities of detectors depend on the size of the channel matrix. In Massive MIMO systems, detection complexity becomes remarkably higher because the dimensions of the channel matrix get much larger. In order to recover the signals in the up-link of a Massive MIMO system at reduced complexities, we first divide the system into two sub-systems. After that, we apply the Minimum Mean Square Error (MMSE) and Bell Laboratory Layer Space Time (BLAST) detectors to each subsystem, resulting in the so-called MMSE-GD and BLAST-GD detectors, respectively. To further enhance the BER performance of Massive MIMO systems under the high-load conditions, we propose two additional detectors, called MMSE-IGD and BLAST-IGD by respectively applying the conventional MMSE and BLAST on the sub-systems in an iterative manner. It is shown via computer simulation and analytical results that the proposed detectors enable the system to achieve not only higher BER performance but also low detection complexities as compared to the conventional linear detectors. Moreover, the MMSE-IGD and BLAST-IGD can significantly improve BER performance of Massive MIMO systems.


Wireless technologies are aiming to improve data rates along with reliability using Multiple Input and Multiple Output(MIMO) systems. The major performance parameter for advanced systems is Bit Error rate (BER). Researchers are working for minimizing the BER for data communication. This paper presents the BER performance of turbo coded Multiple Input Multiple Output (MIMO) system in Nakagami channel. MIMO system is realized using Space Time Block Codes. System performance is analyzed for M-ary Quadrature Amplitude Modulation (QAM) in Nakagami channel. System is implemented using MATLAB code. 4QAM system performs better as far as BER is concerned. The implemented turbo coded system outperforms the uncoded system in case of BER performance. This system can be used for improved performance of data communication in LTE and WiMax.


2020 ◽  
Author(s):  
Arthur Sousa de Sena ◽  
Pedro Nardelli

This paper addresses multi-user multi-cluster massive multiple-input-multiple-output (MIMO) systems with non-orthogonal multiple access (NOMA). Assuming the downlink mode, and taking into consideration the impact of imperfect successive interference cancellation (SIC), an in-depth analytical analysis is carried out, in which closed-form expressions for the outage probability and ergodic rates are derived. Subsequently, the power allocation coefficients of users within each sub-group are optimized to maximize fairness. The considered power optimization is simplified to a convex problem, which makes it possible to obtain the optimal solution via Karush-Kuhn-Tucker (KKT) conditions. Based on the achieved solution, we propose an iterative algorithm to provide fairness also among different sub-groups. Simulation results alongside with insightful discussions are provided to investigate the impact of imperfect SIC and demonstrate the fairness superiority of the proposed dynamic power allocation policies. For example, our results show that if the residual error propagation levels are high, the employment of orthogonal multiple access (OMA) is always preferable than NOMA. It is also shown that the proposed power allocation outperforms conventional massive MIMO-NOMA setups operating with fixed power allocation strategies in terms of outage probability.


Author(s):  
Rong Ran ◽  
Hayoung Oh

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.


Sign in / Sign up

Export Citation Format

Share Document