Finite-length repeat-accumulate codes on the binary erasure channel

被引：2
|
作者：
Johnson, SJ [1 ]
机构：
[1] Univ Newcastle, Sch Elect Engn & Comp Sci, Callaghan, NSW 2308, Australia
来源：
2005 ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC), VOLS 1& 2 | 2005年
关键词：
D O I：
10.1109/APCC.2005.1554051
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
This paper considers the finite-length performance of repeat-accumulate codes on the binary erasure channel. We provide lower bounds for the minimum stopping set size of RA codes and develop finite-length analysis algorithms for them. Using these results the effect of the RA accumulator and the choice of repetition rate on the decoding performance of finite length RA codes is investigated, and their performance compared to that of low-density parity-check codes.
引用
收藏
页码：217 / 221
页数：5
相关论文
共 50 条
  • [1] Finite-length scaling of repeat-accumulate codes on the BEC
    Andriyanova, Iryna
    2008 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS, 2008, : 64 - 67
  • [2] Performance estimation of finite-length repeat-accumulate codes
    Noor-A-Rahim, Md.
    Zhang, Nan
    Wang, Siyi
    IET COMMUNICATIONS, 2015, 9 (15) : 1902 - 1905
  • [3] Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel
    Sason, I
    Urbanke, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) : 1247 - 1256
  • [4] Improved finite-length Luby-transform codes in the binary erasure channel
    Hayajneh, Khaled F.
    Yousefi, Shahram
    Valipour, Mehrdad
    IET COMMUNICATIONS, 2015, 9 (08) : 1122 - 1130
  • [5] A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel
    Johnson, Sarah J.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (01) : 27 - 32
  • [6] Repeat-Accumulate Signal Codes
    Takai, Manato
    Ishibashi, Koji
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (04) : 2607 - 2619
  • [7] Finite-length analysis of turbo decoding on the binary erasure channel
    Rosnes, E
    Ytrehus, O
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 1246 - 1250
  • [8] Constructions for irregular repeat-accumulate codes
    Johnson, SJ
    Weller, SR
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 179 - 183
  • [9] Finite-length analysis of low-density parity-check codes on the binary erasure channel
    Di, CY
    Proietti, D
    Telatar, IE
    Richardson, TJ
    Urbanke, RL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (06) : 1570 - 1579
  • [10] Spatially Coupled Repeat-Accumulate Codes
    Johnson, Sarah
    Lechner, Gottfried
    IEEE COMMUNICATIONS LETTERS, 2013, 17 (02) : 373 - 376
12345