{"title":"基于唯一可分解星座群的改进SCMA码本设计","authors":"Linxuan Chen;Xuewan Zhang;Chunying Pu;Pengxue Liu","doi":"10.23919/JCN.2025.000035","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an improved uniquely decomposable constellation group (I-UDCG) for codebook design of sparse code multiple access (SCMA) systems, which guarantees that the superimposed constellation of SCMA codebooks on each mapping resource satisfies the uniquely decomposable constraint. We optimize the bit error rate (BER) performance of the I-UDCG-based SCMA codebooks from two perspectives. One is to maximize the coding gain of the superimposed constellation of the I-UDCG, using the error probability bound (EPB) as the optimization criterion. The EPB is determined by a threshold distance rather than the minimum Euclidean distance (MED) among constellation points. The other approach focuses on maximizing the MED among the codebook's codewords to enlarge the coding gain of SCMA codebooks, thereby improving the BER performance of SCMA systems. Simulation results show that the two optimization methods can enhance the BER performance of SCMA. In particular, the first optimization method performs better in scenarios involving both small-size and large-size codebooks. Compared to other codebook design schemes, our proposal can exhibit strong anti-noise and antifading abilities for various codebook sizes.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 3","pages":"136-146"},"PeriodicalIF":3.2000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106346","citationCount":"0","resultStr":"{\"title\":\"An improved SCMA codebook design based on uniquely decomposable constellation groups\",\"authors\":\"Linxuan Chen;Xuewan Zhang;Chunying Pu;Pengxue Liu\",\"doi\":\"10.23919/JCN.2025.000035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an improved uniquely decomposable constellation group (I-UDCG) for codebook design of sparse code multiple access (SCMA) systems, which guarantees that the superimposed constellation of SCMA codebooks on each mapping resource satisfies the uniquely decomposable constraint. We optimize the bit error rate (BER) performance of the I-UDCG-based SCMA codebooks from two perspectives. One is to maximize the coding gain of the superimposed constellation of the I-UDCG, using the error probability bound (EPB) as the optimization criterion. The EPB is determined by a threshold distance rather than the minimum Euclidean distance (MED) among constellation points. The other approach focuses on maximizing the MED among the codebook's codewords to enlarge the coding gain of SCMA codebooks, thereby improving the BER performance of SCMA systems. Simulation results show that the two optimization methods can enhance the BER performance of SCMA. In particular, the first optimization method performs better in scenarios involving both small-size and large-size codebooks. Compared to other codebook design schemes, our proposal can exhibit strong anti-noise and antifading abilities for various codebook sizes.\",\"PeriodicalId\":54864,\"journal\":{\"name\":\"Journal of Communications and Networks\",\"volume\":\"27 3\",\"pages\":\"136-146\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2025-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106346\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Communications and Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11106346/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11106346/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
摘要
本文针对稀疏码多址(SCMA)系统的码本设计,提出了一种改进的唯一可分解星座群(I-UDCG),保证了每个映射资源上的SCMA码本叠加星座满足唯一可分解约束。我们从两个角度优化了基于i - udcg的SCMA码本的误码率(BER)性能。一是利用误差概率界(error probability bound, EPB)作为优化准则,使I-UDCG叠加星座的编码增益最大化。EPB由星座点间的阈值距离而不是最小欧几里得距离(MED)来确定。另一种方法侧重于最大化码本码字间的MED,以增大码本的编码增益,从而提高码本系统的误码率性能。仿真结果表明,这两种优化方法都能提高系统的误码率。特别是,第一种优化方法在涉及小尺寸和大尺寸代码本的场景中表现更好。与其他码本设计方案相比,我们的方案在各种码本尺寸下都具有较强的抗噪声和抗衰落能力。
An improved SCMA codebook design based on uniquely decomposable constellation groups
In this paper, we propose an improved uniquely decomposable constellation group (I-UDCG) for codebook design of sparse code multiple access (SCMA) systems, which guarantees that the superimposed constellation of SCMA codebooks on each mapping resource satisfies the uniquely decomposable constraint. We optimize the bit error rate (BER) performance of the I-UDCG-based SCMA codebooks from two perspectives. One is to maximize the coding gain of the superimposed constellation of the I-UDCG, using the error probability bound (EPB) as the optimization criterion. The EPB is determined by a threshold distance rather than the minimum Euclidean distance (MED) among constellation points. The other approach focuses on maximizing the MED among the codebook's codewords to enlarge the coding gain of SCMA codebooks, thereby improving the BER performance of SCMA systems. Simulation results show that the two optimization methods can enhance the BER performance of SCMA. In particular, the first optimization method performs better in scenarios involving both small-size and large-size codebooks. Compared to other codebook design schemes, our proposal can exhibit strong anti-noise and antifading abilities for various codebook sizes.
期刊介绍:
The JOURNAL OF COMMUNICATIONS AND NETWORKS is published six times per year, and is committed to publishing high-quality papers that advance the state-of-the-art and practical applications of communications and information networks. Theoretical research contributions presenting new techniques, concepts, or analyses, applied contributions reporting on experiences and experiments, and tutorial expositions of permanent reference value are welcome. The subjects covered by this journal include all topics in communication theory and techniques, communication systems, and information networks. COMMUNICATION THEORY AND SYSTEMS WIRELESS COMMUNICATIONS NETWORKS AND SERVICES.