检索结果-内蒙古大学图书馆

IEEE International Conference on Communications (ICC)

作者： Wang, Fei Jiao, Jian Zhang, Ke Wu, Shaohua Li, Yonghui Zhang, Qinyu Harbin Inst Technol Shenzhen Commun Engn Res Ctr Shenzhen 518055 Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China Univ Sydney Sydney NSW Australia

ISBN: (纸本)9781728171227

Short length channel coding and low complexity decoding is essential for 5G ultra-reliable low latency communications (uRLLC). In this paper, au efficient ordered statistics decoder (E-OSD) scheme is proposed for finite length non-binary Raptor code (NBRC) towards uRLLC. The segmentation and discarding rules of test error patterns, and the stop criteria are designed for the proposed E-OSD scheme to reduce the decoding complexity. A block error rate (BLER) upper bound of the NBRC under OSD is derived to estimate the number of NBRC symbols required for achieving the desired BLER performance. Simulation results show that the complexity of the proposed E-OSD scheme is greatly reduced compared to the existing OSD schemes, and it can achieve the BLER lower than 10(-5) in the finite length regime (<256 bits), satisfying the requirements of uRLLC.

关键词： uRLLC finite length non-binary Raptor codes ordered statistics decoder

来源：评论

学校读者我要写书评

暂无评论

Finite Length Non-binary Raptor Codes under ordered statistics decoder 92

Finite Length Non-binary Raptor Codes under Ordered Statisti...

引用

92nd IEEE Vehicular Technology Conference (IEEE VTC-Fall)

作者： Wang, Fei Jiao, Jian Li, Lianqin Zhang, Ke Wu, Shaohua Zhang, Qinyu Harbin Inst Technol Shenzhen Commun Engn Res Ctr Shenzhen 518055 Guangdong Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China

ISBN: (纸本)9781728194844

Raptor codes can approach the capacity of erasure channel without accurate channel state information at the transmitter side, which is viewed as a potential channel coding approach to meet stringent requirements of ultra-reliable low latency communications (uRLLC) (block error rate (BLER) <= 10(-5), and end-to-end latency <= 1 ms). This letter investigates a modified ordered statistics decoder (mOSD) algorithm for finite length non-binary Raptor code towards uRLLC. The upper bound of BLER for the non-binary Raptor code under OSD is derived, which can estimate the required block length under certain reliability requirement. Simulation results show that the BLER can be lower than 10 in the finite length regime (<256 bits), which can satisfy the ultra-high reliability requirement of uRLLC. In addition, the binary operation per bit of the nonbinary Raptor codes under mOSD is less than 12000 with the BLER <= 10(-5), which is reduced by up to 50% of the average decoding complexity than the conventional OSD.

关键词： uRLLC finite length non-binary Raptor codes ordered statistics decoder

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Finite Length Non-Binary Raptor Codes under ordered statistics decoder 90

Performance Analysis of Finite Length Non-Binary Raptor Code...

引用

90th IEEE Vehicular Technology Conference (IEEE VTC-Fall)

作者： Li, Lianqin Zhang, Ke Jiao, Jian Sun, Yunyu Wu, Shaohua Wang, Ye Zhang, Qinyu Harbin Inst Technol Shenzhen Commun Engn Res Ctr Shenzhen 518055 Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China

ISBN: (纸本)9781728112206

Raptor code is the current standard of 4G long term evolution (LTE) evolved multimedia broadcast and multi-cast services (eMBMS), which is viewed as a potential approach in the design of ultra-reliable low latency communications (uRLLC) for 5G. This paper analyzes the performance of finite length non-binary (over finite field of order q, GF(q)) Raptor codes under ordered statistics decoder (OSD) towards uRLLC, where the non-binary Raptor code ensembles by a non-binary low density parity-check (LDPC) code as pre-code and a non-binary inner Luby transform (LT) code. Moreover, by investigating the property of code structure and decoding algorithm, an upper bound of decoding failure probability (DFP) of finite length non-binary Raptor code under OSD is derived. Simulation results validate the accuracy of our derived upper bound, and demonstrate that our non-binary Raptor codes can achieve 10(-5) DFP with block length 128 bits at SNR 3.6 dB.

关键词： Non-binary Raptor codes finite length ordered statistics decoder decoding failure probability upper bound

来源：评论

学校读者我要写书评

暂无评论

Synodic Period Channel Modeling and Coding Scheme for Deep Space Optical Communications

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2024年第2期60卷 2364-2378页

作者： Zhang, Yaosheng Jiao, Jian Zhang, Ke Wang, Ye Lu, Rongxing Zhang, Qinyu Harbin Inst Technol Guangdong Prov Key Lab Aerosp Commun & Networking Shenzhen 518055 Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada

In this article, we design an end-to-end free-space optical (FSO) communication coding scheme for deep space exploration. Take the Mars exploration as an example, we first establish the synodic period FSO channel model by taking into account the solar scintillation, and derive the corresponding upper bound of bit error rate (BER) for $L$-ary pulse position modulation (LPPM). Then, we propose a staircase code-ordered statistics decoder (SC-OSD) algorithm for staircase low density parity check (LDPC) codes under synodic period FSO channel, and derive the probability density function (PDF) and Gaussian approximation of the ordered statistics of the SC-OSD algorithm, which provide a guideline to derive a lower bound of block error rate (BLER) and reduce the decoding complexity of SC-OSD. Furthermore, we propose a soft OSD-sliding window decoding (SOSD-SWD) algorithm for staircase LDPC codes under scintillation states to address the error floor problem in conventional SWD decoder. Simulation results validate that the proposed SOSD-SWD algorithm can achieve much lower BER than the related algorithms in all scintillation conditions, and shed light to tradeoff the achievable BER and complexities under different scintillation conditions.

关键词： Parity check codes Deep-space communications Sun Encoding Maximum likelihood decoding Earth Complexity theory Channel modeling deep space optical communications ordered statistics decoder sliding window decoding staircase low density parity check (LDPC) codes

来源：评论

学校读者我要写书评

暂无评论

A Novel Ultra-Reliable decoder of Short Rate-Compatible Codes for Mission Critical Communications

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第12期73卷 19780-19784页

作者： Zhang, Ke Li, Chunjie Jiao, Jian Wang, Ye Ma, Xiao Zhang, Qinyu Pengcheng Lab Shenzhen 518055 Peoples R China Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Harbin Inst Technol Shenzhen Guangdong Prov Key Lab Aerosp Commun & Networking Shenzhen 518055 Peoples R China

In this correspondence, towards the ultra-reliable low-latency requirements of mission critical communications (MCC) in autonomous driving, we design a novel ordered likelihood decoder (OLD) for short rate-compatible (RC) codes. Based on the linear approximation of ordered reliability sequence, we model the probability of test error patterns (TEPs) to the flipping weight (FW), which only corresponds to the flipped positions of most reliable basis (MRB). Then, an integer partitions-aided TEPs generating criterion (GC) is proposed to generate the ordered TEPs in near-optimal. Further, by combining the weighted Hamming distance (WHD) estimation and the proposed TEPs GC, a stopping criterion is given to terminate the decoding when the most likely TEP is found. Comparing to the existing ordered statistics decoders (OSD) for RC coding schemes, simulation results show that the proposed OLD can achieve superior performance in terms of error-rate performance and decoding complexity.

关键词： Reliability Maximum likelihood decoding Encoding Complexity theory Mission critical systems Linear approximation Hamming weight ordered statistics decoder rate-compatible (RC) test error patterns probability flipping weight error-rate performance

来源：评论

学校读者我要写书评

暂无评论

Low-Latency Communication with Computational Complexity Constraints 16

Low-Latency Communication with Computational Complexity Cons...

引用

16th International Symposium on Wireless Communication Systems (ISWCS)

作者： Celebi, Hasan Basri Pitarokoilis, Antonios Skoglund, Mikael KTH Royal Inst Technol Sch Elect Engn & Comp Sci Stockholm Sweden

ISBN: (纸本)9781728125275

Low-latency communication is one of the most important application scenarios in next-generation wireless networks. Often in communication-theoretic studies latency is defined as the time required for the transmission of a packet over a channel. However, with very stringent latency requirements and complexity constrained receivers, the time required for the decoding of the packet cannot be ignored and must be included in the total latency analysis through accurate modeling. In this paper, we first present a way to calculate decoding time using per bit complexity metric and introduce an empirical model that accurately describes the trade-off between the decoding complexity versus the performance of state-of-the-art codes. By considering various communication parameters, we show that including the decoding time in latency analyses has a significant effect on the optimum selection of parameters.

关键词： Low-complexity receivers low-latency IoT channel coding ordered statistics decoder

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：