Pith. sign in

REVIEW

Faster-than-Nyquist Asynchronous NOMA Outperforms Synchronous NOMA

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 2111.08258 v2 pith:WPS6UK64 submitted 2021-11-16 cs.IT math.IT

Faster-than-Nyquist Asynchronous NOMA Outperforms Synchronous NOMA

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

Faster-than-Nyquist (FTN) signaling aided non-orthogonal multiple access (NOMA) is conceived and its achievable rate is quantified in the presence of random link delays of the different users. We reveal that exploiting the link delays may potentially lead to a signal-to-interference-plus-noise ratio (SINR) gain, while transmitting the data symbols at FTN rates has the potential of increasing the degree-of-freedom (DoF). We then unveil the fundamental trade-off between the SINR and DoF. In particular, at a sufficiently high symbol rate, the SINR gain vanishes while the DoF gain achieves its maximum, where the achievable rate is almost $(1+\beta)$ times higher than that of the conventional synchronous NOMA transmission in the high signal-to-noise ratio (SNR) regime, with $\beta$ being the roll-off factor of the signaling pulse. Our simulation results verify our analysis and demonstrate considerable rate improvements over the conventional power-domain NOMA scheme.

discussion (0)

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