Pith. sign in

REVIEW

Designing Enhanced Multi-dimensional Constellations for Code-Domain 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 2112.02537 v2 pith:ZTV2CHTD submitted 2021-12-05 cs.IT math.IT

Designing Enhanced Multi-dimensional Constellations for Code-Domain NOMA

classification cs.IT math.IT
keywords constellationsperformanceaccesschannelscode-domaindistanceenhancederror
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper presents an enhanced design of multi-dimensional (MD) constellations which play a pivotal role in many communication systems such as code-domain non-orthogonal multiple access (CD-NOMA). MD constellations are attractive as their structural properties, if properly designed, lead to signal space diversity and hence improved error rate performance. Unlike the existing works which mostly focus on MD constellations with large minimum Euclidean distance (MED), we look for new MD constellations with additional feature that the minimum product distance (MPD) is also large. To this end, a non-convex optimization problem is formulated and then solved by the convex-concave procedure (CCCP). Compared with the state-of-the-art literature, our proposed MD constellations lead to significant error performance enhancement over Rayleigh fading channels whilst maintaining almost the same performance over the Gaussian channels. To demonstrate their application, we also show that these MD constellations give rise to good codebooks in sparse code multiple access systems. All the obtained MD constellations can be found in https://github.com/Aureliano1/Multi-dimensional-constellation.

discussion (0)

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