A Survey of Key Techniques in Ordered Statistics Decoding (OSD) for Ultra-Reliable Low-Latency Communications

WANG Qianfan; GUO Yangeng; BI Sheng; WANG Yiwen; SONG Linqi; MA Xiao

doi:10.12263/DZXB.20251062

您当前的位置：

首页 >

文章列表页 >

A Survey of Key Techniques in Ordered Statistics Decoding (OSD) for Ultra-Reliable Low-Latency Communications

SURVEY AND REVIEW | 更新时间：2026-04-29

- A Survey of Key Techniques in Ordered Statistics Decoding (OSD) for Ultra-Reliable Low-Latency Communications
- ACTA ELECTRONICA SINICA Vol. 54, Issue 1, Pages: 466-478(2026)
- 作者机构：
  
  1.香港城市大学，香港 999077
  2.中山大学计算机学院，广东广州 510006
  3.华南理工大学，广东广州 510006
  4.香港城市大学深圳研究院，广东深圳 518000
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of china(62301617;62471506;62371411);Guangdong Basic and Applied Basic Research Foundation(2025A1515011650);Young Talent Support Project of Guangzhou Association for Scienceand Technology(QT-2025-048);the Guangdong Provincial Quantum Science Strategic Initiative(GDZX2503001);Hong Kong SAR Research Grants Council’s General Research Fund(11217823)
- DOI：10.12263/DZXB.20251062
  CLC： TN911.22;TP301.6
- Received：16 December 2025，
  
  Accepted：13 January 2026，
  
  Published：25 January 2026
- 稿件说明：
移动端阅览
王千帆, 郭延庚, 毕胜, 等. 面向高可靠低时延通信的顺序统计译码（OSD）关键技术综述[J]. 电子学报, 2026, 54(01): 466-478.

WANG Qianfan, GUO Yangeng, BI Sheng, et al. A Survey of Key Techniques in Ordered Statistics Decoding (OSD) for Ultra-Reliable Low-Latency Communications[J]. Acta Electronica Sinica, 2026, 54(01): 466-478.
王千帆, 郭延庚, 毕胜, 等. 面向高可靠低时延通信的顺序统计译码（OSD）关键技术综述[J]. 电子学报, 2026, 54(01): 466-478. DOI：10.12263/DZXB.20251062

WANG Qianfan, GUO Yangeng, BI Sheng, et al. A Survey of Key Techniques in Ordered Statistics Decoding (OSD) for Ultra-Reliable Low-Latency Communications[J]. Acta Electronica Sinica, 2026, 54(01): 466-478. DOI：10.12263/DZXB.20251062

摘要

高可靠低时延通信（Ultra-Reliable Low-Latency Communication，URLLC）是5G的三大核心场景之一，其增强版本极高可靠极低时延通信（Hyper-Reliable Low-Latency Communication，HRLLC）场景也已成为6G六大场景之一。高可靠低时延类通信场景对传输时延与可靠性提出了极致要求，这为短码编译码技术带来了新的机遇与挑战。顺序统计译码（Ordered Statistics Decoding，OSD）是一种近似最大似然（Near-Maximum-Likelihood，Near-ML）译码性能的通用短码译码算法，其在该类场景中具有重要潜力，但过高的计算复杂度严重制约了OSD算法的实际应用。本文系统综述了OSD算法中测试错误模式（Test Error Pattern，TEP）在测试顺序、跳过机制与提前终止策略等方面的代表性成果和最新研究进展，并对未来潜在研究方向进行了总结展望。具体地，首先讨论了汉明重量顺序、软重量顺序及基于有序可靠位的逻辑重量顺序对译码性能与复杂度的影响，指出逻辑权重顺序可以获得可靠性和实现复杂度间的有效折中。其次，分类总结了几种跳过与终止机制，阐明其基本思想是通过动态软信息判断或概率决策来降低冗余重编码次数。进一步，重点探讨了基于软度量和基于额外校验的TEP生成、跳过、终止机制及其联合设计，表明此类方法通过结构性约束与混合判断策略，在几乎不损失误帧率的前提下，将平均重编码次数降低1~2个数量级。数值结果显示，对于BCH（B

ose-Chaudhuri-Hocquenghem）码

<math id="M1"><mo stretchy="false">[</mo><mn mathvariant="normal">127

64</mn><mo stretchy="false">]</mo></math>

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013931&type=

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013906&type=

10.15999985

2.87866688

，联合跳过机制在信噪比为

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013933&type=

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013932&type=

6.01133299

2.37066650

处仅需十余次重编码，较原始OSD可减少超过

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013926&type=

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013935&type=

5.84200001

2.28600001

的计算开销。最后，本文指出OSD在非二进制编码、时变信道适应性及硬件实现等方面仍面临挑战，尤其是对于码长更长的中码率区域，并展望了针对OSD算法的未来研究方向。

Abstract

Ultra-reliable low-latency communications (URLLC) is one

of the three key scenarios in 5G

and its enhanced form

hyper-reliability low-latency communications (HRLLC)

has been proposed as one of the six typical scenarios for 6G. These services impose very stringent constraints on latency and reliability

presenting new opportunities and challenges for the coding and decoding of short-blocklength codes. Ordered statistics decoding (OSD) is a universal near-maximum-likelihood (Near-ML) decoding algorithm for short codes with strong potential in such scenarios

but its high computational complexity severely limits practical deployment. This paper surveys recent advances in OSD with a focus on the design of test error pattern (TEP)

including ordering rules

skipping mechanisms

and early termination strategies

and outlines future research directions. Specifically

we first examine Hamming-weight

soft-weight

and logical-weight TEP orderings

and show that logical-weight ordering achieves an effective balance between reliability and implementation complexity. We then review existing skipping and termination mechanisms

which exploit dynamic soft information or probabilistic decisions to avoid redundant re-encodings. Moreover

we concentrate on TEP generation

skipping

and termination schemes driven by soft metrics and additional parity checks

as well as their joint design. By combining structural constraints with hybrid decision strategies

such schemes can reduce the average number of re-encodings by one to two orders of magnitude with almost no loss in frame error rate. Simulation results show that

for the bose-chaudhuri-hocquenghem（BCH) code

<math id="M4"><mo stretchy="false">[</mo><mn mathvariant="normal">127

64</mn><mo stretchy="false">]</mo></math>

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013947&type=

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013912&type=

10.15999985

2.87866688

a combined skipping mechanism requires only tens of re-encodings at an SNR of

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013960&type=

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013973&type=

6.01133299

2.37066650

reducing the computational cost by more than

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013977&type=

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=107013976&type=

5.84200001

2.28600001

compared to the original OSD algorithm. Finally

we discuss open challenges related to non-binary codes

time-varying channels

and hardware implementations for longer blocklengths and medium-rate codes

and outline several promising directions for future research.

关键词

Keywords

references

3 GPP . Study on Scenarios and Requirements for Next Generation Access Technologies v14.2.0 (release 14 ) [R/OL ] . [ 2025-08-29 ] . https://portal.3gpp.org/desktopmodules/Specifications/SpecificationDetails.aspx specificationId=2996 https://portal.3gpp.org/desktopmodules/Specifications/SpecificationDetails.aspxspecificationId=2996 .

ITU-R . Framework and Overall Objectives of the Future Development of IMT for 2030 and beyond [R/OL ] . [ 2025-08-29 ] . https://www.itu.int/rec/R-REC-M.2160-0-202311-I/en https://www.itu.int/rec/R-REC-M.2160-0-202311-I/en .

Rowshan M , Qiu M , Xie Y X , et al . Channel coding toward 6G: Technical overview and outlook [J ] . IEEE Open Journal of the Communications Society , 2024 , 5 : 2585 - 2685 .

Tataria H , Shafi M , Molisch A F , et al . 6G wireless systems: Vision, requirements, challenges, insights, and opportunities [J ] . Proceedings of the IEEE , 2021 , 109 ( 7 ): 1166 - 1199 .

蔡穗华 , 王义文 , 白宝明 , 等 . 面向高可靠低时延通信的信道编码技术研究综述 [J ] . 电子学报 , 2025 , 53 ( 2 ): 629 - 644 .

Cai Suihua , Wang Yiwen , Bai Baoming , et al . Channel coding techniques for ultra-reliable and low-latency communication [J ] . Acta Electronica Sinica , 2025 , 53 ( 2 ): 629 - 644 . (in Chinese)

Gallager R . Low-density parity-check codes [J ] . IEEE Transactions on Information Theory , 1962 , 8 ( 1 ): 21 - 28 .

MacKay D J C , Neal R M . Near Shannon limit performance of low density paritycheck codes [J ] . Electronics Letters , 1996 , 32 ( 18 ): 1645 - 1646 .

李二保 , 雷菁 , 徐富兵 . 非规则LDPC度分布优化设计 [J ] . 电子与信息学报 , 2008 , 30 ( 11 ): 2788 - 2791 .

Li Erbao , Lei Jing , Xu Fubing . Design and optimization of degree distributions of irregular LDPC [J ] . Journal of Electronics & Information Technology , 2008 , 30 ( 11 ): 2788 - 2791 . (in Chinese)

Jimenez Felstrom A , Zigangirov K S . Time-varying periodic convolutional codes with low-density parity-check matrix [J ] . IEEE Transactions on Information Theory , 1999 , 45 ( 6 ): 2181 - 2191 .

Pusane A E , Smarandache R , Vontobel P O , et al . Deriving good LDPC convolutional codes from LDPC block codes [J ] . IEEE Transactions on Information Theory , 2011 , 57 ( 2 ): 835 - 857 .

Wang Q F , Cai S H , Lin W C , et al . Spatially coupled LDPC codes via partial superposition and their application to HARQ [J ] . IEEE Transactions on Vehicular Technology , 2021 , 70 ( 4 ): 3493 - 3504 .

王千帆 , 杨佳仪 , 王寅楚 , 等 . 面向流式通信的耦合LDPC码研究综述 [J ] . 电子学报 , 2024 , 52 ( 8 ): 2913 - 2932 .

Wang Qianfan , Yang Jiayi , Wang Yinchu , et al . A review of coupled LDPC codes for streaming communications [J ] . Acta Electronica Sinica , 2024 , 52 ( 8 ): 2913 - 2932 . (in Chinese)

Arikan E . Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels [J ] . IEEE Transactions on Information Theory , 2009 , 55 ( 7 ): 3051 - 3073 .

牛凯 . 极化码原理与应用 [M ] . 北京 : 科学出版社 , 2021 : 56 - 60 .

Niu Kai . Principle and application of polarization code [M ] . Beijing : Science Press , 2021 : 56 - 60 . (in Chinese)

Coşkun M C , Durisi G , Jerkovits T , et al . Efficient error-correcting codes in the short blocklength regime [J ] . Physical Communication , 2019 , 34 : 66 - 79 .

Shirvanimoghaddam M , Mohammadi M S , Abbas R , et al . Short block-length codes for ultra-reliable low latency communications [J ] . IEEE Communications Magazine , 2019 , 57 ( 2 ): 130 - 137 .

Fossorier M P C , Lin S . Soft-decision decoding of linear block codes based on ordered statistics [J ] . IEEE Transactions on Information Theory , 1995 , 41 ( 5 ): 1379 - 1396 .

Wang Y W , Liang J F , Ma X . Local constraint-based ordered statistics decoding for short block codes [C ] // 2022 IEEE Information Theory Workshop . Piscataway : IEEE , 2022 : 107 - 112 .

Liang J F , Ma X . A random coding approach to performance analysis of the ordered statistic decoding with local constraints [PP/OL ] . V1.arXiv ( 2024-01-30 )[ 2025-12-16 ] . https://doi.org/10.48550/arXiv.2401.16709 https://doi.org/10.48550/arXiv.2401.16709 .

Wang Y W , Wang Q F , Zheng X P , et al . Reduced-complexity guessing codeword decoding of BCH codes with most reliable cyclic basis [C ] // GLOBECOM 2025-2025 IEEE Global Communications Conference . Piscataway : IEEE , 2025 : 115 - 120 .

Wang Q F , Wang Y W , Zheng X P , et al . Ordered reliability bits guessing codeword decoding of short codes [J ] . IEEE Wireless Communications Letters , 2025 , 14 ( 9 ): 2823 - 2827 .

Zheng X P , Wang Q F , Ma X . SCL-GCD of short polar codes [C ] // GLOBECOM 2024-2024 IEEE Global Communications Conference . Piscataway : IEEE , 2024 : 686 - 691 .

王义文 , 王千帆 , 梁济凡 , 等 . 多矩阵的代表性顺序统计量译码算法 [J ] . 电子与信息学报 , 2026 , 48 ( 1 ): 45 - 56 .

Wang Yiwen , Wang Qianfan , Liang Jifan , et al . Multi-matrix representative ordered statistics decoding [J ] . Journal of Electronics & Information Technology , 2026 , 48 ( 1 ): 45 - 56 . (in Chinese)

Chen Y Z , Liang J F , Wang Q F , et al . A new joint source-channel coding scheme with overlay spread spectrum transmission [C ] // 2023 International Conference on Wireless Communications and Signal Processing . Piscataway : IEEE , 2023 : 239 - 244 .

Zheng X P , Wang Q F , Wei B D , et al . Quasi-OSD of binary image of RS codes with applications to JSCC [C ] // 2024 IEEE International Symposium on Information Theory . Piscataway : IEEE , 2024 : 3576 - 3581 .

Wang Y W , Wang Q F , Liang J F , et al . Representative ordered statistics decoding of polar codes [C ] // 2024 IEEE 99th Vehicular Technology Conference . Piscataway : IEEE , 2024 : 1 - 5 .

Wang Y W , Wang Q F , Liang J F , et al . Representative OSD with local constraints of CA-polar codes [J ] . Chinese Journal of Electronics , 2025 , 34 ( 4 ): 1111 - 1119 .

Wang Q F , Liang J F , Li L Z , et al . BP-LCGCD: A Gaussian-elimination-free and high-performance decoder for surface codes [J ] . IEEE Communications Letters , 2026 , 30 : 782 - 786 .

Liang J F , Wang Q F , Li L Z , et al . A high-performance list decoding algorithm for surface codes with erroneous syndrome [PP/OL ] . V2. arXiv ( 2024-11-08 )[ 2025-12-16 ] . https://doi.org/10.48550/arXiv.2409.06979 https://doi.org/10.48550/arXiv.2409.06979 .

Dorsch B . A decoding algorithm for binary block codes andJ-ary output channels (Corresp.) [J ] . IEEE Transactions on Information Theory , 1974 , 20 ( 3 ): 391 - 394 .

Valembois A , Fossorier M . Box and match techniques applied to soft-decision decoding [J ] . IEEE Transactions on Information Theory , 2004 , 50 ( 5 ): 796 - 810 .

Alnawayseh S E A , Loskot P . Ordered statistics-based list decoding techniques for linear binary block codes [J ] . EURASIP Journal on Wireless Communications and Networking , 2012 , 2012 ( 1 ): 314 .

Yue C T , Shirvanimoghaddam M , Li Y H , et al . Segmentation-discarding ordered-statistic decoding for linear block codes [C ] // 2019 IEEE Global Communications Conference . Piscataway : IEEE , 2019 : 9014173 .

Yue C T , Shirvanimoghaddam M , Vucetic B , et al . A revisit to ordered statistics decoding: Distance distribution and decoding rules [J ] . IEEE Transactions on Information Theory , 2021 , 67 ( 7 ): 4288 - 4337 .

Yue C T , Shirvanimoghaddam M , Park G , et al . Linear-equation ordered-statistics decoding [J ] . IEEE Transactions on Communications , 2022 , 70 ( 11 ): 7105 - 7123 .

Yue C T , Shirvanimoghaddam M , Park G , et al . Probability-based ordered-statistics decoding for short block codes [J ] . IEEE Communications Letters , 2021 , 25 ( 6 ): 1791 - 1795 .

Li X Y , Niu K , Han Y X , et al . Pre-configured error pattern ordered statistics decoding for CRC-polar codes [J ] . Entropy , 2023 , 25 ( 10 ): 1405 .

张可 , 林文超 , 王野 . 面向星地通信的低复杂度通用编译码技术 [J ] . 中兴通讯技术 , 2024 , 30 ( 5 ): 30 - 40 .

Zhang Ke , Lin Wenchao , Wang Ye . Low-complexity and universal channel encoding/decoding technology for satellite-to-ground communications [J ] . ZTE Technology Journal , 2024 , 30 ( 5 ): 30 - 40 . (in Chinese)

Wang Y W , Liang J F , Wang Q F , et al . Representative ordered statistics decoding of staircase matrix codes [J ] . IEEE Transactions on Communications , 2025 , 73 ( 4 ): 2148 - 2158 .

YU S , ZHANG B and HUANG Q . Ordered statistics derivative decoding for affine-invariant codes without Gaussian elimination [J ] . IEEE Transactions on Communications , 2025 , 73 ( 11 ): 11006 - 11016 .

Wu D L , Li Y , Guo X D , et al . Ordered statistic decoding for short polar codes [J ] . IEEE Communications Letters , 2016 , 20 ( 6 ): 1064 - 1067 .

Xing Y S , Tu G F . A low-complexity ordered statistics decoding algorithm for short polar codes [J ] . Applied Sciences , 2019 , 9 ( 5 ): 831 .

Choi C , Jeong J . Fast and scalable soft decision decoding of linear block codes [J ] . IEEE Communications Letters , 2019 , 23 ( 10 ): 1753 - 1756 .

Liang J F , Wang Y W , Cai S H , et al . A low-complexity ordered statistic decoding of short block codes [J ] . IEEE Communications Letters , 2023 , 27 ( 2 ): 400 - 403 .

Li X H , Chen W H , Chen L , et al . Order skipping ordered statistics decoding and its performance analysis [C ] // 2024 IEEE Information Theory Workshop . Piscataway : IEEE , 2024 : 448 - 453 .

Yue C T , She C Y , Vucetic B , et al . The guesswork of ordered statistics decoding: Guesswork complexity and decoder design [J ] . IEEE Transactions on Information Theory , 2025 , 71 ( 6 ): 4167 - 4192 .

王千帆 , 郭延庚 , 宋林琦 , 等 . 基于跳过机制的低复杂度顺序统计译码算法 [J ] . 电子与信息学报 , 2025 , 47 ( 11 ): 4275 - 4284 .

Wang Qianfan , Guo Yangeng , Song Linqi , et al . Low-complexity ordered statistic decoding algorithm based on skipping mechanisms [J ] . Journal of Electronics & Information Technology , 2025 , 47 ( 11 ): 4275 - 4284 . (in Chinese)

Ma X . Guessing what, noise or codeword? [C ] // 2024 IEEE Information Theory Workshop . Piscataway : IEEE , 2024 : 460 - 465 .

Duffy K R , An W , Médard M . Ordered reliability bits guessing random additive noise decoding [J ] . IEEE Transactions on Signal Processing , 2022 , 70 : 4528 - 4542 .

Jin W Y , Fossorier M . Probabilistic sufficient conditions on optimality for reliability based decoding of linear block codes [C ] // 2006 IEEE International Symposium on Information Theory . Piscataway : IEEE , 2006 : 2235 - 2239 .

Wu Y Q , Hadjicostis C N . Soft-decision decoding of linear block codes using preprocessing and diversification [J ] . IEEE Transactions on Information Theory , 2007 , 53 ( 1 ): 378 - 393 .

Wang Q F , Chen Y Z , Liang J F , et al . A new joint source-channel coding for short-packet communications [J ] . IEEE Transactions on Communications , 2024 , 72 ( 1 ): 28 - 37 .

Wang Q F , Chen Y Z , Liang J F , et al . A new joint source-channel coding in the short blocklength regime [C ] // 2023 IEEE Globecom Workshops . Piscataway : IEEE , 2023 : 1566 - 1571 .

Wang Q F , Wang Y W , Wang Y X , et al . Random staircase generator matrix codes: Coding theorem, performance analysis, and code design [J ] . IEEE Transactions on Information Theory , 2025 , 71 ( 5 ): 3497 - 3509 .

Wang Q F , Wang Y X , Wang Y W , et al . Random staircase generator matrix codes [C ] // 2024 IEEE International Symposium on Information Theory . Piscataway : IEEE , 2024 : 2622 - 2627 .

王义文 , 王千帆 , 马啸 . 强干扰环境下无速率随机码编译码方案及其性能分析 [J ] . 电子与信息学报 , 2024 , 46 ( 10 ): 4017 - 4023 .

Wang Yiwen , Wang Qianfan , Ma Xiao . Rateless random coding scheme and performance analysis in strong interference environments [J ] . Journal of Electronics & Information Technology , 2024 , 46 ( 10 ): 4017 - 4023 . (in Chinese)

梁济凡 , 王千帆 , 宋林琦 , 等 . 参数列表化置信传播-顺序统计译码算法 [J ] . 电子与信息学报 , 2025 , 47 ( 11 ): 4254 - 4263 .

Liang Jifan , Wang Qianfan , Song Linqi , et al . Belief propagation-ordered statistics decoding algorithm with parameterized list structures [J ] . Journal of Electronics & Information Technology , 2025 , 47 ( 11 ): 4254 - 4263 . (in Chinese)

Liang J F , Wang Q F , Li L Z , et al . The BP-LCOSD algorithm for toric codes [C ] // 2024 IEEE International Symposium on Information Theory Workshops . Piscataway : IEEE , 2024 : 10591758 .

Liang J F , Wang Q F , Li L Z , et al . A low-complexity BP-OSD algorithm for quantum LDPC codes [J ] . The European Physical Journal Special Topics , 2025 , 234 ( 20 ): 6211 - 6222 .

Wang Q F , Wang Y W , Yang J Y , et al . Low-complexity BP-ORBOSD algorithm for short 5G LDPC codes [C ] // 2025 IEEE/CIC International Conference on Communications in China . Piscataway : IEEE , 2025 : 11148135 .

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Modification of McEliece’s Public-key Cryptosystem

The Encryption Methods in ECPS2 and ECPS3 Are Not Secure

On the Soft Decision Decoding of Linear Block Codes

Related Author

WANG Xin-mei

Wang XinmeiDept.of Information Engineering

Xidian University

Xi’an 710071)Li Yuanxing

Long Yonghong

马建峰

马啸

王新梅

Related Institution

Xidian University,National Key Lab.on ISN

Xidian UniversityNational Key Lab.on ISNXi'an 710071China

Dept.of Information Engineering,Beijing University of Posts and Telecommunication,Beijing 100088)Wu Chuankun

北京邮电学院信息工程系

西安电子科技大学应用数学系

⁰