Intelligent conventional and proposed hybrid 5G detection techniques

In recent years, Multiple Inputs and Multiple Outputs (MIMO) have gained significant attention due to their characteristics such as spectral gain, high throughput, and energy efficient. It is seen as one of the integral parts and backbone of the Fifth Generation (5G) and beyond 5G (B5G). However, th...

Full description

Saved in:
Bibliographic Details
Published inAlexandria engineering journal Vol. 61; no. 12; pp. 10485 - 10494
Main Authors Kumar, Arun, Chakravarty, Sumit, Suganya, S., Sharma, Himanshu, Pareek, Rajneesh, Masud, Mehedi, Aljahdali, Sultan
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.12.2022
Elsevier
Subjects
Online AccessGet full text
ISSN1110-0168
2090-2670
DOI10.1016/j.aej.2022.04.002

Cover

More Information
Summary:In recent years, Multiple Inputs and Multiple Outputs (MIMO) have gained significant attention due to their characteristics such as spectral gain, high throughput, and energy efficient. It is seen as one of the integral parts and backbone of the Fifth Generation (5G) and beyond 5G (B5G). However, the use of a large number of antennas requires complex algorithms to detect the received signal. Though, several detection methods have been proposed which can efficiently enhance the Bit Error Rate (BER) gain of the framework, it also increases the computational complexity. The proposed article introduces a hybrid algorithm for different sizes of MIMO. The hybrid algorithm is designed by combining QR Decomposition M−algorithm−Maximum Likelihood Detection (QRM-MLD) and Beam Forming (BF). Further, we compare the performance of proposed hybrid algorithms with that of conventional algorithms, namely Zero Forcing (ZF), Minimum Mean Square Error (MMSE), Successive over Relaxation (SOR), Gauss Seidel Detector (GSD), Jacobi Scheme (JS), and Approximate Message Passing (AMP). In computer simulation, it is noted that the proposed algorithm outperforms the conventional detection algorithms with minimum computational complexity.
ISSN:1110-0168
2090-2670
DOI:10.1016/j.aej.2022.04.002