2020
DOI: 10.48550/arxiv.2006.06917
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Massive Coded-NOMA for Low-Capacity Channels: A Low-Complexity Recursive Approach

Abstract: In this paper, we present a low-complexity recursive approach for massive and scalable code-domain nonorthogonal multiple access (NOMA) with applications to emerging lowcapacity scenarios. The problem definition in this paper is

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 35 publications
(94 reference statements)
0
2
0
Order By: Relevance
“…2) Decoding Procedure: The recursive structure of polar codes can be applied for low-complexity detection/decoding of real-valued data using parallel processing for more speedups [62], [63]. To this end, one can apply the decoding algorithms in [35] for polar-coded computing.…”
Section: Polar-coded Distributed Computationmentioning
confidence: 99%
“…2) Decoding Procedure: The recursive structure of polar codes can be applied for low-complexity detection/decoding of real-valued data using parallel processing for more speedups [62], [63]. To this end, one can apply the decoding algorithms in [35] for polar-coded computing.…”
Section: Polar-coded Distributed Computationmentioning
confidence: 99%
“…(3.351.3)], and [34,Eq. (4.358.1)] to solve the integrals involved in ( 29), (30), and (31), respectively.…”
Section: Theorem 5 the Ergodic Capacity E[r Ab ] Of The Alice-bob Lin...mentioning
confidence: 99%