Block Orthogonal Sparse Superposition Codes for L3 Communications: Low Error Rate, Low Latency, and Low Transmission Power

Donghwa Han;Bowhyung Lee;Min Jang;Donghun Lee;Seho Myung;Namyoon Lee
{"title":"Block Orthogonal Sparse Superposition Codes for L3 Communications: Low Error Rate, Low Latency, and Low Transmission Power","authors":"Donghwa Han;Bowhyung Lee;Min Jang;Donghun Lee;Seho Myung;Namyoon Lee","doi":"10.1109/JSAC.2025.3531569","DOIUrl":null,"url":null,"abstract":"Block Orthogonal Sparse Superposition (BOSS) codes are a promising class of joint coded modulation techniques that can closely approach the finite-blocklength capacity with low-complexity decoding at low code rates under Gaussian channels. However, in fading channels, the performance of BOSS codes degrades considerably due to varying channel fading effects on coded symbols. This paper presents a unified approach to extending BOSS codes to practical fading scenarios and introduces novel joint demodulation and decoding solutions. For fast-fading channels, we propose a minimum mean square error approximation maximum a posteriori (MMSE-A-MAP) algorithm that integrates demodulation and decoding when channel state information is available at the receiver (CSIR). Additionally, for block-fading channels without CSIR, we introduce a joint demodulation and decoding method, referred to as the non-coherent sphere decoding (NSD) algorithm. Simulation results demonstrate that BOSS codes with MMSE-A-MAP decoding outperform 5G polar codes, while the NSD algorithm achieves performance comparable to quasi-maximum likelihood decoding but with significantly reduced complexity. Both decoding methods can be implemented for parallel processing, allowing them to meet low-latency requirements. Furthermore, real-time simulations on a software-defined radio testbed validate the feasibility of using BOSS codes for low-power transmission.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":"43 4","pages":"1183-1199"},"PeriodicalIF":17.2000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10845812/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Block Orthogonal Sparse Superposition (BOSS) codes are a promising class of joint coded modulation techniques that can closely approach the finite-blocklength capacity with low-complexity decoding at low code rates under Gaussian channels. However, in fading channels, the performance of BOSS codes degrades considerably due to varying channel fading effects on coded symbols. This paper presents a unified approach to extending BOSS codes to practical fading scenarios and introduces novel joint demodulation and decoding solutions. For fast-fading channels, we propose a minimum mean square error approximation maximum a posteriori (MMSE-A-MAP) algorithm that integrates demodulation and decoding when channel state information is available at the receiver (CSIR). Additionally, for block-fading channels without CSIR, we introduce a joint demodulation and decoding method, referred to as the non-coherent sphere decoding (NSD) algorithm. Simulation results demonstrate that BOSS codes with MMSE-A-MAP decoding outperform 5G polar codes, while the NSD algorithm achieves performance comparable to quasi-maximum likelihood decoding but with significantly reduced complexity. Both decoding methods can be implemented for parallel processing, allowing them to meet low-latency requirements. Furthermore, real-time simulations on a software-defined radio testbed validate the feasibility of using BOSS codes for low-power transmission.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
块正交稀疏叠加码用于L3通信:低错误率,低延迟,低传输功率
分组正交稀疏叠加码(BOSS)是一种很有前途的联合编码调制技术,它能在高斯信道下以较低的码率和较低的解码复杂度接近有限块长度容量。然而,在衰落信道中,由于信道对编码符号的衰落影响不同,BOSS码的性能会显著下降。本文提出了一种将BOSS码扩展到实际衰落场景的统一方法,并介绍了新的联合解调和解码解决方案。对于快速衰落信道,我们提出了一种最小均方误差近似最大后验(MMSE-A-MAP)算法,当信道状态信息在接收器(CSIR)可用时,该算法集成了解调和解码。此外,对于没有CSIR的块衰落信道,我们引入了一种联合解调和解码方法,称为非相干球解码(NSD)算法。仿真结果表明,采用MMSE-A-MAP解码的BOSS码优于5G极化码,而NSD算法的性能与准最大似然解码相当,但显著降低了复杂度。这两种解码方法都可以实现并行处理,从而满足低延迟要求。此外,在软件无线电试验台上进行了实时仿真,验证了使用BOSS码进行低功率传输的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-User Covert ISAC Over Rician Fading Robust and Secure STAR-RIS-Assisted UAV Communications for Multi-User and Multi-Eavesdropper GNN-Based Secrecy Rate Optimization in Multi-Satellite Collaborative Systems Jamming Identification With Differential Transformer for Low-Altitude Wireless Networks Privacy-Aware Resource Collaboration for Secure UAV-Assisted Federated Edge Learning Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1