Turn off MathJax
Article Contents
Article Navigation >  Chinese Journal of Space Science  > 2026  > Uncorrected proofOpen Access
GU Xuechen, FAN Yanan, YAN Yi, LI Xue, YAO Xiujuan. A Maximum A-posteriori Probability Decoding Algorithm for the CCSDS Punctured Convolutional Codes (in Chinese). Chinese Journal of Space Science, 2026, 46(3): 1-9 doi: 10.11728/cjss2026.03.2025-0058
Citation: GU Xuechen, FAN Yanan, YAN Yi, LI Xue, YAO Xiujuan. A Maximum A-posteriori Probability Decoding Algorithm for the CCSDS Punctured Convolutional Codes (in Chinese). Chinese Journal of Space Science, 2026, 46(3): 1-9 doi: 10.11728/cjss2026.03.2025-0058
shu

A Maximum A-posteriori Probability Decoding Algorithm for the CCSDS Punctured Convolutional Codes

doi: 10.11728/cjss2026.03.2025-0058 cstr: 32142.14.cjss.2025-0058
  • 1.

    National Space Science Center, Chinese Academy of Sciences, Beijing 100190

  • 2.

    University of Chinese Academy of Sciences, Beijing 101408

  • Received Date: 2025-04-14
  • Rev Recd Date: 2025-07-14
    • Available Online: 2025-07-15
    Abstract
  • CCSDS punctured convolutional codes suffer from bit-error-rate performance degradation using the Viterbi decoding algorithm. Aiming at this issue, this paper proposed a maximum a-posteriori probability decoding algorithm for these codes. The algorithm takes a forward and backward update process of the likelihood messages based on the trellis graph, to obtain the maximum a-posteriori log-likelihood ratio for the corresponding input bits, reducing the loss of channel likelihood information caused by puncturing, thereby improving the performance of the punctured convolutional code. As shown by the simulation results, the proposed algorithm can achieve an even lower bit-error-rate for the CCSDS punctured convolutional codes and improve the encoding gain, and the higher the code rate, the more significant the bit error rate reduction. Compared with the Viterbi decoding algorithm, the proposed decoding algorithm provides a coding gain of about 0.2 dB and 0.6 dB for code rates of 5/6 and 7/8 respectively. Its computational complexity is comparable to that of the Viterbi decoding algorithm, thus it has good engineering application value, which can be used to improve the reliability of existing space telecommunication systems.

     

    • FullText(HTML)
  • loading
    • References(27)
  • [1]
    VITERBI A J. A personal history of the Viterbi algorithm[J]. IEEE Signal Processing Magazine, 2006, 23(4): 120-142 doi: 10.1109/MSP.2006.1657823
    [2]
    蔡穗华, 王义文, 白宝明, 等. 面向高可靠低时延通信的信道编码技术研究综述[J]. 电子学报, 2025, 53(2): 629-644 doi: 10.12263/DZXB.20240137

    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 doi: 10.12263/DZXB.20240137
    [3]
    RACHINGER C, HUBER J B, MULLER R R. Comparison of convolutional and block codes for low structural delay[J]. IEEE Transactions on Communications, 2015, 63(12): 4629-4638 doi: 10.1109/TCOMM.2015.2488661
    [4]
    COŞKUN M C, DURISI G, JERKOVITS T, et al. Efficient error-correcting codes in the short block length regime[J]. Physical Communication, 2019, 34: 66-79 doi: 10.1016/j.phycom.2019.03.004
    [5]
    赵子伟. 极化调整卷积码的高效译码算法研究[D]. 杭州: 浙江大学, 2024

    ZHAO Ziwei. Research on Efficient Decoding Algorithms for PAC Codes[D]. Hangzhou: Zhejiang University, 2024
    [6]
    ARKAN E. From sequential decoding to channel polarization and back again[OL]. arXiv preprint arXiv: 1908.09594, 2019. DOI: 10.48550/arXiv.1908.09594
    [7]
    郭网媚, 刘丹丹, 陈琦, 等. 二元稀疏卷积纠删码[J]. 西安电子科技大学学报, 2023, 50(3): 112-121

    GUO Wangmei, LIU Dandan, CHEN Qi, et al. Binary sparse convolutional erasure correction coding[J]. Journal of Xidian University, 2023, 50(3): 112-121
    [8]
    MOISION B, HAMKINS J. Coded modulation for the deep-space optical channel: serially concatenated pulse-position modulation[J]. The Interplanetary Network Progress Report, 2005, 42(161): 1-26
    [9]
    向劲松, 陈怀柔. QAM调制下基于卷积码与累加编码调制级联的纠错码性能研究[J]. 半导体光电, 2023, 44(6): 924-930 doi: 10.16818/j.issn1001-5868.2023090102

    XIANG Jinsong, CHEN Huairou. Research on the performance of error correctioncodes based on convolutional code and accumulative code modulation cascade under QAM modulation[J]. Semiconductor Optoelectronics, 2023, 44(6): 924-930 doi: 10.16818/j.issn1001-5868.2023090102
    [10]
    WESEL R, ANTONINI A, WANG L F, et al. ELF codes: concatenated codes with an expurgating linear function as the outer code[C]//12th International Symposium on Topics in Coding (ISTC). Brest, France: IEEE, 2023: 1-5
    [11]
    HUG F, BOCHAROVA I E, JOHANNESSON R, et al. A rate R=5/20 Hypergraph-based woven convolutional code with free distance 120[J]. IEEE Transactions on Information Theory, 2010, 56(4): 1618-1623 doi: 10.1109/TIT.2010.2040966
    [12]
    何倩. 基于卷积码的隐蔽通信技术研究[D]. 西安: 西安电子科技大学, 2023

    HE Qian. Research on Covert Communication Based on Convolutional Code[D]. Xi’an: Xidian University, 2023
    [13]
    FORNEY G D, GRASSL M, GUHA S. Convolutional and tail-biting quantum error-correcting codes[J]. IEEE Transactions on Information Theory, 2007, 53(3): 865-880 doi: 10.1109/TIT.2006.890698
    [14]
    WACHTER-ZEH A, STINNER M, SIDORENKO V. Convolutional codes in rank metric with application to random network coding[J]. IEEE Transactions on Information Theory, 2015, 61(6): 3199-3213 doi: 10.1109/TIT.2015.2424930
    [15]
    YASUDA Y, KASHIKI K, HIRATA Y. High-rate punctured convolutional codes for soft decision viterbi decoding[J]. IEEE Transactions on Communications, 1984, 32(3): 315-319 doi: 10.1109/TCOM.1984.1096047
    [16]
    YAMAGUCHI K, NAKAJIMA A, NODA M. A simple design of puncturing pattern for symbol-wise viterbi decoding[C]//2022 IEEE 8th World Forum on Internet of Things (WF-IoT). Yokohama, Japan: IEEE, 2022: 1-6
    [17]
    The Consultative Committee for Space Data Systems. CCSDS TM Synchronization and Channel Coding: 131.0-B-5[S]. Washington: National Aeronautics and Space Administration, 2023: 9
    [18]
    HAGENAUER J, HOEHER P. A Viterbi algorithm with soft-decision outputs and its applications[C]//1989 IEEE Global Telecommunications Conference and Exhibition Communications Technology for the 1990s and Beyond. Dallas, TX, USA: IEEE, 1989: 1680-1686
    [19]
    GUO Z J, CAO L. SOVA decoded serially concatenated continuous phase modulations with binary markov source[C]//SoutheastCon 2025. Concord, NC, USA: IEEE, 2025: 753-758
    [20]
    CHEN J, FOSSORIER M P C, LIN S, et al. Bi-directional SOVA decoding for turbo-codes[J]. IEEE Communications Letters, 2000, 4(12): 405-407 doi: 10.1109/4234.898722
    [21]
    BAHL L, COCKE J, JELINEK F, et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp. )[J]. IEEE Transactions on Information Theory, 1974, 20(2): 284-287 doi: 10.1109/tit.1974.1055186
    [22]
    WOODARD J P, HANZO L. Comparative study of turbo decoding techniques: an overview[J]. IEEE Transactions on Vehicular Technology, 2000, 49(6): 2208-2233 doi: 10.1109/25.901892
    [23]
    ROBERTSON P, VILLEBRUN E, HOEHER P. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain[C]//Proceedings IEEE International Conference on Communications ICC'95. Seattle, WA, USA: IEEE, 1995: 1009-1013
    [24]
    CHANG Y C, LAIN J K. Improved decoding with the bi-directional SOVA for turbo codes[C]//2005 IEEE 61st Vehicular Technology Conference. Stockholm: IEE, 2005: 673-677
    [25]
    The Consultative Committee for Space Data Systems. CCSDS 130.1-G-3 TM Synchronization and Channel Coding—Summary of Concept and Rationale[S]. Washington: National Aeronautics and Space Administration, 2020
    [26]
    COSTELLO D J, FORNEY G D. Channel coding: the road to channel capacity[J]. Proceedings of the IEEE, 2007, 95(6): 1150-1177 doi: 10.1109/JPROC.2007.895188
    [27]
    BUTMAN S A, MCELIECE R J. The ultimate limits of binary coding for a wideband Gaussian channel[J]. JPL Deep Space Network Progress Report, 1974: 78-80
    • Related Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    Figures(7)  / Tables(4)

    Get Citation
    PDF
    XML

    Article Metrics

    Article Views(569) PDF Downloads(74) Cited by()
    Visiting Statistics
    Related Articles

    Journal Introduction

    ISSN 2097-7689       CN 11-1783/V

    Copyright © Editorial Office of Chinese Journal of Space Science.  京ICP备08100722号

    Supported by: Beijing Renhe Information Technology Co., Ltd.  

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return