کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4966320 | 1448879 | 2017 | 5 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Reduced complexity and latency for a massive MIMO system using a parallel detection algorithm Reduced complexity and latency for a massive MIMO system using a parallel detection algorithm](/preview/png/4966320.png)
In recent years, massive MIMO systems have been widely researched to realize high-speed data transmission. Since massive MIMO systems use a large number of antennas, these systems require huge complexity to detect the signal. In this paper, we propose a novel detection method for massive MIMO using parallel detection with maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) to reduce the complexity and latency. The proposed scheme obtains an R matrix after permutation of an H matrix and QR decomposition. The R matrix is also eliminated using a Gauss-Jordan elimination method. By using a modified R matrix, the proposed method can detect the transmitted signal using parallel detection. From the simulation results, the proposed scheme can achieve a reduced complexity and latency with a little degradation of the bit error rate (BER) performance compared with the conventional method.
Journal: ICT Express - Volume 3, Issue 3, September 2017, Pages 119-123