Abstract
In this work, we present a joint channel estimation, activity detection and data decoding scheme for massive machine-type communications. By including the channel and the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a priori</i> activity factor in the factor graph, we present the bilinear message-scheduling GAMP (BiMSGAMP), a message-passing solution that uses the channel decoder beliefs to refine the activity detection and data decoding. We include two message-scheduling strategies based on the residual belief propagation (RBP) and the activity user detection (AUD) in which messages are evaluated and scheduled in every new iteration. An analysis of the convergence of BiMSGAMP along with a study of its computational complexity is carried out. Numerical results show that BiMSGAMP outperforms state-of-the-art algorithms, highlighting the gains achieved by using the dynamic scheduling strategies and the effects of the channel decoding part in the system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
