Machine-to-Machine (M2M) communications will be playing an important role in the development of 5th generation (5G) and future wireless communication systems. Due to the sporadic nature of massive access, Low-Activity Code Division Multiple Access (LA-CDMA) is one of possible multiple access schemes for M2M communications. In the literature, maximum a posterior (MAP) detector has been proposed to detect the active users when the user activity factor is known and small. However, the user activity factor is usually unknown and could be large in practice, which makes the multiuser detection (MUD) a challenging task for LA-CDMA. In this paper, we first introduce sparse Bayesian learning (SBL) method to recover the transmitted signals for LA- CDMA uplink access. The proposed method exploits the sparsity of the transmitted signals and does not require the knowledge of user activity. Furthermore, we add on the known finite-alphabet constraints and introduce Gaussian mixture model (GMM) method to obtain the transmitted signals. Simulation results have shown that the proposed methods outperform the conventional algorithms.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Bayesian Inference Algorithms for Multiuser Detection in M2M Communications


    Contributors:


    Publication date :

    2016-09-01


    Size :

    337808 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Multiuser Diversity Scheduling in Free-Space Optical Communications

    Abouei, J. / Plataniotis, K. N. | British Library Online Contents | 2012


    Bayesian inference for automotive applications

    Fatemi, Maryam / Chalmers tekniska högskola | TIBKAT | 2016


    Multiuser Diversity Scheduling in Free-Space Optical Communications

    Abouei, J. / Plataniotis, K.N. | British Library Online Contents | 2012


    Bayesian Inference of GNSS Failures

    Carl Milner | Online Contents | 2016