Systems Engineering and Electronics ›› 2022, Vol. 44 ›› Issue (9): 2955-2962.doi: 10.12305/j.issn.1001-506X.2022.09.31

• Communications and Networks • Previous Articles     Next Articles

Gradient pursuit multi-user detection algorithm based on time correlation

Fang JIANG1,2, Yaqing YANG1, Guoliang ZHENG1, Yi WANG1,2, Yaohua XU1,2,*, Xiangqing WU1   

  1. 1. Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education, Anhui University Hefei 230601, China
    2. Anhui Internet of Things Spectrum Sensing and Testing Engineering Technology Research Center, Hefei 230601, China
  • Received:2021-09-16 Online:2022-09-01 Published:2022-09-09
  • Contact: Yaohua XU

Abstract:

To reduce the complexity of multi-user detection at the base station in massive machine type communication, the correlation of active devices in adjacent slots and the gradient pursuit algorithm are used to propose a correlation-assisted gradient pursuit multi-user detection (CAGP-MUD) algorithm. The CAGP-MUD algorithm not only avoids the process of matrix inversion, but also reduces the number of iterations of other slots except the first slot. To reduce the multi-user detection complexity even further, the idea of stage wise weak is introduced into the framework of the CAGP-MUD algorithm, and a correlation-assisted group gradient pursuit multi-user detection algorithm is proposed. This algorithm uses the weakening of the maximum gradient as a threshold to select multiple active devices in each iteration, so that the iteration number can be reduced. Theoretical analysis and experimental results show that, compared with similar algorithms, the computational cost of these two algorithms is reduced by more than 60%.

Key words: massive machine type communication, time correlation, gradient pursuit, multi-user detection

CLC Number: 

[an error occurred while processing this directive]