A novel superposition coding scheme based on polar code for multi-user detection in underwater acoustic OFDM communication system

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-10-02 DOI:10.1002/cpe.8296
Wen Meiqi, Xing Siyu, Wei Bo, Yu Yanting
{"title":"A novel superposition coding scheme based on polar code for multi-user detection in underwater acoustic OFDM communication system","authors":"Wen Meiqi,&nbsp;Xing Siyu,&nbsp;Wei Bo,&nbsp;Yu Yanting","doi":"10.1002/cpe.8296","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Superposition coding (SC) is a non-orthogonal multiple access (NOMA) scheme for the downlink communication system, which allows signals of different users to be stacked and forwarded simultaneously in the same frequency band. The codeword for each user is assigned a different weight at the transmitter to avoid signal conflicts and interference after stacking, and successive interference cancellation (SIC) is adopted to decode. A novel SC scheme based on polar code, suitable for the downlink multi-user underwater acoustic (UWA) communication system using orthogonal frequency division multiplexing (OFDM), is proposed in this paper. Polar code is utilized to create a nested code structure that is divided into several subsets. We exploit this feature of the polar codes and assign each subset to the corresponding user in the channel coding process. The information bits are placed on the independent subset for each user, and the random bits are placed on the subset of other users while all the users share the same set of frozen bits. Then, the codewords are stacked with different weights. The selection range of power factors can be expanded through the double superposition of the coding and the power domains, and higher system throughput and fairness can be achieved. The simulation and tank experiment results significantly verify the effectiveness of the proposed scheme, making it most suitable for the downlink UWA multi-user communication systems.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8296","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Superposition coding (SC) is a non-orthogonal multiple access (NOMA) scheme for the downlink communication system, which allows signals of different users to be stacked and forwarded simultaneously in the same frequency band. The codeword for each user is assigned a different weight at the transmitter to avoid signal conflicts and interference after stacking, and successive interference cancellation (SIC) is adopted to decode. A novel SC scheme based on polar code, suitable for the downlink multi-user underwater acoustic (UWA) communication system using orthogonal frequency division multiplexing (OFDM), is proposed in this paper. Polar code is utilized to create a nested code structure that is divided into several subsets. We exploit this feature of the polar codes and assign each subset to the corresponding user in the channel coding process. The information bits are placed on the independent subset for each user, and the random bits are placed on the subset of other users while all the users share the same set of frozen bits. Then, the codewords are stacked with different weights. The selection range of power factors can be expanded through the double superposition of the coding and the power domains, and higher system throughput and fairness can be achieved. The simulation and tank experiment results significantly verify the effectiveness of the proposed scheme, making it most suitable for the downlink UWA multi-user communication systems.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于极性码的新型叠加编码方案,用于水下声学 OFDM 通信系统中的多用户检测
叠加编码(SC)是一种用于下行链路通信系统的非正交多址(NOMA)方案,它允许不同用户的信号在同一频段内叠加并同时转发。每个用户的码字在发射器被赋予不同的权重,以避免堆叠后的信号冲突和干扰,并采用连续干扰消除(SIC)进行解码。本文提出了一种基于极性码的新型 SC 方案,适用于使用正交频分复用(OFDM)技术的下行多用户水下声学(UWA)通信系统。极地编码被用来创建一个嵌套编码结构,该结构被分为多个子集。我们利用极地编码的这一特点,在信道编码过程中将每个子集分配给相应的用户。信息比特放在每个用户的独立子集上,随机比特放在其他用户的子集上,而所有用户共享同一组冻结比特。然后,用不同的权重堆叠编码词。通过编码域和功率域的双重叠加,可以扩大功率因数的选择范围,实现更高的系统吞吐量和公平性。仿真和坦克实验结果极大地验证了所提方案的有效性,使其最适用于下行 UWA 多用户通信系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
A Dynamic Energy-Efficient Scheduling Method for Periodic Workflows Based on Collaboration of Edge-Cloud Computing Resources An Innovative Performance Assessment Method for Increasing the Efficiency of AODV Routing Protocol in VANETs Through Colored Timed Petri Nets YOLOv8-ESW: An Improved Oncomelania hupensis Detection Model Three Party Post Quantum Secure Lattice Based Construction of Authenticated Key Establishment Protocol for Mobile Communication Unstructured Text Data Security Attribute Mining Method Based on Multi-Model Collaboration
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1