Node Addition Method of Removing Rings for Fountain Code

被引:0
|
作者
Lv, Xiafu [1 ]
Zheng, Yanpeng [1 ]
机构
[1] Sch Chongqing Univ Posts & Telecommun, Chongqing 400065, Peoples R China
关键词
space communication; fountain code; short ring; node;
D O I
10.1063/1.4982569
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
Traditional communication coding method is difficult to solve the deep space communication exists in the distance, time delay and asymmetry of up-link and down-link and other issues, so choose the fountain code as a deep space communication system channel coding. The paper analyzes the generation principle of LT codes and the factors that affect the performance of LT codes, in which the small loops in the generated matrix are the main factors. A method of adding nodes in Tanner graphs is proposed to remove small loops. The simulation results show that the performance of the LT code is improved and the system reliability is improved.
引用
收藏
页数:6
相关论文
共 50 条
  • [41] Normalization for Removing Code Variations in Modular Programs
    Wang Tiantian
    Su Xiaohong
    Ma Peijun
    ISCSCT 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY, VOL 2, PROCEEDINGS, 2008, : 21 - 24
  • [42] Security Enhancement via Dynamic Fountain Code for Wireless Multicast
    Du, Qinghe
    Li, Wanyu
    Song, Houbing
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2017, 2017, 10251 : 509 - 521
  • [43] Soft-Decoding Algorithm for Fountain Code in Plasma Sheath
    Zhang, Haojie
    Zhai, Ding
    Cao, Yifeng
    IEEE TRANSACTIONS ON PLASMA SCIENCE, 2024, 52 (09) : 4748 - 4752
  • [44] Addition theorems and group rings
    Gao, WD
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1997, 77 (01) : 98 - 109
  • [45] Removing node overlapping using constrained optimization
    He, WQ
    Marriott, K
    PROCEEDINGS OF THE 21ST AUSTRALASIAN COMPUTER SCIENCE CONFERENCE, ACSC'98, 1998, 20 (01): : 169 - 180
  • [46] Quotient rings and Fountain-Gould left orders by the local approach
    Miguel Gómez Lozano
    Mercedes Siles Molina
    Acta Mathematica Hungarica, 2002, 97 : 287 - 301
  • [47] A Method for Storage Node Allocation in Erasure Code based Storage Systems.
    Lee, Ojus Thomas
    Akash, G. J.
    Kumar, S. D. Madhu
    Chandran, Priya
    2017 IEEE 3RD INTERNATIONAL CONFERENCE ON COLLABORATION AND INTERNET COMPUTING (CIC), 2017, : 449 - 454
  • [48] Quotient rings and Fountain-Gould left orders by the local approach
    Lozano, MG
    Molina, MS
    ACTA MATHEMATICA HUNGARICA, 2002, 97 (04) : 287 - 301
  • [49] Decoding code on a sensor node
    von Rickenbach, Pascal
    Wattenhofer, Roger
    DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, 2008, 5067 : 400 - 414
  • [50] TREE CODE SIMULATIONS OF PLANETARY RINGS
    RICHARDSON, DC
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 1994, 269 (02) : 493 - 511