摘要
5G高可靠低时延(URLLC)场景和未来6G极高可靠极低时延(HRLLC)场景对于通信可靠性和时延等具有极其严格的需求,这给短码研究带来了新的机遇与挑战。该文聚焦于顺序统计译码(OSD),针对其重编码次数过多的问题,分别提出了基于软信息和额外校验的重编码跳过机制,并进一步提出了结合软信息和额外校验的联合跳过机制。具体地,基于软信息的跳过机制是根据当前列表中最优候选的软度量来判断是否跳过测试错误模式(TEP)的重编码;基于额外校验的跳过机制则是将TEP的搜索维度从k维扩展到k+δ维,从而引入额外的校验来跳过不合法TEP的重编码;联合跳过机制则将两者结合,先以软信息进行跳过判断,再通过额外校验进一步跳过非法TEP。数值结果显示,所提联合跳过机制可以有效减少重编码次数,并优于现有文献的跳过设计。特别地,所提联合跳过机制可以在中高信噪比区域将重编码次数从约670 000次降低至十余次,且几乎不损失纠错性能。
Objective Ultra-Reliable Low-Latency Communication(URLLC)in 5G and the emerging Hyper-Reliable Low-Latency Communication(HRLLC)in 6G impose exceptionally stringent requirements on both reliability and end-to-end delay.These requirements create opportunities and challenges for short-length channel codes,particularly in scenarios where Maximum-Likelihood(ML)or near-ML decoding is desirable but computational complexity and latency are prohibitive.Ordered Statistic Decoding(OSD)is a universal near-ML decoding technique that can closely approach finite-length performance bounds.However,its re-encoding step suffers from combinatorial explosion,resulting in impractical complexity in high-throughput and low-latency systems.The excessive number of Test-Error-Pattern(TEP)re-encodings fundamentally restricts the deployment of OSD in URLLC and HRLLC contexts.To address this bottleneck,we design multiple efficient skip mechanisms that substantially reduce re-encoding operations while maintaining negligible performance degradation.Methods Three complementary skipping mechanisms are developed to prune the OSD re-encoding search:(1)Soft-information based skipping.Two criteria are introduced-Trivial and Dynamic Approximate Ideal(DAI),to compare the soft metric of each TEP against the minimum soft weight in the current list.Candidates with excessively large soft weights,which are unlikely to be correct,are skipped.Unlike prior work that evaluates only the first TEP at each Hamming weight increment,both criteria are applied to every candidate.The Trivial criterion ensures no performance loss by skipping only when a TEP’s soft metric exceeds the bestsofar.The DAI criterion incorporates an expected residual soft-weight compensation term over non-basis bits,enabling more aggressive skipping with minimal performance degradation.(2)Extra-parity skipping.The search dimension is expanded from k to k+δ by appending theδmost reliable non-basis bit positions to the test vector.Additional parity checks arising from the extended generator matrix eliminate invalid TEPs.Any candidate failing these extra parity constraints is bypassed.(3)Joint skipping.This approach integrates the two preceding mechanisms.Each partial TEP(e_(L),e_(δ))∈FK+δ/2 is first tested using the DAI rule and then subjected to the extra-parity check.Only candidates passing both criteria are re-encoded.Results and Discussions Extensive simulations on extended BCH P[128,64]and BCH[127,64]codes over the BPSK-AWGN channel demonstrate the efficacy of the proposed skipping mechanisms.Soft-information skipping:When compared with conventional OSD using maximum flipping order T=4,the Trivial rule is found to reduce average re-encodings by 50%~90%across the SNR range.The DAI rule achieves an additional 60%~99%reduction beyond the Trivial rule.At SNR=3 dB,the average number of re-encodings decreases from approximately 6.7×10^(5)to 1.2×10^(3),with negligible degradation in Frame-Error Rate(FER)(Fig.1).Extra-parity skipping:Forδ=4,over 90%of re-encodings are eliminated uniformly across SNR values,thereby reducing dependence on channel conditions.This reduction is achieved without significant FER loss(Fig.2).Joint skipping:The combined mechanism demonstrates superior performance over individual schemes.It reduces average re-encodings by an additional about 40%compared with the DAI rule alone,and by more than 99.9%compared with extra-parity alone in high-SNR regimes.In this region,re-encodings decrease from~6.7×10^(5)to fewer than 100,while FER remains nearly identical to that of baseline OSD(Fig.3).The joint skipping mechanism is further evaluated on BCH codes with different rates,including[127,36],[127,64],and[127,92]In all cases,substantial reductions in re-encodings are consistently achieved with negligible performance degradation(Fig.4).A comparative analysis with state-of-the-art schemes-including Probabilistic Sufficient/Necessary Conditions(PSC/PNC),Fast OSD(FOSD),and Order-Skipping OSD(OS-OSD)-shows that the proposed joint skipping OSD withδ=4the lowest re-encoding count.Up to two orders of magnitude fewer re-encodings are observed relative to OS-OSD at low SNR,and superiority over FOSD is maintained at moderate SNR,while error-correction performance is preserved across all tested SNRs(Fig.5).Conclusions To address the stringent reliability and latency requirements of 5G URLLC and future 6G HRLLC,this work presents novel skipping mechanisms for OSD that substantially reduce re-encoding complexity.For offline pre-computed TEPs,the soft-information,extra-parity,and joint skipping rules eliminate more than 99%of redundant re-encodings in typical operating regimes with negligible degradation in Frame-Error Rate(FER).In particular,the proposed joint skipping mechanism lowers the average re-encoding count from approximately 6.7×10^(5)to only tens in the high-SNR region,thereby meeting practical latency constraints while preserving near-ML performance.These findings demonstrate the potential of the proposed skipping framework to enable high-performance short-block decoding in next-generation HRLLC.
作者
王千帆
郭延庚
宋林琦
马啸
WANG Qianfan;GUO Yangeng;SONG Linqi;MA Xiao(City University of Hong Kong,Hong Kong 999077,China;Shenzhen Research Institute City University of Hong Kong,Shenzhen 518000,China;School of Computer Science and Engineering,Sun Yat-sen University,Guangzhou 510006,China)
出处
《电子与信息学报》
北大核心
2025年第11期4275-4284,共10页
Journal of Electronics & Information Technology
基金
国家重点研发计划(2021YFA1000500)
国家自然科学基金(62301617,62371411,62471506)
广东省自然科学基金面上项目(2023A1515011056,2025A1515011650)
港澳“青年科技人才托举工程”项目(QT-2025-048)。
关键词
信道译码
顺序统计译码
跳过机制
额外校验
Channel decoding
Ordered Statistic Decoding(OSD)
Skipping mechanism
Extra-parity check
