Pith. sign in

REVIEW

Blind Multi-user Detection for Autonomous Grant-free High-Overloading MA without Reference Signal

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1712.02601 v1 pith:YRKLQM2O submitted 2017-12-07 cs.IT math.IT

Blind Multi-user Detection for Autonomous Grant-free High-Overloading MA without Reference Signal

classification cs.IT math.IT
keywords blindgrant-freeautonomousdetectioncodeframeworkhigh-overloadingmulti-user
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In this paper, a novel blind multi-user detection(MUD) framework for autonomous grant-free high-overloading non-orthogonal multiple access is introduced in detail aimed at fulfilling the requirements of fifth-generation massive Machine Type Communications. From the perspective of the transmitter side, pros and cons regarding diverse types of emerging grant-free transmission, particularly autonomous grant-free, are elaborated and presented in a comparative manner. In the receiver end,code word-level successive interference cancellation (CL-SIC) is revealed as the main framework to perform MUD. In addition, underpinning state-of-art blind ideas such as blind activation detection taking advantage of the statistical metric of the aggregate signals, blind equalization based on the constellation's simple geometric character of low order modulation symbols, and blind channel estimation employing solely the successfully decoded code words are explained.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.