scholarly journals A Robust Hybrid Iterative Linear Detector for Massive MIMO Uplink Systems

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 306 ◽  
Author(s):  
Mahmoud A. Albreem ◽  
Mohammed H. Alsharif ◽  
Sunghwan Kim
Keyword(s):  
Computational Complexity ◽  
Convergence Rate ◽  
Massive Mimo ◽  
High Performance ◽  
Large Scale ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Initial Vector ◽  
High Data

Fifth-generation (5G) communications system is commercially introduced by several mobile operators where sub-6 GHz bands are the backbone of the 5G networks. A large-scale multiple-input multiple-output (MIMO), or massive MIMO (mMIMO), technology has a major impact to secure high data rate, high spectral efficiency, and quality of service (QoS). It could also have a major role in the beyond-5G systems. A massive number of antennas seek advanced signal processing to detect and equalize the signal. However, optimal detectors, such as the maximum likelihood (ML) and maximum posterior (MAP), are not desirable in implementation due to extremely high complexity. Therefore, sub-optimum solutions have been introduced to obtain and guarantee enough balance between the performance and the computational complexity. In this paper, a robust and joint low complexity detection algorithm is proposed based on the Jacobi (JA) and Gauss–Seidel (GS) methods. In such iterative methods, the performance, complexity, and convergence rate are highly dependent on the initial vector. In this paper, initial solution is proposed by exploiting the benefits of a stair matrix to obtain a fast convergence rate, high performance, and low complexity. Numerical results show that proposed algorithm achieves high accuracy and relieve the computational complexity even when the BS-to-user-antenna ratio (BUAR) is small.

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 Hardware Implementation and Performance Analysis of Improved Sphere Decoder in Spatially Correlated Massive MIMO Channels

2021 ◽  
Author(s):  
Dimitris Vordonis ◽  
Vassilis Paliouras
Keyword(s):  
Massive Mimo ◽  
Large Scale ◽  
Hardware Implementation ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Mimo Channels ◽  
Sphere Decoder ◽  
Trade Offs ◽  
Simulation Results ◽  
The Impact

Detection for high-dimensional multiple-input multiple-output (MIMO) and massive MIMO (MMIMO) systems is an active field of research in wireless communications. While most works consider spatially uncorrelated channels, practical MMIMO channels are correlated. This paper investigates the impact of correlation on Sphere Decoder (SD), for both single-user (SU) and multi-user (MU) scenarios. The complexity of SD is mainly determined by the initial radius (IR) method and the number of visited nodes during detection. This paper employs an efficient IR and proposes a new metric constraint in the tree searching algorithm, that significantly decrease the number of visited nodes and render SD feasible for large-scale systems. In addition, an introduced hardware implementation featured with a one-node-per-cycle architecture, minimizes the latency of the detection process. Trade-offs between bit error rate (BER) performance and computational complexity are presented. The trade-offs are achieved by either modifying the backtracking mechanism or limiting the number of radius updates. Simulation results prove that the proposed optimizations are effective for both correlated and uncorrelated channels, regardless of the level of noise. The decoding gain of SD compared to the low-complexity linear detectors (LD) is higher in the presence of correlation than in the uncorrelated case. However, as expected, spatial correlation adversely affects the performance and the complexity of SD. Simulation results reported here also confirm that correlation at the side equipped with more antennas is less detrimental. Hardware implementation aspects are examined for both a Virtex-7 FPGA device and a 28-nm ASIC technology.<br>

scholarly journals Hardware Implementation and Performance Analysis of Improved Sphere Decoder in spatially correlated Massive MIMO channels

2021 ◽  
Author(s):  
Dimitris Vordonis ◽  
Vassilis Paliouras
Keyword(s):  
Massive Mimo ◽  
Large Scale ◽  
Hardware Implementation ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Mimo Channels ◽  
Sphere Decoder ◽  
Trade Offs ◽  
Simulation Results ◽  
The Impact

<div>Detection for high-dimensional multiple-input multiple-output (MIMO) and Massive MIMO (MMIMO) systems is an active field of research in wireless communications. While most works consider spatially uncorrelated channels, practical MMIMO channels are correlated. This paper investigates the impact of correlation on Sphere Decoder (SD), not only for Single-User (SU) but also for Multi-User (MU) scenarios. The complexity of SD is mainly determined by the Initial Radius (IR) method and the number of visited nodes during detection. This paper proposes both an efficient IR and a new metric constraint in the tree searching algorithm, that significantly decrease the number of visited nodes and render SD feasible for large-scale systems. In addition, a hardware implementation featured with a one-node-per-cycle architecture, minimizes the latency of the detection process. Trade-offs between bit error rate (BER) performance and computational complexity are presented, either modifying the backtracking mechanism or limiting the number of radius updates. Simulation results prove that the proposed optimizations are effective for both correlated and uncorrelated channels, regardless the level of noise. The decoding gain of SD compared to the low-complexity Linear Detectors (LD) is higher in the presence of correlation than in the uncorrelated case. However, as expected, spatial correlation adversely affects the performance and the complexity of SD. Simulation results reported here also confirm that correlation at the side equipped with more antennas is less detrimental. Hardware aspects are examined for both a Virtex-7 FPGA device and a 28-nm ASIC technology.</div>

scholarly journals Low Complexity, Pairwise Layered Tabu Search for Large Scale MIMO Detection

2021 ◽  
Author(s):  
SOURAV CHAKRABORTY ◽  
Nirmalendu Bikas Sinha ◽  
Monojit Mitra
Keyword(s):  
Tabu Search ◽  
Upper Bound ◽  
Large Scale ◽  
Complexity Analysis ◽  
Mimo System ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Detection Performance ◽  
Mimo Detection

Abstract This paper presents a low complexity pairwise layered tabu search (PLTS) based detection algorithm for a large-scale multiple-input multiple-output (MIMO) system. The proposed algorithm can compute two layers simultaneously and reduce the effective number of tabu searches. A metric update strategy is developed to reuse the computations from past visited layers. Also, a precomputation technique is adapted to reduce the redundancy in computation within tabu search iterations. Complexity analysis shows that the upper bound of initialization complexity in the proposed algorithm reduces from O(Nt4) to O(Nt3). The detection performance of the proposed detector is almost the same as the conventional complex version of LTS for 64QAM and 16QAM modulations. However, the proposed detector outperforms the conventional system for 4QAM modulation, especially in 16x16 and 8x8 MIMO. Simulation results show that the per cent of complexity reduction in the proposed method is approximately 75% for 64x64, 64QAM and 85% for 64x64 16QAM systems to achieve a BER of 10-3. Moreover, we have proposed a layer-dependent iteration number that can further reduce the upper bound of complexity with minor degradation in detection performance.

scholarly journals Low-Complexity Transmit Antenna Selection in Large-Scale Spatial Modulation Systems

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Peng Wei ◽  
Lu Yin ◽  
Yue Xiao ◽  
Xu He ◽  
Shaoqian Li
Keyword(s):  
Computational Complexity ◽  
System Performance ◽  
Large Scale ◽  
Antenna Selection ◽  
Mimo System ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Spatial Modulation ◽  
Transmit Antenna Selection ◽  
Input Multiple Output

Transmit antenna selection (TAS) is an efficient way for improving the system performance of spatial modulation (SM) systems. However, in the case of large-scale multiple-input multiple-output (MIMO) configuration, the computational complexity of TAS in large-scale SM will be extremely high, which prohibits the application of TAS-SM in a real large-scale MIMO system for future 5G wireless communications. For solving this problem, in this paper, two novel low-complexity TAS schemes, named as norm-angle guided subset division (NAG-SD) and threshold-based NAG-SD ones, are proposed to offer a better tradeoff between computational complexity and system performance. Simulation results show that the proposed schemes can achieve better performance than traditional TAS schemes, while effectively reducing the computational complexity in large-scale spatial modulation systems.

scholarly journals Hardware Implementation and Performance Analysis of Improved Sphere Decoder in spatially correlated Massive MIMO channels

2021 ◽  
Author(s):  
Dimitris Vordonis ◽  
Vassilis Paliouras
Keyword(s):  
Massive Mimo ◽  
Large Scale ◽  
Hardware Implementation ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Mimo Channels ◽  
Sphere Decoder ◽  
Trade Offs ◽  
Simulation Results ◽  
The Impact

<div>Detection for high-dimensional multiple-input multiple-output (MIMO) and Massive MIMO (MMIMO) systems is an active field of research in wireless communications. While most works consider spatially uncorrelated channels, practical MMIMO channels are correlated. This paper investigates the impact of correlation on Sphere Decoder (SD), not only for Single-User (SU) but also for Multi-User (MU) scenarios. The complexity of SD is mainly determined by the Initial Radius (IR) method and the number of visited nodes during detection. This paper proposes both an efficient IR and a new metric constraint in the tree searching algorithm, that significantly decrease the number of visited nodes and render SD feasible for large-scale systems. In addition, a hardware implementation featured with a one-node-per-cycle architecture, minimizes the latency of the detection process. Trade-offs between bit error rate (BER) performance and computational complexity are presented, either modifying the backtracking mechanism or limiting the number of radius updates. Simulation results prove that the proposed optimizations are effective for both correlated and uncorrelated channels, regardless the level of noise. The decoding gain of SD compared to the low-complexity Linear Detectors (LD) is higher in the presence of correlation than in the uncorrelated case. However, as expected, spatial correlation adversely affects the performance and the complexity of SD. Simulation results reported here also confirm that correlation at the side equipped with more antennas is less detrimental. Hardware aspects are examined for both a Virtex-7 FPGA device and a 28-nm ASIC technology.</div>

scholarly journals Low Complexity Angular-Domain Detection for the Uplink of Multi-User mmWave Massive MIMO Systems

Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 795
Author(s):  
Xiaoxuan Xia ◽  
Wence Zhang ◽  
Yinkai Fu ◽  
Xu Bao ◽  
Jing Xia
Keyword(s):  
Energy Efficiency ◽  
Computational Complexity ◽  
Massive Mimo ◽  
Communication Systems ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Digital Processing ◽  
Low Complexity ◽  
Angular Domain

To compromise between the system performance and hardware cost, millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems have been regarded as an enabling technology for the fifth generation of mobile communication systems (5G). This paper considers a low-complexity angular-domain compressing based detection (ACD) for uplink multi-user mmWave massive MIMO systems, which involves hybrid analog and digital processing. In analog processing, we perform angular-domain compression on the received signal by exploiting the sparsity of the mmWave channel to reduce the dimension of the signal space. In digital processing, the proposed ACD scheme works well with zero forcing (ZF)/maximum ratio combining (MRC)/minimum mean square error (MMSE) detection schemes. The performance analysis of the proposed ACD scheme is provided in terms of achievable rates, energy efficiency and computational complexity. Simulations are carried out and it shows that compared with existing works, the proposed ACD scheme not only reduces the computational complexity by more than 50 % , but also improves the system’s achievable rates and energy efficiency.

scholarly journals Improved QRD-M Detection Algorithm for Generalized Spatial Modulation Scheme

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Xiaorong Jing ◽  
Mingyue Wang ◽  
Wei Zhou ◽  
Hongqing Liu
Keyword(s):  
Computational Complexity ◽  
Maximum Likelihood ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Spatial Modulation ◽  
Modulation Scheme ◽  
Transmission Scheme ◽  
Imperfect Detection ◽  
Input Multiple Output

Generalized spatial modulation (GSM) is a spectral and energy efficient multiple-input multiple-output (MIMO) transmission scheme. It will lead to imperfect detection performance with relatively high computational complexity by directly applying the original QR-decomposition with M algorithm (QRD-M) to the GSM scheme. In this paper an improved QRD-M algorithm is proposed for GSM signal detection, which achieves near-optimal performance but with relatively low complexity. Based on the QRD, the improved algorithm firstly transforms the maximum likelihood (ML) detection of the GSM signals into searching an inverted tree structure. Then, in the searching process of the M branches, the branches corresponding to the illegitimate transmit antenna combinations (TACs) and related to invalid number of active antennas are cut in order to improve the validity of the resultant branches at each level by taking advantage of characteristics of GSM signals. Simulation results show that the improved QRD-M detection algorithm provides similar performance to maximum likelihood (ML) with the reduced computational complexity compared to the original QRD-M algorithm, and the optimal value of parameter M of the improved QRD-M algorithm for detection of the GSM scheme is equal to modulation order plus one.

scholarly journals Robust Hybrid Beamforming Scheme for Millimeter-Wave Massive-MIMO 5G Wireless Networks

Symmetry ◽  
2019 ◽  
Vol 11 (11) ◽  
pp. 1424 ◽  
Author(s):  
Saleem Latteef Mohammed ◽  
Mohammed H. Alsharif ◽  
Sadik Kamel Gharghan ◽  
Imran Khan ◽  
Mahmoud Albreem
Keyword(s):  
Wireless Networks ◽  
Millimeter Wave ◽  
Massive Mimo ◽  
Large Scale ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Network Capacity ◽  
System Throughput ◽  
Hybrid Beamforming

Wireless networks employing millimeter-wave (mmWave) and Massive Multiple-Input Multiple-Output (MIMO) technologies are a key approach to boost network capacity, coverage, and quality of service (QoS) for future communications. They deploy symmetric antennas on a large scale in order to enhance the system throughput and data rate. However, increasing the number of antennas and Radio Frequency (RF) chains results in high computational complexity and more energy requirements. Therefore, to solve these problems, this paper proposes a low-complexity hybrid beamforming scheme for mmWave Massive-MIMO 5G wireless networks. The proposed algorithm is on the basis of alternating the minimum mean square error (Alt-MMSE) hybrid beamforming technique in which the orthogonal properties of the digital matrix were designed, and then the MSE of the transmitted and received signal was reduced. The phase of the analog matrix was obtained from the updated digital matrix. Simulation results showed that the proposed hybrid beamforming algorithm had better performance than existing state-of-the-art algorithms, and similar performance with the optimal digital precoding algorithm.

scholarly journals Improved Massive MIMO RZF Precoding Algorithm Based on Truncated Kapteyn Series Expansion

Information ◽  
2019 ◽  
Vol 10 (4) ◽  
pp. 136 ◽  
Author(s):  
Xiaomei Xue ◽  
Zhengquan Li ◽  
Yongqiang Man ◽  
Song Xing ◽  
Yang Liu ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Series Expansion ◽  
Large Scale ◽  
Mimo System ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Inverse Matrix ◽  
Achievable Rate ◽  
Input Multiple Output ◽  
Kapteyn Series

In order to reduce the computational complexity of the inverse matrix in the regularized zero-forcing (RZF) precoding algorithm, this paper expands and approximates the inverse matrix based on the truncated Kapteyn series expansion and the corresponding low-complexity RZF precoding algorithm is obtained. In addition, the expansion coefficients of the truncated Kapteyn series in our proposed algorithm are optimized, leading to further improvement of the convergence speed of the precoding algorithm under the premise of the same computational complexity as the traditional RZF precoding. Moreover, the computational complexity and the downlink channel performance in terms of the average achievable rate of the proposed RZF precoding algorithm and other RZF precoding algorithms with typical truncated series expansion approaches are analyzed, and further evaluated by numerical simulations in a large-scale single-cell multiple-input-multiple-output (MIMO) system. Simulation results show that the proposed improved RZF precoding algorithm based on the truncated Kapteyn series expansion performs better than other compared algorithms while keeping low computational complexity.

Sign in / Sign up

Export Citation Format

Share Document