A great amount of endeavour has recently been devoted to the joint device activity detection and channel estimation problem in massive machine-type communications. This paper targets at two practical issues along this line that have not been addressed before: asynchronous transmission from uncoordinated users and efficient algorithms for real-time implementation in systems with a massive number of devices. Specifically, this paper considers a practical system where the preamble sent by each active device is delayed by some unknown number of symbols due to the lack of coordination. We manage to cast the problem of detecting the active devices and estimating their delay and channels into a group LASSO problem. Then, a block coordinate descent algorithm is proposed to solve this problem globally, where the closed-form solution is available when updating each block of variables with the other blocks of variables being fixed, thanks to the special structure of our interested problem. Our analysis shows that the overall complexity of the proposed algorithm is low, making it suitable for real-time application.
翻译:最近,在大规模机器型通信中,对联合装置活动探测和频道估算问题投入了大量精力,本文针对这一行的两个实际问题提出了以前没有解决过的目标:未经协调的用户的无节奏传输和在大量装置的系统中实时实施系统的有效算法。具体地说,本文件审议了一个实际的系统,由于缺乏协调,每个活动装置发送的序言因一些未知的符号被延迟。我们设法将探测活动装置的问题和估计其延迟和通道的问题投放到一个LASSO集团的问题中。然后,提出了一个块协调的下降算法,以解决全球范围的问题,因为由于我们感兴趣的问题的特殊结构,每个区块变量与其他变量块的固定,在更新时都可以找到封闭式解决办法。我们的分析表明,拟议的算法的总体复杂性很低,因此适合实时应用。