Wen, Haifeng and Liu, Zilong and Luo, Qu and Shi, Chuang and Xiao, Pei (2022) Designing Enhanced Multidimensional Constellations for Code-Domain NOMA. IEEE Wireless Communications Letters, 11 (10). pp. 2130-2134. DOI https://doi.org/10.1109/lwc.2022.3194604
Wen, Haifeng and Liu, Zilong and Luo, Qu and Shi, Chuang and Xiao, Pei (2022) Designing Enhanced Multidimensional Constellations for Code-Domain NOMA. IEEE Wireless Communications Letters, 11 (10). pp. 2130-2134. DOI https://doi.org/10.1109/lwc.2022.3194604
Wen, Haifeng and Liu, Zilong and Luo, Qu and Shi, Chuang and Xiao, Pei (2022) Designing Enhanced Multidimensional Constellations for Code-Domain NOMA. IEEE Wireless Communications Letters, 11 (10). pp. 2130-2134. DOI https://doi.org/10.1109/lwc.2022.3194604
Abstract
This letter 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.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Multi-dimensional (MD) constellation; code-domain non-orthogonal multiple access (CD-NOMA); sparse code multiple access (SCMA); convex-concave procedure (CCCP); minimum Euclidean distance; minimum product distance |
Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
Depositing User: | Unnamed user with email elements@essex.ac.uk |
Date Deposited: | 18 Jan 2023 14:30 |
Last Modified: | 30 Oct 2024 20:51 |
URI: | http://repository.essex.ac.uk/id/eprint/34571 |
Available files
Filename: 2112.02537.pdf