面向高可靠低时延通信的信道编码技术研究综述

蔡穗华; 王义文; 白宝明; 马啸

doi:10.12263/DZXB.20240137

您当前的位置：

首页 >

文章列表页 >

面向高可靠低时延通信的信道编码技术研究综述

综述评论 | 更新时间：2025-12-08

- 面向高可靠低时延通信的信道编码技术研究综述
- Channel Coding Techniques for Ultra-Reliable and Low-Latency Communication
- 电子学报 2025年53卷第2期页码：629-644
- 作者机构：
  
  1.中山大学计算机学院，广东广州 510006
  2.中山大学信息技术教育部重点实验室，广东广州 510006
  3.广东省信息安全技术重点实验室，广东广州 510006
  4.西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071
- 作者简介：
  
  [ "蔡穗华男，1988年12月出生于广东省广州市.现为中山大学计算机学院副教授.主要研究方向为信息与编码理论、编码调制技术. E-mail: caish23@mail.sysu.edu.cn" ]
  [ "王义文男，1998年3月出生于广东省肇庆市.现为中山大学计算机学院博士研究生.主要研究方向为信息论与编码. E-mail: wangyw93@mail2.sysu.edu.cn" ]
  [ "白宝明男，1966年出生于山西省大同市.现为西安电子科技大学通信工程学院教授.主要研究方向为信息与编码理论、编码调制技术、无线通信.中国电子学会会员编号：E190003519F.E-mail: bmbai@mail.xidian.edu.cn" ]
  [ "马啸男，1968年10月出生于河南省焦作市.现为中山大学计算机学院教授.主要研究方向为信息与编码理论、编码调制技术、无线通信和光通信等. E-mail: maxiao@mail.sysu.edu.cn" ]
- 基金信息：
  
  国家重点研发计划(2021YFA1000500);国家自然科学基金(62201626)
- DOI：10.12263/DZXB.20240137
  中图分类号： TN911.22;TN919.3
- 收稿：2024-02-05，
  
  修回：2024-05-09，
  
  纸质出版：2025-02-25
- 稿件说明：
移动端阅览
蔡穗华, 王义文, 白宝明, 等. 面向高可靠低时延通信的信道编码技术研究综述[J]. 电子学报, 2025, 53(02): 629-644.

CAI Sui-hua, WANG Yi-wen, BAI Bao-ming, et al. Channel Coding Techniques for Ultra-Reliable and Low-Latency Communication[J]. Acta Electronica Sinica, 2025, 53(02): 629-644.
蔡穗华, 王义文, 白宝明, 等. 面向高可靠低时延通信的信道编码技术研究综述[J]. 电子学报, 2025, 53(02): 629-644. DOI：10.12263/DZXB.20240137

CAI Sui-hua, WANG Yi-wen, BAI Bao-ming, et al. Channel Coding Techniques for Ultra-Reliable and Low-Latency Communication[J]. Acta Electronica Sinica, 2025, 53(02): 629-644. DOI：10.12263/DZXB.20240137

摘要

高可靠低时延通信技术是目前无线通信领域的热点问题之一，其关键在于高性能的中短码长信道编码技术的实现.与以往长码设计不同的是，在有限码长下，编码速率受误码率性能制约，因而需要针对性地进行编码构造、译码算法设计以及编码性能分析与优化.目前已有面向中短码长的极化码、咬尾卷积码等编码技术的研究，但主要都是面向特定码长码率的优化设计，难以满足实际应用对灵活编码参数的要求.基于此，本文对中短码长编码技术进行全面归纳梳理与深度探讨分析，首先综述了现有有限码长编码性能界的理论分析方法，随后对近年来提出的编码技术进行了梳理，并分析比较每种编码技术的优缺点，最后详细探讨了针对低时延高可靠场景的新型编码技术，并对未来研究方向与发展趋势进行探讨和展望.

Abstract

One of the hottest topics in the field of wireless communication is ultra-reliable and low-latency communication (URLLC)

where channel coding with short-and-medium length plays a critical role. Unlike the case for long codes

in the finite code length regime

the coding rate is constrained by the error performance

thus tailored coding construction

decoding algorithm design

and performance analysis and optimization are required. At present

there are studies on coding technologies such as polar codes and tail-biting convolutional codes for short-and-medium length codes

but they are mainly optimized designs for specific code lengths and rates

which are difficult to meet the requirements of flexible coding for practical applications. Based on this

this paper summarizes and discusses the state-of-the-art coding technology for short-and-medium length. Firstly

we review the theoretical bounds for the performance of finite-length codes. Then

we analyze the coding technologies proposed in recent years

and compare their advantages and disadvantages. Finally

we discuss in detail new coding technologies for URLLC

and we prospectively explore the future research directions and development trends of channel coding techniques for ultra-reliable and low-latency communication.

关键词

Keywords

references

3GPP. TS 22.261: Service requirements for the 5G system (Release 17) [S/OL ] . [ 2021-12-24 ] . https://itecspec.com/archive/3gpp-specification-ts-22-261/ https://itecspec.com/archive/3gpp-specification-ts-22-261/ .

华为技术有限公司 . “ 6G: 无线通信新征程”白皮书 [R/OL ] . ( 2022-01-01 )[ 2024-02-05 ] . https://www.huawei.com/cn/huaweitech/future-technologies/6g-white-paper https://www.huawei.com/cn/huaweitech/future-technologies/6g-white-paper .

Huawei Technologies CO , LTD . “ 6G: The next new journey of wireless communication” white paper [R/OL ] . ( 2022-01-0] )[ 2024-02-05 ] . https://www.huawei.com/cn/huaweitech/future-technologies/6g-white-paper. https://www.huawei.com/cn/huaweitech/future-technologies/6g-white-paper. (in Chinese)

ITU-R , Draft New Recommendation . IMT vision-framework and overall objectives of the future development of IMT for 2030 and beyond [R/OL ] . ( 2023-01-29 )[ 2024-02-05 ] . https://techblog.comsoc.org/2023/01/29/imt-vision-framework-and-overall-objectives-of-the-future-development-of-imt-for-2030-and-beyond/ https://techblog.comsoc.org/2023/01/29/imt-vision-framework-and-overall-objectives-of-the-future-development-of-imt-for-2030-and-beyond/ .

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 .

SYBIS M , WESOLOWSKI K , JAYASINGHE K , et al . Channel coding for ultra-reliable low-latency communication in 5G systems [C ] // 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall) . Piscataway : IEEE , 2016 : 1 - 5 .

刘荣科 , 孙贺 , 冯宝平 , 等 . 极化码研究综述 [J ] . 遥测遥控 , 2020 , 41 ( 4 ): 2 - 17 .

LIU R K , SUN H , FENG B P , et al . A survey of polar code research [J ] . Journal of Telemetry, Tracking and Command , 2020 , 41 ( 4 ): 2 - 17 . (in Chinese)

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 .

VAN WONTERGHEM J , ALLOUM A , BOUTROS J J , et al . On short-length error-correcting codes for 5G-NR [J ] . Ad Hoc Networks , 2018 , 79 : 53 - 62 .

SHANNON C E . A mathematical theory of communication [J ] . The Bell System Technical Journal , 1948 , 27 ( 3 ): 379 - 423 .

FEINSTEIN A . Error bounds in noisy channels without memory [J ] . IRE Transactions on Information Theory , 1955 , 1 ( 2 ): 13 - 14 .

GALLAGER R . A simple derivation of the coding theorem and some applications [J ] . IEEE Transactions on Information Theory , 1965 , 11 ( 1 ): 3 - 18 .

POLTYREV G . Bounds on the decoding error probability of binary linear codes via their spectra [J ] . IEEE Transactions on Information Theory , 1994 , 40 ( 4 ): 1284 - 1292 .

SHANNON C E . Probability of error for optimal codes in a Gaussian channel [J ] . The Bell System Technical Journal , 1959 , 38 ( 3 ): 611 - 656 .

SHANNON C E , GALLAGER R G , BERLEKAMP E R . Lower bounds to error probability for coding on discrete memoryless channels. I [J ] . Information and Control , 1967 , 10 ( 1 ): 65 - 103 .

POLYANSKIY Y , POOR H V , VERDU S . Channel coding rate in the finite blocklength regime [J ] . IEEE Transactions on Information Theory , 2010 , 56 ( 5 ): 2307 - 2359 .

MARTINEZ A , FÀBREGAS A G I . Saddlepoint approximation of random-coding bounds [C ] // 2011 Information Theory and Applications Workshop . Piscataway : IEEE , 2011 : 1 - 6 .

VAZQUEZ-VILAR G , FABREGAS A G I , KOCH T , et al . Saddlepoint approximation of the error probability of binary hypothesis testing [C ] // 2018 IEEE International Symposium on Information Theory (ISIT) . Piscataway : IEEE , 2018 : 2306 - 2310 .

HAMMING R W . Error detecting and error correcting codes [J ] . The Bell System Technical Journal , 1950 , 29 ( 2 ): 147 - 160 .

REED I . A class of multiple-error-correcting codes and the decoding scheme [J ] . Transactions of the IRE Professional Group on Information Theory , 1954 , 4 ( 4 ): 38 - 49 .

MULLER D E . Application of Boolean algebra to switching circuit design and to error detection [J ] . Transactions of the I.R.E. Professional Group on Electronic Computers , 1954 , EC-3( 3 ): 6 - 12 .

REED I S , SOLOMON G . Polynomial codes over certain finite fields [J ] . Journal of the Society for Industrial and Applied Mathematics , 1960 , 8 ( 2 ): 300 - 304 .

HOCQUENGHEM A . Codes correcteurs d'erreurs [J ] . Chiffres , 1959 , 2 ( 2 ): 147 - 156 .

BOSE R C , RAY-CHAUDHURI D K . On a class of error correcting binary group codes [J ] . Information and Control , 1960 , 3 ( 1 ): 68 - 79 .

BERLEKAMP E R . Non-binary BCH decoding [R ] . North Carolina State University . Dept. of Statistics, 1966.

MASSEY J . Shift-register synthesis and BCH decoding [J ] . IEEE Transactions on Information Theory , 1969 , 15 ( 1 ): 122 - 127 .

CHASE D . Class of algorithms for decoding block codes with channel measurement information [J ] . IEEE Transactions on Information Theory , 1972 , 18 ( 1 ): 170 - 182 .

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 .

JIANG J , NARAYANAN K R . Iterative soft-input soft-output decoding of reed-Solomon codes by adapting the parity-check matrix [C ] // IEEE Transactions on Information Theory . Piscataway : IEEE , 2006 : 3746 - 3756 .

HEHN T , HUBER J B , MILENKOVIC O , et al . Multiple-bases belief-propagation decoding of high-density cyclic codes [J ] . IEEE Transactions on Communications , 2010 , 58 ( 1 ): 1 - 8 .

YANG L J , CHEN L . Low-latency ordered statistics decoding of BCH codes [C ] // 2022 IEEE Information Theory Workshop (ITW) . Piscataway : IEEE , 2022 : 404 - 409 .

BOSSERT M , SCHULZ R , BITZER S . On hard and soft decision decoding of BCH codes [J ] . IEEE Transactions on Information Theory , 2022 , 68 ( 11 ): 7107 - 7124 .

HUANG Q , ZHANG B . Minimal derivative descendants of cyclic codes [C ] // 2023 IEEE International Symposium on Information Theory (ISIT) . Piscataway : IEEE , 2023 : 286 - 291 .

MA X . Guessing what, noise or codeword? [EB/OL ] . ( 2024-01-30 )[ 2024-02-05 ] . https://arxiv.org/abs/2401.16804v1 https://arxiv.org/abs/2401.16804v1 .

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 .

WU Y Q , HADJICOSTIS C N . Soft-decision decoding using ordered recodings on the most reliable basis [J ] . IEEE Transactions on Information Theory , 2007 , 53 ( 2 ): 829 - 836 .

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 (GLOBECOM) . Piscataway : IEEE , 2019 : 1 - 6 .

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 .

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

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 .

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

SPIELMAN D A . Linear-time encodable and decodable error-correcting codes [J ] . IEEE Transactions on Information Theory , 1996 , 42 ( 6 ): 1723 - 1731 .

MACKAY D J C , NEAL R M . Near Shannon limit performance of low density parity check codes [J ] . Electronics Letters , 1997 , 33 ( 6 ): 457 .

CHUNG S Y , FORNEY G D , RICHARDSON T J , et al . On the design of low-density parity-check codes within 0.004 5 dB of the Shannon limit [J ] . IEEE Communications Letters , 2001 , 5 ( 2 ): 58 - 60 .

RICHARDSON T , KUDEKAR S . Design of low-density parity check codes for 5G new radio [J ] . IEEE Communications Magazine , 2018 , 56 ( 3 ): 28 - 34 .

HU X Y , ELEFTHERIOU E , ARNOLD D M . Regular and irregular progressive edge-growth tanner graphs [J ] . IEEE Transactions on Information Theory , 2005 , 51 ( 1 ): 386 - 398 .

Ryan William E , Shu Lin . 信道编码: 经典与现代 [M ] . 白宝明, 马啸, 译. 北京 : 电子工业出版社 , 2017 .

RYAN W E , LIN S . Channel Codes: Classical and Modern [M ] . Beijing : Publishing House of Electronics Industry , 2017 . (in Chinese)

LI J E , LIN S , ABDEL-GHAFFAR K , et al . LDPC Code Designs, Constructions, and Unification [M ] . Cambridge : Cambridge University Press , 2016 .

DAVEY M C , MACKAY D . Low-density parity check codes over GF(q) [J ] . IEEE Communications Letters , 1998 , 2 ( 6 ): 165 - 167 .

POULLIAT C , FOSSORIER M , DECLERCQ D . Design of regular (2, d c )-LDPC codes over GF(q) using their binary images [J ] . IEEE Transactions on Communications , 2008 , 56 ( 10 ): 1626 - 1635 .

XU H Z , BAI B M , ZHU M , et al . Construction of short-block nonbinary LDPC codes based on cyclic codes [J ] . China Communications , 2017 , 14 ( 8 ): 1 - 9 .

ZHANG J T , FOSSORIER M P C . A modified weighted bit-flipping decoding of low-density Parity-check codes [J ] . IEEE Communications Letters , 2004 , 8 ( 3 ): 165 - 167 .

DENG D X , XU H Z , BAI B M , et al . A two-stage decoding algorithm for short nonbinary LDPC codes with Near-ML performance [C ] // 2017 IEEE International Symposium on Information Theory (ISIT) . Piscataway : IEEE , 2017 : 1202 - 1206 .

OSTOJIC M , LOELIGER H A . Multitree decoding and multitree-aided LDPC decoding [C ] // 2010 IEEE International Symposium on Information Theory . Piscataway : IEEE , 2010 : 779 - 783 .

FELDMAN J , WAINWRIGHT M J , KARGER D R . Using linear programming to decode binary linear codes [J ] . IEEE Transactions on Information Theory , 2005 , 51 ( 3 ): 954 - 972 .

BARMAN S , LIU X S , DRAPER S C , et al . Decomposition methods for large scale LP decoding [J ] . IEEE Transactions on Information Theory , 2013 , 59 ( 12 ): 7870 - 7886 .

WEI H Y , BANIHASHEMI A H . ADMM check node penalized decoders for LDPC codes [J ] . IEEE Transactions on Communications , 2021 , 69 ( 6 ): 3528 - 3540 .

NACHMANI E , BE'ERY Y , BURSHTEIN D . Learning to decode linear codes using deep learning [C ] // 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . Piscataway : IEEE , 2016 : 341 - 346 .

DAI J C , TAN K L , SI Z W , et al . Learning to decode protograph LDPC codes [J ] . IEEE Journal on Selected Areas in Communications , 2021 , 39 ( 7 ): 1983 - 1999 .

LIANG F , SHEN C , WU F . An iterative BP-CNN architecture for channel decoding [J ] . IEEE Journal of Selected Topics in Signal Processing , 2018 , 12 ( 1 ): 144 - 159 .

万飞 , 白宝明 , 朱敏 . 多元LDPC编码调制系统CNN辅助迭代检测译码算法 [J ] . 无线电通信技术 , 2022 , 48 ( 4 ): 673 - 679 .

WAN F , BAI B M , ZHU M . CNN-aided iterative detection and decoding for nonbinary LDPC coded modulation systems [J ] . Radio Communications Technology , 2022 , 48 ( 4 ): 673 - 679 . (in Chinese)

ELIAS P . Coding for noisy channels [R ] . IRE WESCON Convention Record , 1955 : 94 - 104 .

JOHANNESSON R , ZIGANGIROV K S . Fundamentals of Convolutional Coding [M ] . New York : Institute of Electrical and Electronics Engineers , 2015 .

STAHL P , ANDERSON J B , JOHANNESSON R . Optimal and near-optimal encoders for short and moderate-length tail-biting trellises [J ] . IEEE Transactions on Information Theory , 1999 , 45 ( 7 ): 2562 - 2571 .

LOU C Y , DANESHRAD B , WESEL R D . Convolutional-code-specific CRC code design [J ] . IEEE Transactions on Communications , 2015 , 63 ( 10 ): 3459 - 3470 .

YANG H J , LIANG E , PAN M H , et al . CRC-aided list decoding of convolutional codes in the short blocklength regime [J ] . IEEE Transactions on Information Theory , 2022 , 68 ( 6 ): 3744 - 3766 .

MA H , WOLF J . On tail biting convolutional codes [J ] . IEEE Transactions on Communications , 1986 , 34 ( 2 ): 104 - 111 .

GAUDIO L , NINACS T , JERKOVITS T , LIVA G . On the performance of short tail-biting convolutional codes for ultra-reliable communications [C ] // 11th International ITG Conference on Systems, Communications and Coding . New York : IEEE Press , 2017 : 1 - 6 .

SHAO R Y , LIN S , FOSSORIER M P C . Two decoding algorithms for tailbiting codes [J ] . IEEE Transactions on Communications , 2003 , 51 ( 10 ): 1658 - 1665 .

SHANKAR P , KUMAR P N A , SASIDHARAN K , et al . Efficient convergent maximum likelihood decoding on tail-biting trellises [EB/OL ] . ( 2006-01-09 )[ 2024-02-05 ] . https://www.semanticscholar.org/paper/Efficient-Convergent-Maximum-Likelihood-Decoding-on-Shankar-Kumar/3747baef29cc18ae406aae23eda03fcd8ed36259 https://www.semanticscholar.org/paper/Efficient-Convergent-Maximum-Likelihood-Decoding-on-Shankar-Kumar/3747baef29cc18ae406aae23eda03fcd8ed36259 .

PAI H T , HAN Y S , WU T Y , et al . Low-complexity ML decoding for convolutional tail-biting codes [J ] . IEEE Communications Letters , 2008 , 12 ( 12 ): 883 - 885 .

HAN Y S , WU T Y , CHEN P N , et al . A low-complexity maximum-likelihood decoder for tail-biting convolutional codes [J ] . IEEE Transactions on Communications , 2018 , 66 ( 5 ): 1859 - 1870 .

SESHADRI N , SUNDBERG C E W . List Viterbi decoding algorithms with applications [C ] // IEEE Transactions on Communications . Piscataway : IEEE , 1994 : 313 - 323 .

LIANG E , YANG H J , DIVSALAR D , et al . List-decoded tail-biting convolutional codes with distance-spectrum optimal CRCS for 5G [C ] // 2019 IEEE Global Communications Conference (GLOBECOM) . Piscataway : IEEE , 2019 : 1 - 6 .

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 .

TRIFONOV P . Efficient design and decoding of polar codes [J ] . IEEE Transactions on Communications , 2012 , 60 ( 11 ): 3221 - 3227 .

NIU K , CHEN K . CRC-aided decoding of polar codes [J ] . IEEE Communications Letters , 2012 , 16 ( 10 ): 1668 - 1671 .

LI B , SHEN H , TSE D . An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check [J ] . IEEE Communications Letters , 2012 , 16 ( 12 ): 2044 - 2047 .

ARıKAN E . From sequential decoding to channel polarization and back again [EB/OL ] . ( 2019-08-26 )[ 2024-02-05 ] . https://arxiv.org/abs/1908.09594v3 https://arxiv.org/abs/1908.09594v3 .

NIU K , CHEN K , LIN J R . Beyond turbo codes: Rate-compatible punctured polar codes [C ] // 2013 IEEE International Conference on Communications (ICC) . Piscataway : IEEE , 2013 : 3423 - 3427 .

MILOSLAVSKAYA V . Shortened polar codes [J ] . IEEE Transactions on Information Theory , 2015 , 61 ( 9 ): 4852 - 4865 .

YAO X , MA X . A balanced tree approach to construction of length-flexible polar codes [J ] . IEEE Transactions on Communications , 2024 , 72 ( 2 ): 665 - 674 .

KAHRAMAN S , ÇELEBI M E . Code based efficient maximum-likelihood decoding of short polar codes [C ] // 2012 IEEE International Symposium on Information Theory Proceedings . Piscataway : IEEE , 2012 : 1967 - 1971 .

TAL I , VARDY A . List decoding of polar codes [J ] . IEEE Transactions on Information Theory , 2015 , 61 ( 5 ): 2213 - 2226 .

CHEN K , NIU K , LIN J R . Improved successive cancellation decoding of polar codes [J ] . IEEE Transactions on Communications , 2013 , 61 ( 8 ): 3100 - 3107 .

PAMUK A . An FPGA implementation architecture for decoding of polar codes [C ] // 2011 8th International Symposium on Wireless Communication Systems . Piscataway : IEEE , 2011 : 437 - 441 .

ELKELESH A , EBADA M , CAMMERER S , et al . Belief propagation list decoding of polar codes [J ] . IEEE Communications Letters , 2018 , 22 ( 8 ): 1536 - 1539 .

FAYYAZ U U , BARRY J R . Polar codes for partial response channels [C ] // 2013 IEEE International Conference on Communications (ICC) . Piscataway : IEEE , 2013 : 4337 - 4341 .

YAO H W , FAZELI A , VARDY A . List decoding of Arıkan’s PAC codes [C ] // 2020 IEEE International Symposium on Information Theory (ISIT) . Piscataway : IEEE , 2020 : 443 - 448 .

SASON I , SHAMAI S . Performance analysis of linear codes under maximum-likelihood decoding: A tutorial [J ] . Foundations and Trends in Communications and Information Theory , 2006 , 3 ( 1/2 ): 1 - 222 .

BERLEKAMP E R . The technology of error-correcting codes [J ] . Proceedings of the IEEE , 1980 , 68 ( 5 ): 564 - 593 .

HERZBERG H , POLTYREV G . Techniques of bounding the probability of decoding error for block coded modulation structures [J ] . IEEE Transactions on Information Theory , 1994 , 40 ( 3 ): 903 - 911 .

DIVSALAR D . A simple tight bound on error probability of block codes with application to turbo codes [J ] . TMO Progress Report , 1999 , 19 : 42 - 139 .

MA X , LIU J , BAI B M . New techniques for upper-bounding the ML decoding performance of binary linear codes [J ] . IEEE Transactions on Communications , 2013 , 61 ( 3 ): 842 - 851 .

MA X , LIU J , ZHUANG Q T , et al . New geometrical spectra of linear codes with applications to performance analysis [C ] // 2013 IEEE Information Theory Workshop (ITW) . Piscataway : IEEE , 2013 : 1 - 5 .

DE CAEN D . A lower bound on the probability of a union [J ] . Discrete Mathematics , 1997 , 169 ( 1/2/3 ): 217 - 220 .

KUAI H , ALAJAJI F , TAKAHARA G . Tight error bounds for nonuniform signaling over AWGN channels [J ] . IEEE Transactions on Information Theory , 2000 , 46 ( 7 ): 2712 - 2718 .

COHEN A , MERHAV N . Lower bounds on the error probability of block codes based on improvements on de Caen’s inequality [J ] . IEEE Transactions on Information Theory , 2004 , 50 ( 2 ): 290 - 310 .

FELLER W . An Introduction to Probability Theory and Its Applications [M ] . Hoboken : John Wiley & Sons , 1968 .

ZHENG X P , YAO X , MA X . Performance analysis of maximum-likelihood decoding of polar codes [M ] // Communications in Computer and Information Science . Singapore : Springer Nature Singapore , 2024 : 115 - 127 .

SULLIVAN D . Error-propagation properties of uniform codes [J ] . IEEE Transactions on Information Theory , 1969 , 15 ( 1 ): 152 - 161 .

POLACEK M , SHITZ S , BAR-DAVID I . On FM threshold extension by click noise elimination [J ] . IEEE Transactions on Communications , 1988 , 36 ( 3 ): 375 - 380 .

KRAMER G . Outer bounds on the capacity of Gaussian interference channels [J ] . IEEE Transactions on Information Theory , 2004 , 50 ( 3 ): 581 - 586 .

MA X , HUANG K C , BAI B M . Systematic block Markov superposition transmission of repetition codes [J ] . IEEE Transactions on Information Theory , 2018 , 64 ( 3 ): 1604 - 1620 .

CAI S H , MA X . Twisted-pair superposition transmission [J ] . IEEE Transactions on Communications , 2021 , 69 ( 9 ): 5663 - 5671 .

CAI S H , CHEN H W , WEI B D , et al . Dual coupled polar codes with successive cancellation list decoding [C ] // 2021 IEEE International Symposium on Information Theory (ISIT) . Piscataway : IEEE , 2021 : 2375 - 2380 .

陈皓炜 , 蔡穗华 , 韦宝典 , 等 . 双耦合极化码及其编码调制方案 [J ] . 电子学报 , 2022 , 50 ( 8 ): 1917 - 1924 .

CHEN H W , CAI S H , WEI B D , et al . Dual coupled polar coded modulation [J ] . Acta Electronica Sinica , 2022 , 50 ( 8 ): 1917 - 1924 . (in Chinese)

RACHINGER C , HUBER J B , MÜLLER R R . Comparison of convolutional and block codes for low structural delay [J ] . IEEE Transactions on Communications , 2015 , 63 ( 12 ): 4629 - 4638 .

LEE L N . Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.) [J ] . IEEE Transactions on Information Theory , 1976 , 22 ( 3 ): 349 - 352 .

LIN W C , CAI S H , SUN J C , et al . A low latency coding scheme: Semi-random block oriented convolutional code [C ] // 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC) . Piscataway : IEEE , 2018 : 1 - 5 .

LI J J , CAI S H , LIN W C , et al . Improved block oriented unit memory convolutional codes [J ] . IEEE Transactions on Communications , 2021 , 69 ( 12 ): 7934 - 7944 .

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 .

WANG Y W , LIANG J F , MA X . Local constraint-based ordered statistics decoding for short block codes [C ] // 2022 IEEE Information Theory Workshop (ITW) . Piscataway : IEEE , 2022 : 107 - 112 .

LIANG J , MA X . A random coding approach to performance analysis of the locally constrained ordered statistic decoding [EB/OL ] . ( 2023-05-11 )[ 2024-02-05 ] . https://www.techrxiv.org/doi/full/10.36227/techrxiv.22771085.v1 https://www.techrxiv.org/doi/full/10.36227/techrxiv.22771085.v1 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

一种适用于大气弱湍流信道的极化纠错编码调制方案

双向叠加BCH码及其高性能译码

面向超大规模多天线传输的时空乘积编码技术

面向流式通信的耦合LDPC码研究综述