A Novel Channel Coding Scheme of Accumulate Repeat Tree Codes

被引：0
|
作者：
Yang, Maofan [1 ]
Fang, Liang [1 ]
Zhang, Xin [1 ]
Yang, Dacheng [1 ]
机构：
[1] Beijing Univ Posts & Telecommun, Sch Informat Engn, Beijing 100088, Peoples R China
来源：
2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8 | 2009年
关键词：
Tanner graph; turbo-like codes; iterative decoding; belief-propagation algorithm; PERFORMANCE; DESIGN;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper is concerned with a novel channel coding scheme called accumulate repeat tree (ART) codes which are constructed based on repeat accumulate (RA) codes and concatenated tree (CT) codes. This class of codes can be viewed as special low-density parity-check (LDPC) codes, or as special turbo codes, so they are proposed as turbo-like codes combing many advantages of LDPC and turbo codes. ART codes have a Tanner graph representation, and they are decodable by belief-propagation (BP) iterative algorithm. The code structures are discussed. The simulation in both AWGN and Rayleigh fading channels is given and compared with RA and CT codes. The results and theoretical analysis show the enhanced performance of ART codes.
引用
收藏
页码：454 / 457
页数：4
相关论文
共 50 条
  • [11] Extended Hamming accumulate codes and modified irregular repeat accumulate codes
    Park, SI
    Yang, K
    ELECTRONICS LETTERS, 2002, 38 (10) : 467 - 468
  • [12] Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity
    Pfister, Henry D.
    Sason, Igal
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) : 2088 - 2115
  • [13] On the Minimum Trapping Distance of Repeat Accumulate Accumulate Codes
    Kliewer, Joerg
    Zigangirov, Kamil S.
    Costello, Daniel J., Jr.
    2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 1410 - +
  • [14] Coding for parallel channels: Gallager bounds and applications to repeat-accumulate codes
    Sason, Igal
    Goldenberg, Idan
    2006 IEEE 24TH CONVENTION OF ELECTRICAL & ELECTRONICS ENGINEERS IN ISRAEL, 2006, : 338 - +
  • [15] A practical scheme for relaying in sensor networks using repeat-accumulate codes
    Eckford, Andrew W.
    Adve, Raviraj S.
    2006 40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-4, 2006, : 386 - 391
  • [16] Repeat-Accumulate Signal Codes
    Takai, Manato
    Ishibashi, Koji
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (04) : 2607 - 2619
  • [17] Iterative decoding and channel parameter estimation algorithms for repeat-accumulate codes
    Oh, W
    Cheun, K
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (10) : 1597 - 1602
  • [18] Finite-length repeat-accumulate codes on the binary erasure channel
    Johnson, SJ
    2005 ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC), VOLS 1& 2, 2005, : 217 - 221
  • [19] Performance Improvement of Accumulate-Repeat-Accumulate Codes with Bounded Complexity
    Saad, Waleed
    Ibraheem, Shady M.
    Abd Elrazzak, Maher M.
    Eldin, Salwa S.
    Aboelazm, Atef E.
    2015 IEEE 82ND VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2015,
  • [20] Design of irregular repeat accumulate codes for OFDM systems with partial channel state information
    Sankar, H
    Narayanan, KR
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (05) : 2491 - 2497
12345