Performance Improvement of Accumulate-Repeat-Accumulate Codes with Bounded Complexity

被引：0
|
作者：
Saad, Waleed [1 ]
Ibraheem, Shady M. [2 ,3 ]
Abd Elrazzak, Maher M. [2 ,3 ]
Eldin, Salwa S. [4 ,5 ]
Aboelazm, Atef E. [1 ]
机构：
[1] Menoufiya Univ, Fac Elect Engn, Dept Commun Engn, Menoufia, Egypt
[2] Mansoura Univ, Fac Engn, Dept Commun Engn, Mansoura, Egypt
[3] Telecom Egypt, Cairo, Egypt
[4] Tanta Univ, Fac Engn, Dept Commun Engn, Tanta, Egypt
[5] Taif Univ, At Taif, Saudi Arabia
来源：
2015 IEEE 82ND VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL) | 2015年
关键词：
Binary erasure channels (BEC); density evolution (DE); spatially coupling; degree distributions; state nodes; ENSEMBLES; CHANNEL;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this paper, we introduce a new family of codes named as systematic spatially-coupled accumulate repeat accumulate SC-ARA codes based on chain of interconnected proto-graphs over the binary erasure channels (BEC). It has been observed that Spatially-coupled low density parity check (SC-LDPC) codes are able to approach the capacity universally across the binary-input memoryless (BMS) channels. A density evolution (DE) analysis is provided for this class of codes which categorized by bounded density and/or complexity per information bit. Simulation results show that the spatially coupling of ensembles of ARA codes, with bounded density and/or complexity, drives the message-passing belief propagation decoding threshold (BP) to be closed to the maximum a posterior (MAP) threshold of the underlying codes over the BEC.
引用
收藏
页数：5
相关论文
共 50 条
  • [31] Product accumulate codes: A class of codes with near-capacity performance and low decoding complexity
    Li, J
    Narayanan, KR
    Georghiades, CN
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (01) : 31 - 46
  • [32] Stopping Set Analysis of Repeat Multiple-Accumulate Codes
    Graell i Amat, Alexandre
    Rosnes, Eirik
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1814 - +
  • [33] Combinatorial interleavers for systematic regular repeat-accumulate codes
    Johnson, Sarah J.
    Weller, Steven R.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (08) : 1201 - 1206
  • [34] Repeat-Accumulate Codes for Block-Fading Channels
    Kadel, Rajan
    Lechner, Gottfried
    2013 AUSTRALIAN COMMUNICATIONS THEORY WORKSHOP (AUSCTW), 2013, : 37 - 42
  • [35] Design of repeat-accumulate codes for iterative detection and decoding
    ten Brink, S
    Kramer, G
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2003, 51 (11) : 2764 - 2772
  • [36] Unified decoder architectures for repeat-accumulate and LDPC codes
    Mansour, MM
    CONFERENCE RECORD OF THE THIRTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 2004, : 527 - 531
  • [37] Asymptotic weight distributions of irregular repeat-accumulate codes
    Hsu, CH
    Anastasopoulos, A
    GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 1147 - 1151
  • [38] Spectra and Minimum Distances of Repeat Multiple-Accumulate Codes
    Ravazzi, Chiara
    Fagnani, Fabio
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (11) : 4905 - 4924
  • [39] A Novel Channel Coding Scheme of Accumulate Repeat Tree Codes
    Yang, Maofan
    Fang, Liang
    Zhang, Xin
    Yang, Dacheng
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 454 - 457
  • [40] Design of rate-compatible irregular repeat accumulate codes
    Yue, Guosen
    Wang, Xiaodong
    Madihian, Mohammad
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (06) : 1153 - 1163
12345