Soft decoding method for systematic raptor codes

被引:12
|
作者
Zhang, Meixiang [1 ]
Kim, Sooyoung [1 ]
Chang, Jin Yeong [2 ]
Kim, Won-Yong [2 ]
机构
[1] Chonbuk Natl Univ, Div Elect Engn, IT Convergence Res Ctr, Jeonju, South Korea
[2] Comesta Inc, Taejon, South Korea
基金
新加坡国家研究基金会;
关键词
decoding; channel coding; transform coding; iterative decoding; soft decoding method; systematic Raptor codes; rateless codes; binary erasure channels; decoder; modified Tanner graph; Luby transform codes; soft iterative decoding algorithm; decoding performance; iterative soft decoding method; parallel decoding method; PERFORMANCE;
D O I
10.1049/iet-com.2015.0100
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative loops can be employed in the decoder. In this study, the authors propose a method to construct modified Tanner graphs for systematic raptor codes in order to increase the efficiency of soft decoding. A modified Tanner graph is drawn in terms of bit and check nodes for each component code, instead of encoding and information nodes, as in conventional Tanner graphs, for its component Luby transform codes. This modified Tanner graph enables the use of a more simplified soft iterative decoding algorithm and provides improved decoding performance compared with the conventional method. In addition, they propose an efficient joint iterative soft decoding method with a parallel process to speed up the iterative decoding. The simulation results in this study reveal that the modified Tanner graph works better than the conventional Tanner graph for joint iterative decoding, and that the proposed parallel decoding method can contribute to further enhance the performance as well as the decoding speed by reducing the average number of iterations.
引用
收藏
页码:1933 / 1940
页数:8
相关论文
共 50 条
  • [41] Raptor codes
    Shokrollahi, Amin
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) : 2551 - 2567
  • [42] On Raptor Codes
    Pishro-Nik, Hossein
    Fekri, Faramarz
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 1137 - 1141
  • [43] An efficient algorithm for ML decoding of Raptor codes over the binary erasure channel
    Kim, Saejoon
    Lee, Seunghyuk
    Chung, Sae-Young
    [J]. IEEE COMMUNICATIONS LETTERS, 2008, 12 (08) : 578 - 580
  • [44] An On-line Decoding Algorithm for 3GPP MBMS Raptor Codes
    Xing, Yanling
    Ge, Ning
    [J]. 2015 IEEE 81ST VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2015,
  • [45] An Efficient Algorithm for Encoding and Decoding of Raptor Codes over the Binary Erasure Channel
    Zhang Ya-Hang
    Cheng Bo-Wen
    Zou Guang-Nan
    Wen Wei-Ping
    Qing Si-Han
    [J]. INTERNATIONAL CONFERENCE ON SPACE INFORMATION TECHNOLOGY 2009, 2010, 7651
  • [46] Adjustable Soft List Decoding for Polar Codes
    Feng, Bowen
    Jiao, Jian
    Liang, Kexin
    Wu, Shaohua
    Wang, Ye
    Zhang, Qinyu
    [J]. 2019 IEEE 90TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-FALL), 2019,
  • [47] A decoding method for multilayer codes
    Ibrahim, N
    Kaleh, GK
    [J]. IEEE COMMUNICATIONS LETTERS, 1999, 3 (04) : 100 - 102
  • [48] Improved Soft Cancellation Decoding of Polar Codes
    Mingyue You
    Zhifeng Ma
    [J]. Journal of Beijing Institute of Technology, 2020, 29 (03) : 386 - 392
  • [49] Soft decoding of several classes of array codes
    Blaum, M
    Fan, JL
    Xu, LH
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 368 - 368
  • [50] SOFT DECISION DECODING OF BLOCK CODES.
    Baumert, L.D.
    McEliece, R.J.
    [J]. 1600, Int Found for Telem, Woodland Hills, Calif (14):