Structured Sparsity Learning Based Multiuser Detection in Massive-Device Multiple Access

In this work, we study the non-time-slotted massive-device multiple access (MaDMA) problem where massive user devices transmit sporadic data to a multi-antenna base station (BS). We develop a structured sparsity learning based multiuser detection (SSL-MUD) scheme. By exploiting the structured sparsi...

Full description

Saved in:
Bibliographic Details
Main Authors: Tian Ding, Xiaojun Yuan, Soung Chang Liew
Format: Conference Proceeding
Language:English
Subjects:
Antennas
Approximation algorithms
Channel estimation
Decoding
Message passing
Multiuser detection
Random variables
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work, we study the non-time-slotted massive-device multiple access (MaDMA) problem where massive user devices transmit sporadic data to a multi-antenna base station (BS). We develop a structured sparsity learning based multiuser detection (SSL-MUD) scheme. By exploiting the structured sparsity naturally embedded in user signals, our SSL-MUD scheme is able to blindly detect the user packets without any prior knowledge of the user activity state (UAS) and the channel state information (CSI), and hence significantly reduces the transmission overhead. For the blind signal detection at the BS, we put forth the turbo bilinear generalized approximate message passing (Turbo-BiG-AMP) algorithm. Simulation results demonstrate that the Turbo-BiG- AMP algorithm significantly outperforms the existing compressed sensing based approach and achieves a performance comparable to that of the oracle linear minimum mean-square error (Oracle- LMMSE) algorithm (which assumes perfect knowledge of UAS and CSI at the BS).
ISSN:2576-6813
DOI:10.1109/GLOCOM.2018.8648017